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

Improved OT Extension for Transferring Short Secrets

Vladimir Kolesnikov, Ranjit Kumaresan

Published Jan 1, 2013• 175 citations
Publisher
DOI
10.1007/978-3-642-40084-1_4

Related papers

How to Exchange Secrets by OT

The KIPS Transactions PartC•Oct 1, 2003•0 citations

Fast Actively Secure OT Extension for Short Secrets

Arpita Patra, Pratik Sarkar, Ajith Suresh

Author(s): Arpita Patra, Pratik Sarkar, Ajith Suresh Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems … Continued

arXiv:1911.08834•Network and Distributed System Security Symposium•Jan 1, 2017•11 citations

Actively Secure OT Extension with Optimal Overhead

Marcel Keller, Emmanuela Orsini, Peter Schöll

Lecture notes in computer science•Jan 1, 2015•173 citations

On the Reversibility of Oblivious Transfer

UniversitP de Paris-Sud

i (:)-OT, (one-out-of-two Bit Oblivious Transfer) is a technique by which a party S owning two secret bits b,bl, can transfer one of them b, to another party R, who chooses c. This is done in a way that does not release any bias about bz to R nor any bias about c to S. How can one build a 2TO-(i) ((;)-OT2 from R to S) given a (i)-OT, (from S to a)? This question is interesting because in many scenarios, one of the two parties will be much more powerful than the other. In the current paper we answer this question and show a number of related extensions. One interesting extension of this transfer is the (:)-OTk (one-out-of-two String O.T.) in which the two secrets qo, q1 are elements of CFk(2) instead of bits. We show that $TO-(:) can be obtained at about the same cost as (3-OT:, in terms of number of cab to (i)-OTz.

•Jan 1, 1991•5 citations

How To Exchange Secrets By OT.

Yong Ju Yis, Sangchoon Kim, Sang-Ho Lee

International Conference on Internet Computing•Jan 1, 2000•0 citations

From OT to OLE with Subquadratic Communication

Jack Doerner, Iftach Haitner, Yuval Ishai +1 more

Oblivious Linear Evaluation (OLE) is an algebraic generalization of oblivious transfer (OT) that forms a critical part of a growing number of applications. An OLE protocol over a modulus q enables the receiver party to securely evaluate a line a⋅ X+b chosen by the sender party on a secret point x∈ ℤq. Motivated by the big efficiency gap between OLE and OT and by fast OT extension techniques, we revisit the question of reducing OLE to OT, aiming to improve the communication cost of known reductions.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 19, 2025•1 citation
i (:)-OT, (one-out-of-two Bit Oblivious Transfer) is a technique by which a party S owning two secret bits b,bl, can transfer one of them b, to another party R, who chooses c. This is done in a way that does not release any bias about bz to R nor any bias about c to S. How can one build a 2TO-(i) ((;)-OT2 from R to S) given a (i)-OT, (from S to a)? This question is interesting because in many scenarios, one of the two parties will be much more powerful than the other. In the current paper we answer this question and show a number of related extensions. One interesting extension of this transfer is the (:)-OTk (one-out-of-two String O.T.) in which the two secrets qo, q1 are elements of CFk(2) instead of bits. We show that $TO-(:) can be obtained at about the same cost as (3-OT:, in terms of number of cab to (i)-OTz.
Oblivious Linear Evaluation (OLE) is an algebraic generalization of oblivious transfer (OT) that forms a critical part of a growing number of applications. An OLE protocol over a modulus q enables the receiver party to securely evaluate a line a⋅ X+b chosen by the sender party on a secret point x∈ ℤq. Motivated by the big efficiency gap between OLE and OT and by fast OT extension techniques, we revisit the question of reducing OLE to OT, aiming to improve the communication cost of known reductions.