Structure vs. Hardness Through the Obfuscation Lens

被引:15
作者
Bitansky, Nir [1 ]
Degwekar, Akshay [1 ]
Vaikuntanathan, Vinod [1 ]
机构
[1] MIT, 77 Massachusetts Ave, Cambridge, MA 02139 USA
来源
ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I | 2017年 / 10401卷
关键词
Indistinguishability obfuscation; Statistical zero-knowledge; NP boolean AND coNP; Structured hardness; Collision-resistant hashing; STATISTICAL ZERO-KNOWLEDGE; GENERIC CRYPTOGRAPHIC CONSTRUCTIONS; PUBLIC-KEY ENCRYPTION; SECURE HASH FUNCTIONS; FINDING COLLISIONS; LOWER BOUNDS; HOMOMORPHIC ENCRYPTION; LATTICE PROBLEMS; PROMISE PROBLEMS; COMPLEXITY;
D O I
10.1007/978-3-319-63688-7_23
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Much of modern cryptography, starting from public-key encryption and going beyond, is based on the hardness of structured (mostly algebraic) problems like factoring, discrete log or finding short lattice vectors. While structure is perhaps what enables advanced applications, it also puts the hardness of these problems in question. In particular, this structure often puts them in low complexity classes such as NP boolean AND coNP or statistical zero-knowledge (SZK). Is this structure really necessary? For some cryptographic primitives, such as one-way permutations and homomorphic encryption, we know that the answer is yes-they imply hard problems in NP boolean AND coNP and SZK, respectively. In contrast, one-way functions do not imply such hard problems, at least not by fully black-box reductions. Yet, for many basic primitives such as public-key encryption, oblivious transfer, and functional encryption, we do not have any answer. We show that the above primitives, and many others, do not imply hard problems in NP boolean AND coNP or SZK via fully black-box reductions. In fact, we first show that even the very powerful notion of Indistinguishability Obfuscation (IO) does not imply such hard problems, and then deduce the same for a large class of primitives that can be constructed from IO.
引用
收藏
页码:696 / 723
页数:28
相关论文
共 82 条
  • [71] Pass R, 2013, LECT NOTES COMPUT SC, V7785, P334, DOI 10.1007/978-3-642-36594-2_19
  • [72] Pass R, 2006, ANN IEEE CONF COMPUT, P96
  • [73] Reingold O, 2004, LECT NOTES COMPUT SC, V2951, P1
  • [74] RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]
  • [75] Rosen Alon., 2016, Electronic Colloquium on Computational Complexity (ECCC), V23, P59
  • [76] Rudich S, 1992, LECT NOTES COMPUTER, V576, P242, DOI 10.1007/3-540-46766-119
  • [77] Rudich S, 1988, THESIS
  • [78] A complete problem for statistical zero knowledge
    Sahai, A
    Vadhan, S
    [J]. JOURNAL OF THE ACM, 2003, 50 (02) : 196 - 249
  • [79] How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
    Sahai, Amit
    Waters, Brent
    [J]. STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 475 - 484
  • [80] Simon DR, 1998, LECT NOTES COMPUT SC, V1403, P334, DOI 10.1007/BFb0054137