Revisiting post-quantum Fiat-Shamir
From MaRDI portal
Publication:2304987
DOI10.1007/978-3-030-26951-7_12OpenAlexW2968094846MaRDI QIDQ2304987
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_12
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)
Related Items (38)
On tight quantum security of HMAC and NMAC in the quantum random oracle model ⋮ 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 ⋮ One-time traceable ring signatures ⋮ Black-box accumulation based on lattices ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ Online-extractability in the quantum random-oracle model ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Succinct arguments in the quantum random oracle model ⋮ 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 ⋮ 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 ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Tight adaptive reprogramming in the QROM ⋮ New constructions of collapsing hashes ⋮ Constructive post-quantum reductions ⋮ Quantum rewinding for many-round protocols ⋮ Publicly-verifiable deletion via target-collapsing functions ⋮ 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 ⋮ Signatures from sequential-OR proofs ⋮ 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 ⋮ On the compressed-oracle technique, and post-quantum security of proofs of sequential work ⋮ 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 ⋮ Improved lattice-based mix-nets for electronic voting ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
This page was built for publication: Revisiting post-quantum Fiat-Shamir
