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

t-Out-of-n String/Bit Oblivious Transfers Revisited

Qianhong Wu, Bo Qin, Changjie Wang, Xiaofeng Chen, Yumin Wang

Published Jan 1, 2005• 3 citations
Publisher
DOI
10.1007/978-3-540-31979-5_35

Related papers

Efficient Committed Oblivious Transfer of Bit Strings

Mehmet Sabır Kiraz, Berry Schoenmakers, José Villegas

Lecture notes in computer science•Jan 1, 2007•16 citations

“The simplest protocol for oblivious transfer” revisited

Ziya Alper Genç, Vincenzo Iovino, Alfredo Rial

Information Processing Letters•Jun 4, 2020•10 citations

Efficient Additive Randomized Encodings for String Oblivious Transfer: A Core Primitive for General Functions

Masaya Yoshimura, Kyoichi Asano, Yugo Kasashima +2 more

Lecture notes in computer science•Jan 1, 2026•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

Oblivious Transfers and Intersecting Codes.

Gilles Brassard A, Claude Crépeau, Miklós Sántha

Assume A owns t secret k--bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement One-out-of-t String Oblivious Transfer, denoted ( t 1 )--OT k 2 . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 and t = 2 of two one-bit secrets: this is known as One-out-of-two Bit Oblivious Transfer, denoted ( 2 1 )--OT 2 . We address the question of implementing ( t 1 )--OT k 2 assuming the existence of a ( 2 1 )--OT 2 . In particular, we prove that unconditionally secure ( 2 1 )--OT k 2 can be implemented from \\Theta(k) calls to ( 2 1 )--OT 2 . This is optimal up to a small multiplicative constant. Our solution is based on the notion of self-intersecting codes. Of independent interest, we give several...

•Jan 1, 1996•0 citations

Reducing oblivious string transfer to universal oblivious transfer

Stefan Wolf

It is shown that oblivious transfer of strings can be reduced to the weakest version of oblivious bit transfer, where the receiver can choose to obtain arbitrary (but incomplete) information about the pair of bits sent. This solves an open problem posed by Brassard and Crepeau (see Advances in Cryptography$EUROCRYPT' 97, LNCS, vol.1233, p.334-45, Springer-Verlag, 1997).

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•7 citations
Assume A owns t secret k--bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement One-out-of-t String Oblivious Transfer, denoted ( t 1 )--OT k 2 . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 and t = 2 of two one-bit secrets: this is known as One-out-of-two Bit Oblivious Transfer, denoted ( 2 1 )--OT 2 . We address the question of implementing ( t 1 )--OT k 2 assuming the existence of a ( 2 1 )--OT 2 . In particular, we prove that unconditionally secure ( 2 1 )--OT k 2 can be implemented from \\Theta(k) calls to ( 2 1 )--OT 2 . This is optimal up to a small multiplicative constant. Our solution is based on the notion of self-intersecting codes. Of independent interest, we give several...