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 条
  • [21] Efficient cryptographic Protocols based on the hardness of learning parity with noise
    Katz, Jonathan
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 1 - 15
  • [22] Cryptographic hardness based on the decoding of Reed-Solomon codes
    Kiayias, Aggelos
    Yung, Moti
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2752 - 2769
  • [23] Local hardness equalization and the principle of maximum hardness
    Gazquez, Jose L.
    Vela, Alberto
    Chattaraj, Pratim K.
    JOURNAL OF CHEMICAL PHYSICS, 2013, 138 (21):
  • [24] Revisiting the definition of local hardness and hardness kernel
    Polanco-Ramirez, Carlos A.
    Franco-Perez, Marco
    Carmona-Espindola, Javier
    Gazquez, Jose L.
    Ayers, Paul W.
    PHYSICAL CHEMISTRY CHEMICAL PHYSICS, 2017, 19 (19) : 12355 - 12364
  • [25] The hardness of random quantum circuits
    Movassagh, Ramis
    NATURE PHYSICS, 2023, 19 (11) : 1719 - +
  • [26] Random key encryption a new cryptographic scheme
    Shafeeq, Muhammad
    Durrani, Mehr Yahya
    Afzal, Ifraseab
    ICIET 2007: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND EMERGING TECHNOLOGIES, 2007, : 59 - +
  • [27] The hardness of random quantum circuits
    Ramis Movassagh
    Nature Physics, 2023, 19 : 1719 - 1724
  • [28] A Method to Generate Random Number for Cryptographic Application
    Niu, Xiamu
    Wang, Yongting
    Wu, Di
    2014 TENTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING (IIH-MSP 2014), 2014, : 235 - 238
  • [29] Random Organic Nanolaser Arrays for Cryptographic Primitives
    Feng, Jiangang
    Wen, Wen
    Wei, Xiao
    Jiang, Xiangyu
    Cao, Moyuan
    Wang, Xuedong
    Zhang, Xiqi
    Jiang, Lei
    Wu, Yuchen
    ADVANCED MATERIALS, 2019, 31 (36)
  • [30] GENERATION AND TESTING OF RANDOM NUMBERS FOR CRYPTOGRAPHIC APPLICATIONS
    Marton, Kinga
    Suciu, Alin
    Sacarea, Christian
    Cret, Octavian
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2012, 13 (04): : 368 - 377
12345