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/0506033

Variations on Quantum Oblivious Transfer

Minh-Dung Dang

Published Jun 3, 2005• 1 citation
arXivHTMLPDF

Abstract

This paper has been withdrawn by the author, due to the insecurity against attacks received in quant-ph/0605027v5.
DOI
10.48550/arxiv.quant-ph/0506033

Related papers

Statistically Secure Quantum Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

This paper has been withdrawn.

arXiv:quant-ph/0408108•Aug 17, 2004•0 citations

Unconditionally Secure Quantum m-out-of-n Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

This paper has been withdrawn.

arXiv:quant-ph/0401057•Jan 11, 2004•0 citations

Verifiable quantum oblivious transfer protocol based on entangled states

M. Ardehali

This paper has been withdrawn.

arXiv:quant-ph/9806040•Jun 12, 1998•0 citations

Coin-Flipping-based Quantum Oblivious Transfer

Minh-Dung Dang

When submitting ``Coin-Flipping-based Quantum Oblivious Transfer'' (quant-ph/0605027v4) to Indocrypt-2006, I received valuable reviews. Due to the attacks in these reviews, my major protocols, for cheat-sensitive and coin-flipping-based 2-1 oblivious transfers, are insecure. I would have withdrawn the paper. But I think I'd rather post the attacks made by the reviewer. Besides, as ``coin-flipping-based 2-1 OT'' is an important case-study in ``Two-party Models and the No-go Theorems'' (quant-ph/0608165), the paper is also touched by the attack. It will be reconsidered, and the case-study will be eliminated from it. I would like to thank the ``anonymous'' reviewer for those valuable attacks and comments.

arXiv:quant-ph/0605027•May 2, 2006•0 citations

Efficient Oblivious Transfer Protocol Based on Bilinear Pairing

Zhenhua Chen

Oblivious Transfer(OT) protocol is an important primitive for designing cryptographic protocols.Designing OT protocol from bilinear pairing not only extends the bilinear pairing application but also increases the design technique of OT,which has important practical significance.This paper utilizes bilinear pairing to design a k-out-of-n OT protocol.The new protocol can protect both receiver’s privacy and sender’s privacy.The new protocol also can resist impersonation attacks,replay attacks and man-in-the-middle attacks.It can be used in an insecure channel,and the protocol has high efficiency.

Jisuanji gongcheng•Jan 1, 2013•1 citation

Reply to “Comment on ‘Bit-string oblivious transfer based on quantum state computational distinguishability’ ”

André Souto, Paulo Mateus, Pedro Adão +1 more

In the Comment the author states that the proposed all-or-nothing oblivious transfer (OT) protocol in our paper is insecure against a dishonest Alice and, as a corollary, derives an attack to Cr\'epeau's construction of 1-out-of-2 OT. The security criterion used in the Comment is indeed stronger than the one used in our paper. However, we argue that the criterion used in our paper is in the spirit of the original idea of the OT protocol proposed by Rabin. Moreover, a protocol that satisfies the criterion in our paper can be used to construct useful multiparty protocols. Finally, the protocol in our paper can be used, together with a secure bit commitment scheme, to construct a 1-out-of-2 OT secure against malicious Alice, achieving the security requirement considered in the Comment.

Physical Review A•Oct 30, 2015•7 citations
When submitting ``Coin-Flipping-based Quantum Oblivious Transfer'' (quant-ph/0605027v4) to Indocrypt-2006, I received valuable reviews. Due to the attacks in these reviews, my major protocols, for cheat-sensitive and coin-flipping-based 2-1 oblivious transfers, are insecure. I would have withdrawn the paper. But I think I'd rather post the attacks made by the reviewer. Besides, as ``coin-flipping-based 2-1 OT'' is an important case-study in ``Two-party Models and the No-go Theorems'' (quant-ph/0608165), the paper is also touched by the attack. It will be reconsidered, and the case-study will be eliminated from it. I would like to thank the ``anonymous'' reviewer for those valuable attacks and comments.
Oblivious Transfer(OT) protocol is an important primitive for designing cryptographic protocols.Designing OT protocol from bilinear pairing not only extends the bilinear pairing application but also increases the design technique of OT,which has important practical significance.This paper utilizes bilinear pairing to design a k-out-of-n OT protocol.The new protocol can protect both receiver’s privacy and sender’s privacy.The new protocol also can resist impersonation attacks,replay attacks and man-in-the-middle attacks.It can be used in an insecure channel,and the protocol has high efficiency.
In the Comment the author states that the proposed all-or-nothing oblivious transfer (OT) protocol in our paper is insecure against a dishonest Alice and, as a corollary, derives an attack to Cr\'epeau's construction of 1-out-of-2 OT. The security criterion used in the Comment is indeed stronger than the one used in our paper. However, we argue that the criterion used in our paper is in the spirit of the original idea of the OT protocol proposed by Rabin. Moreover, a protocol that satisfies the criterion in our paper can be used to construct useful multiparty protocols. Finally, the protocol in our paper can be used, together with a secure bit commitment scheme, to construct a 1-out-of-2 OT secure against malicious Alice, achieving the security requirement considered in the Comment.