Algorithms and Computation
From MaRDI portal
Publication:5191646
DOI10.1007/b94771zbMath1205.68158OpenAlexW1769833081MaRDI QIDQ5191646
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
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 (13)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ General properties of quantum bit commitments (extended abstract) ⋮ A new framework for quantum oblivious transfer ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ Post-quantum resettably-sound zero knowledge ⋮ Generalized Quantum Arthur--Merlin Games ⋮ General Properties of Quantum Zero-Knowledge Proofs ⋮ An application of quantum finite automata to interactive proof systems
This page was built for publication: Algorithms and Computation
