Abstract
Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.
Similar content being viewed by others
Data availability
The datasets generated and/or analyzed during the current study are not publicly available due to confidentiality agreements with participating financial institutions and privacy restrictions on customer-related data, but are available from the corresponding author on reasonable request. No publicly available sequence data were used in this study; therefore accession numbers are not applicable.
Code availability
The code that supports the findings of this study is available from the corresponding author upon reasonable request.
Materials availability
The materials that support the findings of this study are available from the corresponding author upon reasonable request.
References
Yao, A. C.-C. Protocols for secure computations (extended abstract). In Proc. 23rd Annual Symposium on Foundations of Computer Science, 160–164 (IEEE Computer Society Press, 1982).
Yao, A. C.-C. How to generate and exchange secrets (extended abstract). In Proc. 27th Annual Symposium on Foundations of Computer Science, 162–167 (IEEE Computer Society Press, 1986).
Goldreich, O., Micali, S. & Wigderson, A. How to play any mental game or A completeness theorem for protocols with honest majority. In Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, 218–229 (ACM Press, 1987).
Mohassel, P. & Zhang, Y. SecureML: a system for scalable privacy-preserving machine learning. In Proc. IEEE Symposium on Security and Privacy, 19–38 (IEEE Computer Society Press, 2017).
Cho, H., Wu, D. J. & Berger, B. Secure genome-wide association analysis using multiparty computation. Nat. Biotechnol. 36, 547–551 (2018).
Kilian, J. Founding cryptography on oblivious transfer. In Proc. 20th Annual ACM Symposium on Theory of Computing, 20–31 (ACM Press, 1988).
Even, S., Goldreich, O. & Lempel, A. A randomized protocol for signing contracts. In Chaum, D., Rivest, R. L. & Sherman, A. T. (eds.) Advances in Cryptology – CRYPTO’82, 205–210 (Plenum Press, 1982).
Naor, M. & Pinkas, B. Efficient oblivious transfer protocols. In Kosaraju, S. R. (ed.) 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 448–457 (ACM-SIAM, 2001).
Santos, M. B., Mateus, P. & Pinto, A. N. Quantum oblivious transfer: a short review. Entropy 24, 945 (2022).
Mayers, D. Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78, 3414–3417 (1997).
Lo, H.-K. Insecurity of quantum secure computations. Phys. Rev. A 56, 1154–1162 (1997).
Bennett, C. H., Brassard, G., Crépeau, C. & Skubiszewska, M.-H. Practical quantum oblivious transfer. 351–366 (Springer, 2001).
Wehner, S., Schaffner, C. & Terhal, B. M. Cryptography from noisy storage. Phys. Rev. Lett. 100, 220502 (2008).
Wehner, S., Curty, M., Schaffner, C. & Lo, H.-K. Implementation of two-party protocols in the noisy-storage model. Phys. Rev. A 81, 052336 (2010).
Schaffner, C. Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model. Phys. Rev. A 82, 032308 (2010).
Erven, C. et al. An experimental implementation of oblivious transfer in the noisy storage model. Nat. Commun. 5, 3418 (2014).
Zhu, T.-X. et al. On-demand integrated quantum memory for polarization qubits. Phys. Rev. Lett. 128, 180501 (2022).
Naor, M. Bit commitment using pseudorandomness. J. Cryptol. 4, 151–158 (1991).
Furrer, F. et al. Continuous-variable protocol for oblivious transfer in the noisy-storage model. Nat. Commun. 9, 1450 (2018).
Amiri, R. et al. Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation. PRX Quantum 2, 010335 (2021).
Stroh, L. et al. Noninteractive xor quantum oblivious transfer: optimal protocols and their experimental implementations. PRX Quantum 4, 020320 (2023).
Bartusek, J., Coladangelo, A., Khurana, D. & Ma, F. One-way functions imply secure computation in a quantum world. In Malkin, T. & Peikert, C. (eds.) Advances in Cryptology – CRYPTO 2021, Part I, vol. 12825 of Lecture Notes in Computer Science, 467–496 (Springer, 2021).
Damgård, I., Fehr, S., Lunemann, C., Salvail, L. & Schaffner, C. Improving the security of quantum protocols via commit-and-open. In Halevi, S. (ed.) Advances in Cryptology – CRYPTO 2009, vol. 5677 of Lecture Notes in Computer Science, 408–427 (Springer, 009).
Grilo, A. B., Lin, H., Song, F. & Vaikuntanathan, V. Oblivious transfer is in MiniQCrypt. In Canteaut, A. & Standaert, F.-X. (eds.) Advances in Cryptology – EUROCRYPT 2021, Part II, vol. 12697 of Lecture Notes in Computer Science, 531–561 (Springer, 021).
Huang, Y., Evans, D. & Katz, J. Private set intersection: are garbled circuits better than custom protocols? In: Proc. ISOC Network and Distributed System Security Symposium – NDSS 2012 (The Internet Society, 2012).
Dong, C., Chen, L. & Wen, Z. When private set intersection meets big data: an efficient and scalable protocol. In Sadeghi, A.-R., Gligor, V. D. & Yung, M. (eds.) ACM CCS 2013: 20th Conference on Computer and Communications Security, 789–800 (ACM Press, 2013).
Lupo, C., Peat, J. T., Andersson, E. & Kok, P. Error-tolerant oblivious transfer in the noisy-storage model. Phys. Rev. Res. 5, 033163 (2023).
Brassard, G., Lütkenhaus, N., Mor, T. & Sanders, B. C. Limitations on practical quantum cryptography. Phys. Rev. Lett. 85, 1330–1333 (2000).
Hwang, W.-Y. Quantum key distribution with high loss: toward global secure communication. Phys. Rev. Lett. 91, 057901 (2003).
Wang, X.-B. Beating the photon-number-splitting attack in practical quantum cryptography. Phys. Rev. Lett. 94, 230503 (2005).
Lo, H.-K., Ma, X. & Chen, K. Decoy state quantum key distribution. Phys. Rev. Lett. 94, 230504 (2005).
Kolesnikov, V., Kumaresan, R., Rosulek, M. & Trieu, N. Efficient batched oblivious PRF with applications to private set intersection. In Weippl, E. R., Katzenbeisser, S., Kruegel, C., Myers, A. C. & Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, 818–829 (ACM Press, 2016).
Haenni, R., Koenig, R. E. & Dubuis, E. Cast-as-intended verification in electronic elections based on oblivious transfer. In Electronic Voting: First International Joint Conference, E-Vote-ID 2016, Bregenz, Austria, October 18-21, 2016, Proceedings 1, 73–91 (Springer, 2017).
Shor, P. W. Algorithms for quantum computation: Discrete logarithms and factoring. In 35th Annual Symposium on Foundations of Computer Science, 124–134 (IEEE Computer Society Press, 1994).
Bernstein, D. J. & Lange, T. Post-quantum cryptography. Nature 549, 188–194 (2017).
Bose, R. C. & Ray-Chaudhuri, D. K. On a class of error correcting binary group codes. Inf. control 3, 68–79 (1960).
Ishai, Y., Kilian, J., Nissim, K. & Petrank, E. Extending oblivious transfers efficiently. In Boneh, D. (ed.) Advances in Cryptology – CRYPTO 2003, vol. 2729 of Lecture Notes in Computer Science, 145–161 (Springer, 2003).
Kolesnikov, V. & Kumaresan, R. Improved OT extension for transferring short secrets. In Canetti, R. & Garay, J. A. (eds.) Advances in Cryptology – CRYPTO 2013, Part II, vol. 8043 of Lecture Notes in Computer Science, 54–70 (Springer, 2013).
Keller, M., Orsini, E. & Scholl, P. Actively secure OT extension with optimal overhead. In Gennaro, R. & Robshaw, M. J. B. (eds.) Advances in Cryptology – CRYPTO 2015, Part I, vol. 9215 of Lecture Notes in Computer Science, 724–741 (Springer, 2015).
Beaver, D. Efficient multiparty protocols using circuit randomization. In Feigenbaum, J. (ed.) Advances in Cryptology – CRYPTO’91, vol. 576 of Lecture Notes in Computer Science, 420–432 (Springer, 1992).
Masny, D. & Rindal, P. Endemic oblivious transfer. In Cavallaro, L., Kinder, J., Wang, X. & Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, 309–326 (ACM Press, 2019).
Acknowledgements
The authors acknowledge Chengfang Jinke and Minfeng Bank for providing us with the data and the application scenario that facilitate the research. Yu Yu is supported by the National Natural Science Foundation of China (Grant Nos. 62125204 and 92270201) and Innovation Program for Quantum Science and Technology (No. 2021ZD0302901/2021ZD0302902). Ya-Dong Wu acknowledges funding from the National Natural Science Foundation of China through grants No. 12405022.
Author information
Authors and Affiliations
Contributions
Kai-Yi Zhang, Ya-Dong Wu and Yu Yu designed research; An-Jing Huang, Kun Tu, Ming-Han Li, Chi Zhang and Wei Qi performed the experiment. All authors discussed the results and reviewed the manuscript.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Pending patents
The authors declare that there are no pending patents related to this work.
Journal association
The authors declare that none of the authors is an Editor-in-Chief, Associate Editor, or Guest Editor of npj Quantum Information or any associated collection relevant to this manuscript.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
About this article
Cite this article
Zhang, KY., Huang, AJ., Tu, K. et al. Experimental secure multiparty computation from quantum oblivious transfer with bit commitment. npj Quantum Inf (2026). https://doi.org/10.1038/s41534-026-01219-w
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41534-026-01219-w
