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

Superposition Attack on OT Protocols.

Ehsan Ebrahimi, Céline Chevalier, Marc A. Kaplan, Michele Minelli

Published Jan 1, 2020• 2 citations
OpenAlex

Related papers

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

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations

Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding

Li Yang

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.

arXiv:1306.5863•Jun 25, 2013•6 citations

Coherent Protocols

Mark M. Wilde

Cambridge University Press eBooks•Apr 18, 2013•0 citations

Verifiable Oblivious Transfer Protocol

N.-Y. LEE

The Oblivious Transfer (OT), introduced by Rabin in 1981, has become an important and fundamental cryptography technique. An OT protocol should have two important characteristics: sender's privacy and chooser's privacy. The sender is a party who will deliver a secret to chooser. The chooser is another party who acts as receiver to learn some information about input from sender. The chooser learns of certain information concerning sender's input while sender is not allowed to know what chooser has learned. Moreover, chooser cannot acquire any messages that he/she did not choose. Naor and Pinkas have recently proposed an efficient oblivious transfer protocol (EOT) that implementes 1-out-of-n protocol, but this EOT has a flaw: it cannot withstand the same message attack. In this paper, we will improve Naor and Pinkas EOT and make it resistant to the same message attack.

IEICE Transactions on Information and Systems•Dec 1, 2005•2 citations

Coherent Protocols

Mark M. Wilde

Cambridge University Press eBooks•Nov 2, 2016•1 citation
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.
Oblivious transfer protocols (R-OT and OT12_{1}^{2}12​) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT12_{1}^{2}12​ are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.
The Oblivious Transfer (OT), introduced by Rabin in 1981, has become an important and fundamental cryptography technique. An OT protocol should have two important characteristics: sender's privacy and chooser's privacy. The sender is a party who will deliver a secret to chooser. The chooser is another party who acts as receiver to learn some information about input from sender. The chooser learns of certain information concerning sender's input while sender is not allowed to know what chooser has learned. Moreover, chooser cannot acquire any messages that he/she did not choose. Naor and Pinkas have recently proposed an efficient oblivious transfer protocol (EOT) that implementes 1-out-of-n protocol, but this EOT has a flaw: it cannot withstand the same message attack. In this paper, we will improve Naor and Pinkas EOT and make it resistant to the same message attack.