Cryptographic Hardness of Random Local FunctionsSurvey

被引：0
|
作者：
Benny Applebaum
机构：
[1] Tel-Aviv University,School of Electrical Engineering
来源：
computational complexity | 2016年 / 25卷
关键词：
94A60; 68Q17; 68P25; constant-depth circuits; cryptography; hash functions; local functions; NC0; one-way functions; pseudorandom generators; public-key encryption;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Constant parallel-time cryptography allows to perform complex cryptographic tasks at an ultimate level of parallelism, namely by local functions that each of their output bits depend on a constant number of input bits. A natural way to obtain local cryptographic constructions is to use random local functions in which each output bit is computed by applying some fixed d-ary predicate P to a randomly chosen d-size subset of the input bits.
引用
收藏
页码：667 / 722
页数：55
相关论文
共 50 条
  • [31] On Random Pattern Testability of Cryptographic VLSI Cores
    A. Schubert
    W. Anheier
    Journal of Electronic Testing, 2000, 16 : 185 - 192
  • [32] No Random, No Ransom: A Key to Stop Cryptographic Ransomware
    Genc, Ziya Alper
    Lenzini, Gabriele
    Ryan, Peter Y. A.
    DETECTION OF INTRUSIONS AND MALWARE, AND VULNERABILITY ASSESSMENT, DIMVA 2018, 2018, 10885 : 234 - 255
  • [33] Cryptographic Random Number Generator for Mobile Devices
    Ozkaynak, Fatih
    Ozdemir, Halil Ibrahim
    Ozer, Ahmet Bedri
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 1733 - 1736
  • [34] On random pattern testability of cryptographic VLSI cores
    Schubert, A
    Anheier, W
    JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2000, 16 (03): : 185 - 192
  • [35] Cryptographic hardness under projections for time-bounded Kolmogorov complexity
    Allender, Eric
    Gouwar, John
    Hirahara, Shuichi
    Robelle, Caleb
    THEORETICAL COMPUTER SCIENCE, 2023, 940 : 206 - 224
  • [36] NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
    Huang, Yizhi
    Ilango, Rahul
    Ren, Hanlin
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1067 - 1075
  • [37] A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
    Haitner, Iftach
    Mahmoody, Mohammad
    Xiao, David
    25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, : 76 - 87
  • [38] Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping
    Fang, Zhu
    Xu, Zhengquan
    INFORMATION, 2022, 13 (11)
  • [39] PRaCto: Pseudo Random bit generator for Cryptographic application
    Raza, Saiyma Fatima
    Satpute, Vishal R.
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2018, 12 (12): : 6161 - 6176
  • [40] A CMOS Hybrid Random Number Generator for Cryptographic Systems
    Chiang, Cheng-Ta
    2012 IEEE SYMPOSIUM ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ISIEA 2012), 2012,
12345