Security of the Fiat-Shamir transformation in the quantum random-oracle model

DOI10.1007/978-3-030-26951-7_13OpenAlexW2917473520MaRDI QIDQ2304988

Christian Schaffner, Christian Majenz, Jelle Don, Serge Fehr

Publication date: 9 March 2020

Full work available at URL: https://arxiv.org/abs/1902.07556

Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)

Related Items

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ A Note on the Instantiability of the Quantum Random Oracle ⋮ Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Post-quantum adaptor signature for privacy-preserving off-chain payments ⋮ One-time traceable ring signatures ⋮ An isogeny-based ID protocol using structured public keys ⋮ Black-box accumulation based on lattices ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Post-quantum security of the Even-Mansour cipher ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ Online-extractability in the quantum random-oracle model ⋮ Succinct arguments in the quantum random oracle model ⋮ PKP-based signature scheme ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ A note on the post-quantum security of (ring) signatures ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Tight adaptive reprogramming in the QROM ⋮ New constructions of collapsing hashes ⋮ Constructive post-quantum reductions ⋮ On actively secure fine-grained access structures from isogeny assumptions ⋮ A new framework for quantum oblivious transfer ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ Secure quantum computation with classical communication ⋮ Post-quantum resettably-sound zero knowledge ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Signatures from sequential-OR proofs ⋮ Efficient simulation of random states and random unitaries ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ Classical vs quantum random oracles ⋮ Banquet: short and fast signatures from AES ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ \textsf{CSI-RAShi}: distributed key generation for CSIDH