Additional Topics in Cryptography
暂无分享,去创建一个
[1] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[2] Mihir Bellare,et al. Practice-Oriented Provable-Security , 1997, ISW.
[3] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[4] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[5] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[6] Adi Shamir,et al. How to share a secret , 1979, CACM.
[7] John Sullivan,et al. Another Look at , 1979 .
[8] Alfred Menezes,et al. Another Look at "Provable Security" , 2005, Journal of Cryptology.
[9] Daniel Bleichenbacher,et al. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 , 1998, CRYPTO.
[10] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[11] Raymond Laflamme,et al. An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..
[12] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[13] Christof Zalka,et al. Shor's discrete logarithm quantum algorithm for elliptic curves , 2003, Quantum Inf. Comput..
[14] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[15] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.
[16] Craig Gentry,et al. A fully homomorphic encryption scheme , 2009 .