New Circular Security Counterexamples from Decision Linear and Learning with Errors
暂无分享,去创建一个
[1] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[2] Jonathan Herzog,et al. Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage , 2009, J. Comput. Secur..
[3] Benny Applebaum,et al. Key-Dependent Message Security: Generic Amplification and Completeness , 2011, Journal of Cryptology.
[4] Thomas Holenstein,et al. On the (Im)Possibility of Key Dependent Encryption , 2009, TCC.
[5] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[6] Zvika Brakerski,et al. Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back) , 2010, IACR Cryptol. ePrint Arch..
[7] Brent Waters,et al. Separations in Circular Security for Arbitrary Length Key Cycles , 2015, TCC.
[8] Hovav Shacham,et al. The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions , 2013, CT-RSA.
[9] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[10] Claudio Orlandi,et al. Obfuscation ==> (IND-CPA Security =/=> Circular Security) , 2013, IACR Cryptol. ePrint Arch..
[11] John Black,et al. Encryption-Scheme Security in the Presence of Key-Dependent Messages , 2002, Selected Areas in Cryptography.
[12] David Cash,et al. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems , 2009, CRYPTO.
[13] Chris Peikert,et al. Circular and KDM Security for Identity-Based Encryption , 2012, Public Key Cryptography.
[14] Yael Tauman Kalai,et al. Black-Box Circular-Secure Encryption beyond Affine Functions , 2011, TCC.
[15] Miklós Ajtai,et al. Generating Hard Instances of the Short Basis Problem , 1999, ICALP.
[16] Peeter Laud,et al. Encryption Cycles and Two Views of Cryptography , 2013 .
[17] Chris Peikert,et al. Generating Shorter Bases for Hard Random Lattices , 2009, Theory of Computing Systems.
[18] Hovav Shacham,et al. A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants , 2007, IACR Cryptol. ePrint Arch..
[19] Eike Kiltz,et al. Secure Hybrid Encryption from Weakened Key Encapsulation , 2007, CRYPTO.
[20] Ron Rothblum,et al. On the Circular Security of Bit-Encryption , 2013, TCC.
[21] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[22] Jan Camenisch,et al. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation , 2001, IACR Cryptol. ePrint Arch..
[23] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[24] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[25] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[26] Moni Naor,et al. Public-Key Cryptosystems Resilient to Key Leakage , 2012, SIAM J. Comput..
[27] Matthew Green,et al. New Definitions and Separations for Circular Security , 2012, Public Key Cryptography.
[28] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[29] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[30] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[31] Yuval Ishai,et al. Bounded Key-Dependent Message Security , 2010, IACR Cryptol. ePrint Arch..
[32] David Cash,et al. Cryptographic Agility and Its Relation to Circular Encryption , 2010, EUROCRYPT.
[33] Rafail Ostrovsky,et al. Circular-Secure Encryption from Decision Diffie-Hellman , 2008, CRYPTO.
[34] Chris Peikert,et al. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.