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

On the foundations of oblivious transfer

Christian Cachin

Published Jan 1, 1998• 50 citations
Publisher
DOI
10.1007/bfb0054139

Related papers

Study on Quantum Oblivious Transfer

Xiao Qiang Guo, Yan Yan, Hong Wang +1 more

The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.

Applied Mechanics and Materials•Dec 1, 2012•0 citations

On the Feasibility of Extending Oblivious Transfer

Yehuda Lindell, Hila Zarosim

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

On the Feasibility of Extending Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Journal of Cryptology•Dec 4, 2017•1 citation

More efficient oblivious transfer and extensions for faster secure computation

Gilad Asharov, Yehuda Lindell, Thomas H. Schneider +1 more

Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Jan 1, 2013•365 citations

Construction of m-out-of-n Oblivious Transfer

Zhide Chen

Oblivious transfer(OT)is used as a key component in many applications of cryptography. In this paper, a1-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-2 oblivious transfer;an m-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-n oblivious transfer. Finally,a1-out-of-2 oblivious transfer is constructed based on public key system. By this way,any existed public key system can be used to construct m-out-of-n oblivious transfer.

Journal of Chinese Computer Systems•Jan 1, 2006•0 citations

On the Reversibility of Oblivious Transfer

Claude Crépeau, Miklós Sántha

Springer eBooks•Aug 6, 2007•26 citations
The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.