Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
arXiv:2304.13200 · doi:10.22331/q-2025-01-20-1602
Abstract
In the last two decades, there has been much effort in finding secure protocols for two-party cryptographic tasks. It has since been discovered that even with quantum mechanics, many such protocols are limited in their security promises. In this work, we use stochastic selection, an idea from stochastic programming, to circumvent such limitations. For example, we find a way to switch between bit commitment, weak coin flipping, and oblivious transfer protocols to improve their security. We also use stochastic selection to turn trash into treasure yielding the first quantum protocol for Rabin oblivious transfer.
42 pages, 2 figures
References in corpus (22)
- A generalized no-broadcasting theorem
- Degrees of concealment and bindingness in quantum bit commitment protocols
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Cryptography from Noisy Storage
- Toward a general theory of quantum games
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- On bit-commitment based quantum coin flipping
- Fully Distrustful Quantum Cryptography
- Multiparty Quantum Coin Flipping
- A large family of quantum weak coin-flipping protocols
- A short impossibility proof of Quantum Bit Commitment
- Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation
- Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
- A device-independent protocol for XOR oblivious transfer
- Device-Independent Bit Commitment based on the CHSH Inequality
- An Entanglement-Based Protocol For Strong Coin Tossing With Bias 1/4
- Simple proof of the impossibility of bit-commitment in generalised probabilistic theories using cone programming
- A search for quantum coin-flipping protocols using optimization techniques
- Strong connections between quantum encodings, non-locality and quantum cryptography
- The Impossibility of Efficient Quantum Weak Coin-Flipping
- On the impossibility of coin-flipping in generalized probabilistic theories via discretizations of semi-infinite programs
- Quantum Weak Coin Flipping