Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

作者: Vadim Lyubashevsky

DOI: 10.1007/978-3-642-10366-7_35

关键词:

摘要: … The security of our identification scheme is based on the hardness of finding the approximate shortest vector to within a factor of O(n 2 ) in the standard model, while the security of the …

参考文章(57)
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems international conference on the theory and application of cryptology and information security. pp. 372- 389 ,(2008) , 10.1007/978-3-540-89255-7_23
Miklós Ajtai, Generating Hard Instances of Lattice Problems Electronic Colloquium on Computational Complexity. ,vol. 3, ,(1996)
Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa, Efficient Public Key Encryption Based on Ideal Lattices international conference on the theory and application of cryptology and information security. pp. 617- 635 ,(2009) , 10.1007/978-3-642-10366-7_36
Jeffrey Shallit, Eric Bach, Algorithmic number theory MIT Press. ,(1996)
Daniel J. Bernstein, Tanja Lange, Post Quantum Cryptography Nature. ,vol. 549, pp. 188- 194 ,(2008) , 10.1038/NATURE23461
Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen, SWIFFT: A Modest Proposal for FFT Hashing fast software encryption. pp. 54- 72 ,(2008) , 10.1007/978-3-540-71039-4_4
Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre, From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security international cryptology conference. ,vol. 2332, pp. 418- 433 ,(2002) , 10.1007/3-540-46035-7_28
Tatsuaki Okamoto, Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes international cryptology conference. pp. 31- 53 ,(1992) , 10.1007/3-540-48071-4_3
Ralph C. Merkle, A Certified Digital Signature international cryptology conference. pp. 218- 238 ,(1989) , 10.1007/0-387-34805-0_21
Amos Fiat, Adi Shamir, How to prove yourself: practical solutions to identification and signature problems international cryptology conference. ,vol. 263, pp. 186- 194 ,(1987) , 10.1007/3-540-47721-7_12