Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries

DOI10.1007/978-3-319-56617-7_13zbMath1415.94416arXiv1612.07627OpenAlexW2566303413WikidataQ62045697 ScholiaQ62045697MaRDI QIDQ5270368

Anthony Leverrier, André Chailloux

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.07627

zbMATH Keywords

zero-knowledge protocolsquantum securityrelativistic cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

S-money: virtual tokens for a relativistic economy

Cites Work

• Unnamed Item
• Multivariate trace inequalities
• A parallel repetition theorem for entangled projection games
• Quantum Position Verification in the Random Oracle Model
• Quantum Proofs of Knowledge
• Two Provers in Isolation
• Position Based Cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Optimal sequence of quantum measurements in the sense of Stein s lemma in quantum hypothesis testing
• Coding theorem and strong converse for quantum channels
• Analytical approach to parallel repetition
• Secure Bit Commitment From Relativistic Constraints
• Position-Based Quantum Cryptography: Impossibility and Constructions
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments

This page was built for publication: Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries