On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
暂无分享,去创建一个
[1] Adam O'Neill,et al. Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles , 2008, CRYPTO.
[2] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[3] Victor Shoup,et al. Sequences of games: a tool for taming complexity in security proofs , 2004, IACR Cryptol. ePrint Arch..
[4] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Gil Segev,et al. Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption , 2008, IACR Cryptol. ePrint Arch..
[6] Victor Shoup,et al. A Composition Theorem for Universal One-Way Hash Functions , 2000, EUROCRYPT.
[7] Yevgeniy Dodis,et al. Correcting errors without leaking partial information , 2005, STOC '05.
[8] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[9] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[10] Ran Canetti,et al. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information , 1997, CRYPTO.
[11] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[12] Rafail Ostrovsky,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..
[13] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[14] Yael Tauman Kalai,et al. On the (In)security of the Fiat-Shamir paradigm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[15] Ran Canetti,et al. Perfectly One-Way Probabilistic Hash Functions , 1998, Symposium on the Theory of Computing.
[16] Simon Pierre Desrosiers,et al. Entropic security in quantum cryptography , 2007, Quantum Inf. Process..
[17] Alexander Russell,et al. How to fool an unbounded adversary with a short key , 2002, IEEE Transactions on Information Theory.
[18] David Chaum,et al. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer , 1991, CRYPTO.
[19] Mihir Bellare,et al. Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.
[20] S. F. Actory,et al. Personal correspondence , 1997 .
[21] Yevgeniy Dodis,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, EUROCRYPT.
[22] Frédéric Dupuis,et al. Quantum Entropic Security and Approximate Quantum Encryption , 2007, IEEE Transactions on Information Theory.
[23] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[24] Mihir Bellare,et al. Code-Based Game-Playing Proofs and the Security of Triple Encryption , 2004, IACR Cryptol. ePrint Arch..
[25] Ivan Damgård,et al. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption , 2003, CRYPTO.
[26] Yevgeniy Dodis,et al. Entropic Security and the Encryption of High Entropy Messages , 2005, TCC.
[27] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[28] Brent Waters,et al. Lossy trapdoor functions and their applications , 2008, SIAM J. Comput..
[29] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[30] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[31] Mihir Bellare,et al. Collision-Resistant Hashing: Towards Making UOWHFs Practical , 1997, CRYPTO.
[32] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[33] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[34] Ivan Damgård,et al. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor , 2001, CRYPTO.
[35] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[36] Mihir Bellare,et al. An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem , 2004, EUROCRYPT.