Quantum Proofs of Knowledge
From MaRDI portal
Publication:2894405
DOI10.1007/978-3-642-29011-4_10zbMath1298.81059DBLPconf/eurocrypt/Unruh12OpenAlexW2172643090WikidataQ62038929 ScholiaQ62038929MaRDI QIDQ2894405
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_10
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (43)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Watermarking PRFs against quantum adversaries ⋮ Non-malleable commitments against quantum attacks ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ Post-quantum insecurity from LWE ⋮ Quantum rewinding for many-round protocols ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Tracing quantum state distinguishers via backtracking ⋮ Post-quantum verification of Fujisaki-Okamoto ⋮ Quantum cryptography beyond quantum key distribution ⋮ The round complexity of quantum zero-knowledge ⋮ Relationships between quantum IND-CPA notions ⋮ Classical binding for quantum commitments ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images ⋮ Everlasting multi-party computation ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security ⋮ Efficient simulation of random states and random unitaries ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ Post-quantum multi-party computation ⋮ Oblivious transfer is in MiniQCrypt ⋮ Classical proofs of quantum knowledge ⋮ Semantic Security and Indistinguishability in the Quantum World ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies ⋮ The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more ⋮ Non-interactive zero-knowledge arguments for QMA, with preprocessing ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries
This page was built for publication: Quantum Proofs of Knowledge
