Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
From MaRDI portal
Publication:2948402
DOI10.1007/978-3-662-46803-6_25zbMath1375.94159OpenAlexW2189468733MaRDI QIDQ2948402
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_25
Related Items (47)
A Note on the Instantiability of the Quantum Random Oracle ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms ⋮ Survey of information security ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Succinct arguments in the quantum random oracle model ⋮ PKP-based signature scheme ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Witness-succinct universally-composable SNARKs ⋮ Proving knowledge of isogenies: a survey ⋮ Computational Security of Quantum Encryption ⋮ 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 ⋮ New techniques for SIDH-based NIKE ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Improved straight-line extraction in the random oracle model with applications to signature aggregation ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ 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 ⋮ Lattice-Based Proof of a Shuffle ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ A new framework for quantum oblivious transfer ⋮ Quantum cryptography beyond quantum key distribution ⋮ Post-quantum resettably-sound zero knowledge ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Public key compression for constrained linear signature schemes ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the \(j\)-invariant equal to \(66^3\) ⋮ Identification protocols and signature schemes based on supersingular isogeny problems ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ Breaking Symmetric Cryptosystems Using Quantum Period Finding ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more ⋮ Non-interactive zero-knowledge arguments for QMA, with preprocessing ⋮ Improved lattice-based mix-nets for electronic voting
This page was built for publication: Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
