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 Menu

Export Article

Open AccessArticle
Cryptography 2017, 1(2), 11; doi:10.3390/cryptography1020011

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
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)
View Full-Text   |   Download PDF [277 KB, uploaded 8 July 2017]

Abstract

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
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Sikora, J. Simple, Near-Optimal Quantum Protocols for Die-Rolling. Cryptography 2017, 1, 11.

Show more citation formats Show less citations formats

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

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top