On Basing Size-Verifiable One-Way Functions on NP-Hardness

被引：0
|
作者：
Bogdanov, Andrej [1 ]
Brzuska, Christina [2 ,3 ]
机构：
[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
[2] Microsoft Res, Cambridge, England
[3] Tel Aviv Univ, IL-69978 Tel Aviv, Israel
来源：
THEORY OF CRYPTOGRAPHY (TCC 2015), PT I | 2015年 / 9014卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove that if the hardness of inverting a size-verifiable one-way function can be based on NP-hardness via a general (adaptive) reduction, then NP subset of coAM. This claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but was later retracted (STOC 2010).
引用
收藏
页码：1 / 6
页数：6
相关论文
共 50 条
  • [31] On complete one-way functions
    Kozhevnikov, A. A.
    Nikolenko, S. I.
    PROBLEMS OF INFORMATION TRANSMISSION, 2009, 45 (02) : 168 - 183
  • [32] On the impossibilities of basing one-way permutations on central cryptographic primitives
    Chang, YC
    Hsiao, CY
    Lu, CJ
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2002, PROCEEDINGS, 2002, 2501 : 110 - 124
  • [33] The impossibility of basing one-way permutations on central cryptographic primitives
    Chang, YC
    Hsiao, CY
    Lu, CJ
    JOURNAL OF CRYPTOLOGY, 2006, 19 (01) : 97 - 114
  • [34] The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
    Yan-Cheng Chang
    Chun-Yuan Hsiao
    Chi-Jen Lu
    Journal of Cryptology, 2006, 19 : 97 - 114
  • [35] Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions
    Mao, Xinyu
    Mazor, Noam
    Zhang, Jiapeng
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT IV, 2023, 14007 : 502 - 531
  • [36] SYMMETRY OF INFORMATION AND ONE-WAY FUNCTIONS
    LONGPRE, L
    MOCAS, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 308 - 315
  • [37] ONE-WAY FUNCTIONS AND THE ISOMORPHISM CONJECTURE
    GANESAN, K
    THEORETICAL COMPUTER SCIENCE, 1994, 129 (02) : 309 - 321
  • [38] SYMMETRY OF INFORMATION AND ONE-WAY FUNCTIONS
    LONGPRE, L
    MOCAS, S
    INFORMATION PROCESSING LETTERS, 1993, 46 (02) : 95 - 100
  • [39] Kolmogorov One-Way Functions Revisited
    Casal, Filipe
    Rasga, Joao
    Souto, Andre
    CRYPTOGRAPHY, 2018, 2 (02) : 1 - 12
  • [40] Extractable perfectly one-way functions
    Canetti, Ran
    Dakdouk, Ronny Ramzi
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, PROCEEDINGS, 2008, 5126 : 449 - +
12345