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:cs/0101020

More Robust Multiparty Protocols with Oblivious Transfer

Mueller-Quade, J., Hideki Imai

Published Jan 22, 2001• 1 citation
arXivHTMLPDF

Abstract

With oblivious transfer multiparty protocols become possible even in the presence of a faulty majority. But all known protocols can be aborted by just one disruptor. This paper presents more robust solutions for multiparty protocols with oblivious transfer. This additional robustness against disruptors weakens the security of the protocol and the guarantee that the result is correct. We can observe a trade off between robustness against disruption and security and correctness. We give an application to quantum multiparty protocols. These allow the implementation of oblivious transfer and the protocols of this paper relative to temporary assumptions, i.e., the security increases after the termination of the protocol.

DOI
10.48550/arxiv.cs/0101020

Related papers

Temporary Assumptions for Quantum Multi Party Protocols

Joern Mueller-Quade, Hideki Imai

This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict assumptions are necessary only during the execution of the protocol and can be loosened after termination of the protocol. We consider two settings: 1. A collusion of players tries to learn the secret inputs of honest players or tries to modify the result of the computation. 2. A collusion of players cheats in the above way or tries to disrupt the protocol, i.e., the collusion tries to abort the computation or leaks information to honest players. We give bounds on the collusions tolerable after a protocol has terminated and we state protocols reaching these bounds.

arXiv:quant-ph/0010112•Oct 31, 2000•2 citations

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•5 citations

Quantum and classical oblivious transfer: A comparative analysis

Manuel B. Santos, Armando N. Pinto, Paulo Mateus

Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.

IET Quantum Communication•May 21, 2021•11 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

Two‐Server Oblivious Transfer for Quantum Messages

Masahito Hayashi, Seunghoan Song

Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.

arXiv:2211.03308•Advanced Quantum Technologies•Feb 8, 2024•2 citations

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Bruno Costa, Pedro Costa Branco, Manuel Goulão +2 more

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

Entropy•Jul 31, 2021•12 citations
With oblivious transfer multiparty protocols become possible even in the presence of a faulty majority. But all known protocols can be aborted by just one disruptor. This paper presents more robust solutions for multiparty protocols with oblivious transfer. This additional robustness against disruptors weakens the security of the protocol and the guarantee that the result is correct. We can observe a trade off between robustness against disruption and security and correctness. We give an application to quantum multiparty protocols. These allow the implementation of oblivious transfer and the protocols of this paper relative to temporary assumptions, i.e., the security increases after the termination of the protocol.
This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict assumptions are necessary only during the execution of the protocol and can be loosened after termination of the protocol. We consider two settings: 1. A collusion of players tries to learn the secret inputs of honest players or tries to modify the result of the computation. 2. A collusion of players cheats in the above way or tries to disrupt the protocol, i.e., the collusion tries to abort the computation or leaks information to honest players. We give bounds on the collusions tolerable after a protocol has terminated and we state protocols reaching these bounds.
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.
Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.
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).
Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.
Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.