A "proof-reading" of Some Issues in Cryptography
暂无分享,去创建一个
[1] 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..
[2] Aggelos Kiayias,et al. Advances in Cryptology - EUROCRYPT 2004 , 2004 .
[3] Mihir Bellare,et al. Practice-Oriented Provable-Security , 1997, ISW.
[4] Jesper Buus Nielsen,et al. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case , 2002, CRYPTO.
[5] Alfred Menezes,et al. Another Look at "Provable Security" , 2005, Journal of Cryptology.
[6] Silvio Micali,et al. Physically Observable Cryptography (Extended Abstract) , 2004, TCC.
[7] Andrew Odlyzko,et al. Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.
[8] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[9] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[10] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[11] Mihir Bellare,et al. An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem , 2004, EUROCRYPT.
[12] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[13] John Sullivan,et al. Another Look at , 1979 .
[14] Eli Biham,et al. Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication , 2003, CRYPTO.
[15] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[16] Daniel Bleichenbacher,et al. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 , 1998, CRYPTO.