Document Open Access Logo

Quantum Protocols for Rabin Oblivious Transfer

Authors Erika Andersson, Akshay Bansal, James T. Peat, Jamie Sikora, Jiawei Wu

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2025.7.pdf
  • Filesize: 0.7 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Security and privacy → Cryptography
Keywords
  • quantum cryptography
  • oblivious transfer
  • information-theoretic security

Metrics

Abstract

Rabin oblivious transfer is the cryptographic task where Alice wishes to receive a bit from Bob but it may get lost with probability 1/2. In this work, we provide protocol designs which yield quantum protocols with improved security. Moreover, we provide a constant lower bound on any quantum protocol for Rabin oblivious transfer. To quantify the security of this task with asymmetric cheating definitions, we introduce the notion of cheating advantage which may be of independent interest in the study of other asymmetric cryptographic primitives.

Cite As Get BibTex

Erika Andersson, Akshay Bansal, James T. Peat, Jamie Sikora, and Jiawei Wu. Quantum Protocols for Rabin Oblivious Transfer. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 360, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.FSTTCS.2025.7

Author Details

Erika Andersson
  • SUPA, Institute of Photonics and Quantum Sciences, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh, UK
Akshay Bansal
  • Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA
James T. Peat
  • SUPA, Institute of Photonics and Quantum Sciences, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh, UK
Jamie Sikora
  • Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA
Jiawei Wu
  • Centre for Quantum Technologies, National University of Singapore, Singapore

Funding

  • Andersson, Erika: UK Engineering and Physical Sciences Research Council (EPSRC) under Grants No. EP/T001011/1 and EP/Z533208/1.
  • Wu, Jiawei: National Research Foundation, Singapore and A*STAR under its Quantum Engineering Programme (NRF2021-QEP2-01-P06).

Acknowledgements

JS thanks Dominique Unruh for pointing out the OT to ROT reduction. AB thanks Or Sattath and Atul Mantri for useful discussions and pointing out the references for protocols under noisy communication.

References

  1. Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, and Loïck Magnin. A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias. SIAM Journal on Computing, 45(3):633-679, 2016. URL: https://doi.org/10.1137/14096387X.
  2. Ryan Amiri, Robert Stárek, David Reichmuth, Ittoop V. Puthoor, Michal Mičuda, Ladislav Mišta, Jr., Miloslav Dušek, Petros Wallden, and Erika Andersson. Imperfect 1-Out-of-2 Quantum Oblivious Transfer: Bounds, a Protocol, and its Experimental Implementation. PRX Quantum, 2:010335, 2021. Google Scholar
  3. Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. Analytic quantum weak coin flipping protocols with arbitrarily small bias. In Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 919-938, 2021. URL: https://doi.org/10.1137/1.9781611976465.58.
  4. Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou, and Stephan Weis. Protocols for quantum weak coin flipping. arXiv preprint arXiv:2402.15855, 2024. URL: https://doi.org/10.48550/arXiv.2402.15855.
  5. Akshay Bansal and Jamie Sikora. Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming. Quantum, 9:1602, 2025. URL: https://doi.org/10.22331/Q-2025-01-20-1602.
  6. Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Marie-Hélène Skubiszewska. Practical quantum oblivious transfer. In Advances in Cryptology - CRYPTO '91, pages 351-366, 1992. Google Scholar
  7. Gilles Brassard, Claude Crépeau, and Jean-Marc Robert. All-or-nothing disclosure of secrets. In Proceedings on Advances in Cryptology - CRYPTO '86, pages 234-238, 1987. Google Scholar
  8. André Chailloux, Gus Gutoski, and Jamie Sikora. Optimal bounds for semi-honest quantum oblivious transfer. Chicago Journal of Theoretical Computer Science, 2016(13):1-17, 2016. URL: http://cjtcs.cs.uchicago.edu/articles/2016/13/contents.html.
  9. André Chailloux and Iordanis Kerenidis. Optimal quantum strong coin flipping. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 527-533, 2009. URL: https://doi.org/10.1109/FOCS.2009.71.
  10. André Chailloux and Iordanis Kerenidis. Optimal bounds for quantum bit commitment. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 354-362, 2011. URL: https://doi.org/10.1109/FOCS.2011.42.
  11. André Chailloux, Iordanis Kerenidis, and Jamie Sikora. Lower bounds for quantum oblivious transfer. Quantum Info. Comput., 13(1–2):158-177, 2013. URL: https://doi.org/10.26421/QIC13.1-2-9.
  12. Claude Crépeau. Equivalence between two flavours of oblivious transfers. In Advances in Cryptology - CRYPTO '87, pages 350-354, 1988. Google Scholar
  13. Claude Crépeau. Quantum oblivious transfer. Journal of Modern Optics, 41(12):2445-2454, 1994. Google Scholar
  14. Claude Crépeau. Efficient cryptographic protocols based on noisy channels. In Advances in Cryptology - EUROCRYPT '97, pages 306-317, 1997. URL: https://doi.org/10.1007/3-540-69053-0_21.
  15. Ivan B. Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner. Cryptography in the bounded-quantum-storage model. SIAM Journal on Computing, 37(6):1865-1890, 2008. URL: https://doi.org/10.1137/060651343.
  16. Michael J Fischer, Silvio Micali, and Charles Rackoff. A secure protocol for the oblivious transfer. Journal of Cryptology, 9(3):191-196, 1996. Google Scholar
  17. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play ANY mental game. In Proceedings of the 19th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 218-229, 1987. Google Scholar
  18. Guang Ping He and ZD Wang. Oblivious transfer using quantum entanglement. Physical Review A—Atomic, Molecular, and Optical Physics, 73(1):012331, 2006. Google Scholar
  19. Yanglin Hu, Yingkai Ouyang, and Marco Tomamichel. Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption. Quantum, 7:976, 2023. URL: https://doi.org/10.22331/Q-2023-04-13-976.
  20. Marcel Keller, Emmanuela Orsini, and Peter Scholl. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS '16, pages 830-842, 2016. URL: https://doi.org/10.1145/2976749.2978357.
  21. Joe Kilian. Founding crytpography on oblivious transfer. In Proceedings of the 20th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 20-31, 1988. URL: https://doi.org/10.1145/62212.62215.
  22. Alexei Kitaev. Quantum coin flipping. Unpublished result. Talk at the 6th Annual workshop on Quantum Information Processing (QIP 2003), 2002. Google Scholar
  23. Hoi-Kwong Lo. Insecurity of quantum secure computations. Phys. Rev. A, 56:1154-1162, 1997. Google Scholar
  24. Carl A Miller. The impossibility of efficient quantum weak coin flipping. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 916-929, 2020. URL: https://doi.org/10.1145/3357713.3384276.
  25. Carlos Mochon. Quantum weak coin flipping with arbitrarily small bias. arXiv preprint arXiv:0711.4114, 2007. Google Scholar
  26. Sarah Anne Osborn. Constant lower bounds on the cryptographic security of quantum two-party computations. Master’s thesis, Virginia Tech, 2022. Google Scholar
  27. Sarah Anne Osborn and Jamie Sikora. A constant lower bound for any quantum protocol for secure function evaluation. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), volume 232 of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:1-8:14, 2022. URL: https://doi.org/10.4230/LIPICS.TQC.2022.8.
  28. James T. Peat and Erika Andersson. Cheating in quantum Rabin oblivious transfer using delayed measurements. arXiv preprint arXiv:2408.12388, 2024. URL: https://arxiv.org/abs/2408.12388.
  29. Michael O. Rabin. Digitalized signatures and public-key function as intractable as factorization. Technical Report, Computer Science, MIT/LCS/TR-212, 1:100-123, 1979. Google Scholar
  30. Michael O. Rabin. How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Paper 2005/187, 2005. URL: https://eprint.iacr.org/2005/187.
  31. Christian Schaffner. Cryptography in the bounded-quantum-storage model. arXiv preprint arXiv:0709.0289, 2007. URL: https://arxiv.org/abs/0709.0289.
  32. Christian Schaffner, Barbara Terhal, and Stephanie Wehner. Robust cryptography in the noisy-quantum-storage model. Quantum Info. Comput., 9(11):963-996, 2009. URL: https://doi.org/10.26421/QIC9.11-12-4.
  33. Lara Stroh, James T. Peat, Mats Kroneberg, Ittoop V. Puthoor, and Erika Andersson. Quantum Rabin oblivious transfer using two pure states. Phys. Rev. Res., 6:043004, 2024. Google Scholar
  34. V Vilasini, Christopher Portmann, and Lídia del Rio. Composable security in relativistic quantum cryptography. New Journal of Physics, 21(4):043057, 2019. Google Scholar
  35. Stephanie Wehner, Christian Schaffner, and Barbara M. Terhal. Cryptography from noisy storage. Phys. Rev. Lett., 100:220502, 2008. Google Scholar
  36. Jiawei Wu, Yanglin Hu, Akshay Bansal, and Marco Tomamichel. On the composable security of weak coin flipping. Quantum, 9:1780, 2025. URL: https://doi.org/10.22331/Q-2025-06-24-1780.
  37. Andrew Chi-Chih Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 162-167, 1986. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact