The Fiat-Shamir Transformation in a Quantum World.
作者： Marc Fischlin , Tommaso Gagliardoni , Özgür Dagdelen
DOI:
关键词:
摘要: The Fiat-Shamir transformation is a famous technique to turn identification schemes into signature schemes. derived scheme provably secure in the random-oracle model against classical adversaries. Still, has also been suggested be used connection with quantum-immune schemes, order get However, recent paper by Boneh et al. (Asiacrypt 2011) raised issue that results may not immediately applicable quantum adversaries, because such adversaries should allowed query random oracle superposition. It unclear if still this (QROM). Here, we discuss giving proofs for QROM presumably hard. We show there cannot black-box extractors, as long underlying active and first message of prover independent its witness. Most are type. then some one able resurrect result modifying protocol first. particular version Lyubashevsky which QROM.
参考文章(44)
Daniele Micciancio, Chris Peikert, Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller Advances in Cryptology – EUROCRYPT 2012. pp. 700- 718 ,(2012) , 10.1007/978-3-642-29011-4_41
Vadim Lyubashevsky, Lattice Signatures without Trapdoors Advances in Cryptology – EUROCRYPT 2012. ,vol. 7237, pp. 738- 755 ,(2012) , 10.1007/978-3-642-29011-4_43
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
Tim Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann, Practical lattice-based cryptography: a signature scheme for embedded systems cryptographic hardware and embedded systems. pp. 530- 547 ,(2012) , 10.1007/978-3-642-33027-8_31
Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry, Random oracles in a quantum world international conference on the theory and application of cryptology and information security. pp. 41- 69 ,(2011) , 10.1007/978-3-642-25385-0_3
Marc Fischlin, Communication-efficient non-interactive proofs of knowledge with online extractors international cryptology conference. pp. 152- 168 ,(2005) , 10.1007/11535218_10
Rafael Pass, On Deniability in the Common Reference String and Random Oracle Model Advances in Cryptology - CRYPTO 2003. pp. 316- 337 ,(2003) , 10.1007/978-3-540-45146-4_19
Chris Peikert, Joël Alwen, Generating Shorter Bases for Hard Random Lattices symposium on theoretical aspects of computer science. ,vol. 3, pp. 86- ,(2009) , 10.4230/LIPICS.STACS.2009.1832
S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan, A Group Signature Scheme from Lattice Assumptions international conference on the theory and application of cryptology and information security. pp. 395- 412 ,(2010) , 10.1007/978-3-642-17373-8_23
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro, Random Oracles With(out) Programmability international conference on the theory and application of cryptology and information security. pp. 303- 320 ,(2010) , 10.1007/978-3-642-17373-8_18