Next Article in Journal / Special Issue
Multiparty Delegated Quantum Computing
Previous Article in Journal
Password-Hashing Status
Previous Article in Special Issue
Garbled Quantum Computation
Article

Simple, Near-Optimal Quantum Protocols for Die-Rolling

Centre for Quantum Technologies, National University of Singapore, and MajuLab, CNRS-UNS-NUS-NTU International Joint Research Unit, UMI 3654, Singapore
Cryptography 2017, 1(2), 11; https://doi.org/10.3390/cryptography1020011
Received: 1 June 2017 / Revised: 25 June 2017 / Accepted: 30 June 2017 / Published: 8 July 2017
(This article belongs to the Special Issue Quantum-Safe Cryptography)
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random D-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics, 2010) but are based on optimal weak coin-flipping protocols that are currently very complicated and not very well understood. In this paper, we first present very simple classical protocols for die-rolling that have decent (and sometimes optimal) security, which is in stark contrast to coin-flipping, bit-commitment, oblivious transfer, and many other two-party cryptographic primitives. We also present quantum protocols based on the idea of integer-commitment, a generalization of bit-commitment, where one wishes to commit to an integer. We analyze these protocols using semidefinite programming and finally give protocols that are very close to Kitaev’s lower bound for any D 3 . Lastly, we briefly discuss an application of this work to the quantum state discrimination problem. View Full-Text
Keywords: quantum cryptography; security analysis; semidefinite programming quantum cryptography; security analysis; semidefinite programming
MDPI and ACS Style

Sikora, J. Simple, Near-Optimal Quantum Protocols for Die-Rolling. Cryptography 2017, 1, 11. https://doi.org/10.3390/cryptography1020011

AMA Style

Sikora J. Simple, Near-Optimal Quantum Protocols for Die-Rolling. Cryptography. 2017; 1(2):11. https://doi.org/10.3390/cryptography1020011

Chicago/Turabian Style

Sikora, Jamie. 2017. "Simple, Near-Optimal Quantum Protocols for Die-Rolling" Cryptography 1, no. 2: 11. https://doi.org/10.3390/cryptography1020011

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop