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

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

Computationally Secure Oblivious Transfer

Moni Naor, Benny Pinkas B

Journal of Cryptology•Oct 21, 2004•183 citations

Adaptively Secure Oblivious Transfer

Donald Beaver

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

On Information Theoretical Limits of Oblivious Transfer

Hadi Aghaee, Bahareh Akhbari, Christian Deppe

Information-theoretical limits of oblivious transfer are studied. First, we explore the feasibility and constraints of implementing oblivious transfer protocols over some communication channels, with a focus on noisy point-to-point and multiple-access channels with non-colluding parties. The paper also examines secure multiparty communication, and highlighting the challenges of achieving oblivious transfer under information-theoretic security models. As an example, the limits of oblivious transfer over a two-user multiple access channel are studied.

IEEE Globecom Workshops (GC Wkshps)•Dec 8, 2025•2 citations

Strengthening the Security of Distributed Oblivious Transfer

Kai-Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama

Lecture notes in computer science•Jan 1, 2009•7 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.
Information-theoretical limits of oblivious transfer are studied. First, we explore the feasibility and constraints of implementing oblivious transfer protocols over some communication channels, with a focus on noisy point-to-point and multiple-access channels with non-colluding parties. The paper also examines secure multiparty communication, and highlighting the challenges of achieving oblivious transfer under information-theoretic security models. As an example, the limits of oblivious transfer over a two-user multiple access channel are studied.