Correlated-Input Secure Hash Functions
暂无分享,去创建一个
[1] Mihir Bellare,et al. Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.
[2] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[3] Adam O'Neill,et al. Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles , 2008, CRYPTO.
[4] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[5] Yuval Ishai,et al. Semantic Security under Related-Key Attacks and Applications , 2011, ICS.
[6] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[7] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[8] Moni Naor,et al. Synthesizers and their application to the parallel construction of pseudo-random functions , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[10] Silvio Micali,et al. Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering , 2004, TCC.
[11] David Cash,et al. Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks , 2010, CRYPTO.
[12] David A. Wagner,et al. Proofs of Security for the Unix Password Hashing Algorithm , 2000, ASIACRYPT.
[13] Matthew K. Franklin,et al. Low-Exponent RSA with Related Messages , 1996, EUROCRYPT.
[14] Gil Segev,et al. Chosen-Ciphertext Security via Correlated Products , 2009, SIAM J. Comput..
[15] Serge Fehr,et al. On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles , 2008, CRYPTO.
[16] Rafail Ostrovsky,et al. Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security , 2012, IACR Cryptol. ePrint Arch..
[17] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[18] Michael Ben-Or,et al. Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[19] Moti Yung,et al. A New Randomness Extraction Paradigm for Hybrid Encryption , 2009, EUROCRYPT.
[20] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[21] Mihir Bellare,et al. A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications , 2003, EUROCRYPT.
[22] David Cash,et al. Foundations of Non-malleable Hash and One-Way Functions , 2009, ASIACRYPT.
[23] Moses D. Liskov,et al. On Related-Secret Pseudorandomness , 2010, TCC.
[24] Yevgeniy Dodis,et al. A Verifiable Random Function with Short Proofs and Keys , 2005, Public Key Cryptography.
[25] Adam O'Neill,et al. Deterministic Public-Key Encryption Revisited , 2010, IACR Cryptology ePrint Archive.
[26] Ran Canetti,et al. Perfectly one-way probabilistic hash functions (preliminary version) , 1998, STOC '98.
[27] Ran Canetti,et al. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information , 1997, CRYPTO.
[28] Madhur Tulsiani,et al. Dense Subsets of Pseudorandom Sets , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[29] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[30] H. Feistel. Cryptography and Computer Privacy , 1973 .
[31] Rafail Ostrovsky,et al. Public Key Encryption with Keyword Search , 2004, EUROCRYPT.