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

Reducing Complexity Assumptions for Oblivious Transfer

Kai-Yuen Cheong, Takeshi Koshiba

Published Jan 1, 2009• 0 citations
Publisher
DOI
10.1007/978-3-642-04846-3_8

Related papers

Realizations of oblivious transfer with reduced assumptions

K.Y. Cheong

•Jan 1, 2009•0 citations

Practical Adaptive Oblivious Transfer from Simple Assumptions

Matthew Green, Susan Hohenberger

Lecture notes in computer science•Jan 1, 2011•42 citations

Weakening Security Assumptions and Oblivious Transfer

Claude Crépeau, Joe Kilian

Lecture notes in computer science•Jan 1, 1990•40 citations

Weakening Security Assumptions and Oblivious Transfer (Abstract)

Claude Crépeau, Joe Kilian

International Cryptology Conference•Aug 21, 1988•15 citations

Reducing Complexity Assumptions for Oblivious Transfer.

Kai-Yuen Cheong, Takeshi Koshiba

Reducing the minimum assumptions needed to construct various cryptographic primitives is an important andinteresting task in theoretical cryptography. Oblivious Transfer, one of the most basic cryptographic building blocks, is also studied under this scenario. Reducing the minimum assumptions for Oblivious Transfer seems not an easy task, as there are a few impossibility results under black-box reductions. Until recently, it is widely believed that Oblivious Transfer can be constructed with trapdoor permutations but not trapdoor functions in general. In this paper, we enhance previous results and show one Oblivious Transfer protocol based on a collection of trapdoor functions with some extra properties. We also provide reasons for adding the extra properties and argue that the assumptions in the protocol are nearly minimum.

•Jan 1, 2008•0 citations

More extensions of weak oblivious transfer

Minh-Dung Dang

Oblivious Transfer (OT) is a primitive of asymmetrically distributing information between users, proposed to build Secure Computations. In this letter, we propose an informationtheoretical variant of OT that requires weak assumptions and can be therefore more easily implemented with transmission media. We show then that One-out-of-two Oblivious Transfer (O-OT), the central version of OT, can be reduced to this Weak OT (WOT) with arbitrary small loss of security, i.e. secure O-OT can be realised from our WOT.

RIVF International Conference on Computing and Communication Technologies (RIVF)•Sep 22, 2006•2 citations
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important andinteresting task in theoretical cryptography. Oblivious Transfer, one of the most basic cryptographic building blocks, is also studied under this scenario. Reducing the minimum assumptions for Oblivious Transfer seems not an easy task, as there are a few impossibility results under black-box reductions. Until recently, it is widely believed that Oblivious Transfer can be constructed with trapdoor permutations but not trapdoor functions in general. In this paper, we enhance previous results and show one Oblivious Transfer protocol based on a collection of trapdoor functions with some extra properties. We also provide reasons for adding the extra properties and argue that the assumptions in the protocol are nearly minimum.
Oblivious Transfer (OT) is a primitive of asymmetrically distributing information between users, proposed to build Secure Computations. In this letter, we propose an informationtheoretical variant of OT that requires weak assumptions and can be therefore more easily implemented with transmission media. We show then that One-out-of-two Oblivious Transfer (O-OT), the central version of OT, can be reduced to this Weak OT (WOT) with arbitrary small loss of security, i.e. secure O-OT can be realised from our WOT.