Limits on the Power of Garbling Techniques for Public-Key Encryption
作者： Sanjam Garg , Mohammad Hajiabadi , Mohammad Mahmoody , Ameer Mohammed
DOI: 10.1007/978-3-319-96878-0_12
关键词:
摘要: Understanding whether public-key encryption can be based on one-way functions is a fundamental open problem in cryptography. The seminal work of Impagliazzo and Rudich [STOC’89] shows that black-box constructions from are impossible. However, this impossibility result leaves the possibility using non-black-box techniques for achieving goal.
springer.com
elsevier.com
sci-hub.st 参考文章(36)
Paul Baecher, Christina Brzuska, Marc Fischlin, Notions of Black-Box Reductions, Revisited international cryptology conference. pp. 296- 315 ,(2013) , 10.1007/978-3-642-42033-7_16
Steve Lu, Rafail Ostrovsky, How to Garble RAM Programs theory and application of cryptographic techniques. pp. 719- 734 ,(2013) , 10.1007/978-3-642-38348-9_42
Ran Canetti, Yael Tauman Kalai, Omer Paneth, On Obfuscation with Random Oracles Theory of Cryptography. pp. 456- 467 ,(2015) , 10.1007/978-3-662-46497-7_18
Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich, Limits on the power of zero-knowledge proofs in cryptographic constructions theory of cryptography conference. pp. 559- 578 ,(2011) , 10.1007/978-3-642-19571-6_34
Chun-Yuan Hsiao, Leonid Reyzin, Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? Advances in Cryptology – CRYPTO 2004. pp. 92- 105 ,(2004) , 10.1007/978-3-540-28628-8_6
Omer Reingold, Luca Trevisan, Salil Vadhan, Notions of Reducibility between Cryptographic Primitives theory of cryptography conference. pp. 1- 20 ,(2004) , 10.1007/978-3-540-24638-1_1
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam, Towards non-black-box lower bounds in cryptography theory of cryptography conference. pp. 579- 596 ,(2011) , 10.1007/978-3-642-19571-6_35
Y. Ishai, E. Kushilevitz, Randomizing polynomials: A new representation with applications to round-efficient secure computation foundations of computer science. pp. 294- 304 ,(2000) , 10.1109/SFCS.2000.892118
Amit Sahai, Brent Waters, How to use indistinguishability obfuscation: deniable encryption, and more symposium on the theory of computing. pp. 475- 484 ,(2014) , 10.1145/2591796.2591825
Donald Beaver, Correlated pseudorandomness and the complexity of private computations symposium on the theory of computing. pp. 479- 488 ,(1996) , 10.1145/237814.237996