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

Implementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering

Paolo Palmieri, Olivier Pereira

Published Jan 1, 2012• 2 citations
Publisher
DOI
10.1007/978-3-642-31912-9_22

Related papers

An Information-Theoretically Secure Threshold Distributed Oblivious Transfer Protocol

Christian L. F. Corniaux, Hossein Ghodosi

Lecture notes in computer science•Jan 1, 2013•5 citations

Computationally Secure Oblivious Transfer

Moni Naor, Benny Pinkas B

Journal of Cryptology•Oct 21, 2004•181 citations

Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

Vinícius de Morais Alves, Rafael Dowsley, Rafael T. de Sousa +1 more

Realizing fundamental cryptographic primitives with unconditional security is a central topic in information-theoretic cryptography. These primitives can be realized based on physical assumptions, such as the existence of noisy channels, an upper bound on the storage capacity, or the laws of quantum mechanics. Palmieri and Pereira [1] demonstrated that delays in communication channels can be used as a reasonable and effective assumption to obtain an unconditionally secure oblivious transfer protocol against honest-but-curious adversaries. While any oblivious transfer protocol secure against malicious adversaries can be used to implement commitment, the reduction does not work if the oblivious transfer protocol is only secure against honest-but-curious adversaries. Thus, the question of obtaining a secure commitment protocol based on channel delays is still open. In this paper, we provide a concrete protocol for implementing string commitments based on packet reordering – a consequence of channel delays in packet networks.

IEEE Access•Jan 1, 2021•0 citations

Adaptively Secure Oblivious Transfer

Donald Beaver

Lecture notes in computer science•Jan 1, 1998•14 citations

Physical implementation of oblivious transfer using optical correlated randomness

Tomohiro Ito, Hayato Koizumi, Nobumitsu Suzuki +8 more

We demonstrate physical implementation of information-theoretic secure oblivious transfer based on bounded observability using optical correlated randomness in semiconductor lasers driven by common random light broadcast over optical fibers. We demonstrate that the scheme can achieve one-out-of-two oblivious transfer with effective key generation rate of 110 kb/s. The results show that this scheme is a promising approach to achieve information-theoretic secure oblivious transfer over long distances for future applications of secure computation such as privacy-preserving database mining, auctions and electronic-voting.

Scientific Reports•Aug 10, 2017•7 citations

Strengthening the Security of Distributed Oblivious Transfer

Yuen Kai, Koshiba Takeshi, Shohei Nishiyama

IEICE Technical Report; IEICE Tech. Rep.•May 19, 2009•0 citations
Realizing fundamental cryptographic primitives with unconditional security is a central topic in information-theoretic cryptography. These primitives can be realized based on physical assumptions, such as the existence of noisy channels, an upper bound on the storage capacity, or the laws of quantum mechanics. Palmieri and Pereira [1] demonstrated that delays in communication channels can be used as a reasonable and effective assumption to obtain an unconditionally secure oblivious transfer protocol against honest-but-curious adversaries. While any oblivious transfer protocol secure against malicious adversaries can be used to implement commitment, the reduction does not work if the oblivious transfer protocol is only secure against honest-but-curious adversaries. Thus, the question of obtaining a secure commitment protocol based on channel delays is still open. In this paper, we provide a concrete protocol for implementing string commitments based on packet reordering – a consequence of channel delays in packet networks.
We demonstrate physical implementation of information-theoretic secure oblivious transfer based on bounded observability using optical correlated randomness in semiconductor lasers driven by common random light broadcast over optical fibers. We demonstrate that the scheme can achieve one-out-of-two oblivious transfer with effective key generation rate of 110 kb/s. The results show that this scheme is a promising approach to achieve information-theoretic secure oblivious transfer over long distances for future applications of secure computation such as privacy-preserving database mining, auctions and electronic-voting.