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

Journal of Network and Computer Applications

Robust t-out-of-n oblivious transfer mechanism based on CRT

Chin‐Chen Chang, Jung-San Lee

Published Mar 29, 2008• 18 citations
Publisher
DOI
10.1016/j.jnca.2008.03.004

Related papers

Robuster Combiners for Oblivious Transfer

Remo Meier, Bartosz Przydatek, Jürg Wullschleger

Springer eBooks•May 16, 2007•42 citations

On Robust Combiners for Oblivious Transfer and Other Primitives

Danny Harnik, Joe Kilian, Moni Naor +2 more

Lecture notes in computer science•Jan 1, 2005•121 citations

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

Practical t-out-n Oblivious Transfer and Its Applications

Qianhong Wu, Jianhong Zhang, Yumin Wang

Lecture notes in computer science•Jan 1, 2003•23 citations

Efficient 1-Out-n Oblivious Transfer Schemes

Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2002•86 citations

Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free.

Jesper Buus Nielsen

At Crypto 2003 Ishai et al. gave a protocol which given a small number of (possibly extremely inefficient) oblivious transfers implements an essentially unbounded number of oblivious transfers for an additional overhead, per oblivious transfer, of computing and sending only two hash values. This highly efficient protocol is however only passive secure. To get active security, except with probability 2 −m, the protocol had to suffer an additional overhead of a factor 1 + m. We introduce a new approach to adding robustness. For practical security parameters this approach allows to add robustness while suffering only a small constant overhead over the passive secure protocol. As an example we can generate one million oblivious transfers with security 2 −42 with an amortized cost of just 9 hash values per oblivious transfer.

•Jan 1, 2007•28 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.
At Crypto 2003 Ishai et al. gave a protocol which given a small number of (possibly extremely inefficient) oblivious transfers implements an essentially unbounded number of oblivious transfers for an additional overhead, per oblivious transfer, of computing and sending only two hash values. This highly efficient protocol is however only passive secure. To get active security, except with probability 2 −m, the protocol had to suffer an additional overhead of a factor 1 + m. We introduce a new approach to adding robustness. For practical security parameters this approach allows to add robustness while suffering only a small constant overhead over the passive secure protocol. As an example we can generate one million oblivious transfers with security 2 −42 with an amortized cost of just 9 hash values per oblivious transfer.