Zero-knowledge against quantum attacks
From MaRDI portal
Publication:2931394
DOI10.1145/1132516.1132560zbMath1301.68131arXivquant-ph/0511020OpenAlexW1971684380WikidataQ21725078 ScholiaQ21725078MaRDI QIDQ2931394
Publication date: 25 November 2014
Published in: SIAM Journal on Computing, Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0511020
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (75)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ One-way functions imply secure computation in a quantum world ⋮ Unconditionally secure multi-party quantum commitment scheme ⋮ Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ New Limits to Classical and Quantum Instance Compression ⋮ Quantum computation vs. firewalls ⋮ On the time dependence of holographic complexity in a dynamical Einstein-Dilaton model ⋮ ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Nondeterministic unitary OBDDs ⋮ Watermarking PRFs against quantum adversaries ⋮ Non-malleable commitments against quantum attacks ⋮ Complexity of mixed Gaussian states from Fisher information geometry ⋮ Succinct arguments in the quantum random oracle model ⋮ Statistical zero knowledge and quantum one-way functions ⋮ Complexity limitations on one-turn quantum refereed games ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Complexity of mixed states in QFT and holography ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ A note on the post-quantum security of (ring) signatures ⋮ Comments on holographic complexity ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ New constructions of collapsing hashes ⋮ Post-quantum insecurity from LWE ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Efficient authentication from hard learning problems ⋮ Efficient Quantum Algorithms for Testing Symmetries of Open Quantum Systems ⋮ Tracing quantum state distinguishers via backtracking ⋮ On concurrent multi-party quantum computation ⋮ Cryptography with certified deletion ⋮ Post-quantum verification of Fujisaki-Okamoto ⋮ Quantum cryptography beyond quantum key distribution ⋮ Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Post-quantum resettably-sound zero knowledge ⋮ 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 ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Complexity equals anything. II. ⋮ On the time dependence of holographic complexity ⋮ Protocols for quantum binary voting ⋮ Circuit complexity in quantum field theory ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Holographic complexity equals which action? ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ Fully Simulatable Quantum-Secure Coin-Flipping and Applications ⋮ Quantum Commitments from Complexity Assumptions ⋮ Everlasting multi-party computation ⋮ Quantum protocols for zero-knowledge systems ⋮ Faithful squashed entanglement ⋮ Unnamed Item ⋮ General Properties of Quantum Zero-Knowledge Proofs ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge ⋮ Subsystem complexity after a global quantum quench ⋮ 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 ⋮ Holographic complexity for defects distinguishes action from volume ⋮ Holographic complexity and de Sitter space ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies ⋮ Non-interactive zero-knowledge arguments for QMA, with preprocessing ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Quantum commitments from complexity assumptions ⋮ Quantum indistinguishability for public key encryption
This page was built for publication: Zero-knowledge against quantum attacks
