Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0010111

Quantum cryptographic three party protocols

Joern Mueller-Quade, Imai, H.

Published Oct 31, 2000• 4 citations
arXivHTMLPDF

Abstract

Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can be strictly stronger than oblivious transfer. With the protocol introduced in this paper we can completely classify the cryptographic strength of quantum multi party protocols.

DOI
10.48550/arxiv.quant-ph/0010111

Related papers

Anonymous Oblivious Transfer

Mueller-Quade, J., Hideki Imai

In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi party protocols with {\em anonymous oblivious transfer}. No assumption about possible collusions of cheaters or disruptors have to be made. Furthermore we shortly discuss how to realize anonymous oblivious transfer with oblivious broadcast or by quantum cryptography. The protocol of anonymous oblivious transfer was inspired by a quantum protocol: the anonymous quantum channel.

arXiv:cs/0011004•Nov 4, 2000•6 citations

Unconditionally Secure Quantum Oblivious Transfer

Guoliang Chen

As a basic protocol of Secure Multi-party Computation,Oblivious Transfer(OT) is of significant research and application value.Most of previous oblivious transfer protocols in classical environment rely either on public-key cryptography or on additional computational assumptions which will be very vulnerable under quantum mechanics.Based on the characteristics of Bell States,a new quantum oblivious transfer protocol is proposed in this paper.The correctness and security of the protocol are analyzed and proved.The protocol is secure in the presence of noise on the channel and a potential eavesdropper.Comparing with oblivious transfer protocols in classical computational environment,the protocol in this paper is superior in security,soundness and wire-tapping detecting.

Dianzi xuebao•Jan 1, 2007•0 citations

All-or-nothing oblivious transfer based on the quantum one-way function

Ping Wang, Yiting Su, Zhiwei Sun

Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible. In this article, we propose a practical and secure quantum all-or-nothing oblivious transfer protocol based on the quantum one-way function. The protocol is built upon a quantum public-key encryption construction, and its security relies on the no-cloning theorem and no-communication theorem. Practical security is reflected in limitations on non-demolition measurements.

Frontiers in Physics•Aug 9, 2022•4 citations

Quantum cryptography -- an information theoretic security

Nadeem, Muhammad

Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.

arXiv:1507.07918•Jul 28, 2015•4 citations

Full-Stack Entanglement-Based Quantum Oblivious Transfer for Secure Multi Party Computation Applications

Alessandro Trenti, Mariana F. Ramos, Michael Hentschel +7 more

Nowadays the need of securely transmitting information has become crucial due to the increasing threat of cyberattacks. Quantum Key Distribution (QKD) guarantees information-theoretic security in the transmission of secure keys between two trusted parties, leveraging the laws of quantum mechanics. In more general mistrustful communication scenarios, alternative protocols, often referred to as beyond-QKD protocols, are employed [1]. A notable example is oblivious transfer, a cryptographic primitive that supports secure multiparty computation (SMC).

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•1 citation

A Weak Quantum Oblivious Transfer

Kai-Yuen Cheong, Min-Hsiu Hsieh, Takeshi Koshiba

Due to the commonly known impossibility results, information theoretic security is considered impossible for oblivious transfer (OT) in both the classical and the quantum world. In this paper, we proposed a weak version of the all-or-nothing OT. In our protocol the honest parties do not need long term quantum memory, entanglements, or sophisticated quantum computations. We observe some difference between the classical and quantum OT impossibilities.

arXiv:1010.0702•Oct 4, 2010•2 citations
Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can be strictly stronger than oblivious transfer. With the protocol introduced in this paper we can completely classify the cryptographic strength of quantum multi party protocols.
In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi party protocols with {\em anonymous oblivious transfer}. No assumption about possible collusions of cheaters or disruptors have to be made. Furthermore we shortly discuss how to realize anonymous oblivious transfer with oblivious broadcast or by quantum cryptography. The protocol of anonymous oblivious transfer was inspired by a quantum protocol: the anonymous quantum channel.
As a basic protocol of Secure Multi-party Computation,Oblivious Transfer(OT) is of significant research and application value.Most of previous oblivious transfer protocols in classical environment rely either on public-key cryptography or on additional computational assumptions which will be very vulnerable under quantum mechanics.Based on the characteristics of Bell States,a new quantum oblivious transfer protocol is proposed in this paper.The correctness and security of the protocol are analyzed and proved.The protocol is secure in the presence of noise on the channel and a potential eavesdropper.Comparing with oblivious transfer protocols in classical computational environment,the protocol in this paper is superior in security,soundness and wire-tapping detecting.
Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible. In this article, we propose a practical and secure quantum all-or-nothing oblivious transfer protocol based on the quantum one-way function. The protocol is built upon a quantum public-key encryption construction, and its security relies on the no-cloning theorem and no-communication theorem. Practical security is reflected in limitations on non-demolition measurements.
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.
Nowadays the need of securely transmitting information has become crucial due to the increasing threat of cyberattacks. Quantum Key Distribution (QKD) guarantees information-theoretic security in the transmission of secure keys between two trusted parties, leveraging the laws of quantum mechanics. In more general mistrustful communication scenarios, alternative protocols, often referred to as beyond-QKD protocols, are employed [1]. A notable example is oblivious transfer, a cryptographic primitive that supports secure multiparty computation (SMC).