2026-08-17T02:40:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6685 2024-03-12T11:58:52Z ddc:004 open_access

Simple, Near-Optimal Quantum Protocols for Die-Rolling Sikora, Jamie Quantum Cryptography Semidefinite Programming Die-Rolling Integer-Commitment 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 which are currently very complicated and not very well understood. In this paper, we first present very simple classical protocols for die-rolling which 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 which are very close to Kitaev's lower bound for any D >= 3. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jamie Sikora 2016 Is Part Of LIPIcs, Volume 61, 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TQC.2016.4 urn:nbn:de:0030-drops-66851 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.4 eng https://creativecommons.org/licenses/by/3.0/legalcode