Relativistic (or -prover -round) zero-knowledge protocol for secure against quantum adversaries
arXiv:1612.07627 · doi:10.1007/978-3-319-56617-7_13
Abstract
In this paper, we show that the zero-knowledge construction for Hamiltonian cycle remains secure against quantum adversaries in the relativistic setting. Our main technical contribution is a tool for studying the action of consecutive measurements on a quantum state which in turn gives upper bounds on the value of some entangled games. This allows us to prove the security of our protocol against quantum adversaries. We also prove security bounds for the (single-round) relativistic string commitment and bit commitment in parallel against quantum adversaries. As an additional consequence of our result, we answer an open question from [Unr12] and show tight bounds on the quantum knowledge error of some -protocols.
arXiv commentv2, corrected a few typos and added references
References in corpus (16)
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Coding Theorem and Strong Converse for Quantum Channels
- Unconditionally Secure Bit Commitment
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
- Experimental bit commitment based on quantum communication and special relativity
- Unconditionally Secure Bit Commitment with Flying Qudits
- Position-Based Quantum Cryptography: Impossibility and Constructions
- Multivariate Trace Inequalities
- Insecurity of position-based quantum cryptography protocols against entanglement attacks
- Practical relativistic bit commitment
- Secure bit commitment from relativistic constraints
- 24-Hour Relativistic Bit Commitment
- Arbitrarily long relativistic bit commitment