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

Lecture notes in computer science

A Verifiable Distributed Oblivious Transfer Protocol

Christian L. F. Corniaux, Hossein Ghodosi

Published Jan 1, 2011• 3 citations
Publisher
DOI
10.1007/978-3-642-22497-3_33

Related papers

Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment

Soongohn Kim, Seoksoo Kim, Geuk Lee

Future Generation Computer Systems•Aug 15, 2006•8 citations

Verifiable Oblivious Transfer Protocol(Application Information Security)

Narn Yih Lee, Chien-Chih Wang

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

A Provably Secure Oblivious Transfer Protocol

Richard J. Berger, René Peralta, Tom Tedrick

Springer eBooks•Feb 28, 2007•28 citations

Distributed Oblivious Transfer with Adaptive Queries

Shuxian Jiang, Hongda Li, Bao Li

We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.

•Apr 1, 2010•1 citation

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation

Aviad Ben Arie, Tamir Tassa

Lecture notes in computer science•Jan 1, 2024•1 citation

Secure multi-party biometric verification using QKD assisted quantum oblivious transfer

Mariana F. Ramos, Michael Hentschel, Federico Valbusa +7 more

We present an experimentally feasible implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) on an entanglement-based physical layer. The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. Our system integrates the post-processing for QOT and QKD, both sharing a single physical layer, ensuring efficient key generation and authentication, respectively. Authentication involves hashing messages into a cryptographic context, verifying tags, and replenishing keys. This process uses a parallel QKD pipeline specifically for authentication, not for secure key generation. Oblivious keys are generated over a distance up to 25.8 km with a channel loss of 8.47 dB. In a back-to-back setup, a QOT rate of [Formula: see text] OTs/second is achieved, corresponding to 1 minute and 53 seconds per OT, primarily limited by the entanglement source. Using pre-distributed oblivious keys improved the rate to 0.11 OTs/second, or 9.1 seconds per OT. The considered QOT protocol is statistically correct, computationally secure for an honest receiver, and statistically secure for an honest sender, assuming a computationally hiding, statistically binding commitment. An experimentally feasible use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists for border control. The fingerprint is secret-shared across two sites, ensuring security, while the matching is performed using the MASCOT protocol, supported by QOT. The application required 128 1-out-of-2 OTs, each with message length of 128 bits, with the highest security achieved in 20 minutes and 39 seconds. This work demonstrates the feasibility of QOT in secure quantum communication applications.

arXiv:2501.05327•Scientific Reports•Jun 28, 2026•3 citations
We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.
We present an experimentally feasible implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) on an entanglement-based physical layer. The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. Our system integrates the post-processing for QOT and QKD, both sharing a single physical layer, ensuring efficient key generation and authentication, respectively. Authentication involves hashing messages into a cryptographic context, verifying tags, and replenishing keys. This process uses a parallel QKD pipeline specifically for authentication, not for secure key generation. Oblivious keys are generated over a distance up to 25.8 km with a channel loss of 8.47 dB. In a back-to-back setup, a QOT rate of [Formula: see text] OTs/second is achieved, corresponding to 1 minute and 53 seconds per OT, primarily limited by the entanglement source. Using pre-distributed oblivious keys improved the rate to 0.11 OTs/second, or 9.1 seconds per OT. The considered QOT protocol is statistically correct, computationally secure for an honest receiver, and statistically secure for an honest sender, assuming a computationally hiding, statistically binding commitment. An experimentally feasible use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists for border control. The fingerprint is secret-shared across two sites, ensuring security, while the matching is performed using the MASCOT protocol, supported by QOT. The application required 128 1-out-of-2 OTs, each with message length of 128 bits, with the highest security achieved in 20 minutes and 39 seconds. This work demonstrates the feasibility of QOT in secure quantum communication applications.