Impossibility of Strong KDM Security with Auxiliary Input
暂无分享,去创建一个
[1] Moni Naor,et al. One-Way Functions and (Im)Perfect Obfuscation , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[2] Mihir Bellare,et al. Contention in Cryptoland: Obfuscation, Leakage and UCE , 2016, TCC.
[3] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[4] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[5] Yael Tauman Kalai,et al. On Symmetric Encryption and Point Obfuscation , 2010, TCC.
[6] Brent Waters,et al. Lockable Obfuscation , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[7] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[8] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[9] Brent Waters,et al. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.
[10] Chi-Jen Lu,et al. Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility , 2007, EUROCRYPT.
[11] Daniel Wichs,et al. Obfuscating Compute-and-Compare Programs under LWE , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Ron Rothblum,et al. Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption , 2018, IACR Cryptol. ePrint Arch..
[13] John Black,et al. Encryption-Scheme Security in the Presence of Key-Dependent Messages , 2002, Selected Areas in Cryptography.
[14] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[15] Arno Mittelbach,et al. Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input , 2014, ASIACRYPT.
[16] Apoorvaa Deshpande,et al. Proofs of Ignorance and Applications to 2-Message Witness Hiding , 2018, IACR Cryptol. ePrint Arch..