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

Pacific Rim International Symposium on Dependable Computing

Quantum Oblivious Transfer and Fair Digital Transactions

Yao–Hsin Chou, I-Ming Tsai, Chien‐Ming Ko, Sy‐Yen Kuo, Ing-Yi Chen

Published Jan 1, 2006• 6 citations
Publisher

Abstract

Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-business

DOI
10.1109/prdc.2006.51

Related papers

Quantum Entanglement and Its Applications on Secure Computation

Yao–Hsin Chou, I.-M. Tsai, Sy‐Yen Kuo

In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation based on quantum entanglement, which is a phenomenon available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

IEEE Conference on Nanotechnology (IEEE NANO)•Oct 30, 2006•0 citations

Quantum Entanglement and Its Applications on Secure Computation

Yao–Hsin Chou, I.-M. Tsai, Sy‐Yen Kuo

In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation based on quantum entanglement, which is a phenomenon available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

IEEE Conference on Nanotechnology (IEEE NANO)•Jan 1, 2006•2 citations

Oblivious transfer for secure communication

Abhishek Parakh

Over the past four decades, computational power and algorithmic strategies have advanced tremendously resulting in an enormous increase in the key sizes required for secure cryptosystems such as RSA. At the same time, the electronic devices have grown smaller and portable requiring algorithms running on them to be optimized in size and efficiency while providing security, at least, equivalent to that provided on a typical desktop computer. As a result, the industry is moving towards newer cryptosystems such as ECC and NTRU that are well suited for resource constrained environments. While, ECC claims to provide security equivalent to that of RSA for a fraction of key size, NTRU is inherently suited for embedded systems technology. However, implementation of new cryptosystems requires the development of protocols analogous to those developed using older cryptosystems. In this thesis, we fulfill a part of this requirement by providing protocols for Oblivious Transfer using ECC and NTRU. Oblivious Transfer, in turn, has applications in simultaneous contract signing, digital certified mail, simultaneous exchange of secrets, secure multiparty computations, private information retrieval, etc. Furthermore, we introduce the idea of basing Oblivious Transfer on public-key exchange protocols. The presentation in the thesis uses Diffie-Hellman Key Exchange, but the scheme is generalizable to any cryptosystem that has a public-key exchange strategy. In fact, our proposal may especially be suited for Quantum Cryptography where the security of key exchange protocols has been proven.

Civil War Book Review•Sep 28, 2007•0 citations

Unconditionally secure quantum oblivious transfer

Guang-Ping He, Z. D. Wang

Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus its security is not restricted by the no-go theorem of twoparty secure computations. Typeset using REVTEX 1 The research on the oblivious transfer (OT) problem may be traced back to more than twenty years ago [1,2]. Kilian [3] pointed out later that OT is very important in two-party and multi-party protocols. This is because in most symmetrical protocols, the participants always know each others ’ data. If some participants are dishonest or try to get extra information, the protocols become insecure. OT can create some secret between the participants and break this symmetry. Thus it can be used to implement multi-party protocols such as

•Dec 19, 2003•0 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

Asymptotically Secure Quantum Oblivious Transfer

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

Due to the commonly known impossibility results, unconditional security for oblivious transfer is seen as impossible even in the quantum world. In this paper, we try to overcome these impossibility results by proposing a protocol which is asymptotically secure. The protocol makes use of the basic properties of non-orthogonal quantum states. Apart from security, the advantages of our protocol include the fact that the honest players do not need to have quantum memory or create entanglement between individual qubits. The relation of our work to the known impossibility results is also discussed.

arXiv:1004.1871•Apr 12, 2010•1 citation
Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-business
Over the past four decades, computational power and algorithmic strategies have advanced tremendously resulting in an enormous increase in the key sizes required for secure cryptosystems such as RSA. At the same time, the electronic devices have grown smaller and portable requiring algorithms running on them to be optimized in size and efficiency while providing security, at least, equivalent to that provided on a typical desktop computer. As a result, the industry is moving towards newer cryptosystems such as ECC and NTRU that are well suited for resource constrained environments. While, ECC claims to provide security equivalent to that of RSA for a fraction of key size, NTRU is inherently suited for embedded systems technology. However, implementation of new cryptosystems requires the development of protocols analogous to those developed using older cryptosystems. In this thesis, we fulfill a part of this requirement by providing protocols for Oblivious Transfer using ECC and NTRU. Oblivious Transfer, in turn, has applications in simultaneous contract signing, digital certified mail, simultaneous exchange of secrets, secure multiparty computations, private information retrieval, etc. Furthermore, we introduce the idea of basing Oblivious Transfer on public-key exchange protocols. The presentation in the thesis uses Diffie-Hellman Key Exchange, but the scheme is generalizable to any cryptosystem that has a public-key exchange strategy. In fact, our proposal may especially be suited for Quantum Cryptography where the security of key exchange protocols has been proven.
Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus its security is not restricted by the no-go theorem of twoparty secure computations. Typeset using REVTEX 1 The research on the oblivious transfer (OT) problem may be traced back to more than twenty years ago [1,2]. Kilian [3] pointed out later that OT is very important in two-party and multi-party protocols. This is because in most symmetrical protocols, the participants always know each others ’ data. If some participants are dishonest or try to get extra information, the protocols become insecure. OT can create some secret between the participants and break this symmetry. Thus it can be used to implement multi-party protocols such as
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).
Due to the commonly known impossibility results, unconditional security for oblivious transfer is seen as impossible even in the quantum world. In this paper, we try to overcome these impossibility results by proposing a protocol which is asymptotically secure. The protocol makes use of the basic properties of non-orthogonal quantum states. Apart from security, the advantages of our protocol include the fact that the honest players do not need to have quantum memory or create entanglement between individual qubits. The relation of our work to the known impossibility results is also discussed.