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 条

[21] Hardness of Non-interactive Differential Privacy from One-Way Functions
Kowalczyk, Lucas
Malkin, Tal
Ullman, Jonathan
Wichs, Daniel
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 : 437 - 466
[22] Pseudorandom generators from one-way functions: A simple construction for any hardness
Holenstein, Thomas
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 : 443 - 461
[23] On continuous one-way functions
Ko, Ker-, I
Wu, Lidong
THEORETICAL COMPUTER SCIENCE, 2021, 852 : 1 - 17
[24] Semigroups and one-way functions
Birget, J. C.
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2015, 25 (1-2) : 3 - 36
[25] On complete one-way functions
A. A. Kozhevnikov
S. I. Nikolenko
Problems of Information Transmission, 2009, 45 : 168 - 183
[26] Separability and one-way functions
Lance Fortnow
John D. Rogers
computational complexity, 2002, 11 : 137 - 157
[27] Physical one-way functions
Pappu, R
Recht, R
Taylor, J
Gershenfeld, N
SCIENCE, 2002, 297 (5589) : 2026 - 2030
[28] The Tale of One-Way Functions
L. A. Levin
Problems of Information Transmission, 2003, 39 (1) : 92 - 103
[29] ONE-WAY HASH FUNCTIONS
SCHNEIER, B
DR DOBBS JOURNAL, 1991, 16 (09): : 148 - 150
[30] Separability and one-way functions
Fortnow, L
Rogers, JD
COMPUTATIONAL COMPLEXITY, 2002, 11 (3-4) : 137 - 157

← 1 2 3 4 5 →