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

Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions

Payman Mohassel, Salman Niksefat

Published Jan 1, 2012• 7 citations
Publisher
DOI
10.1007/978-3-642-32946-3_20

Related papers

Lower Bounds for Oblivious Transfer Reductions

Yevgeniy Dodis, Silvio M. Micali

Lecture notes in computer science•Jan 1, 1999•46 citations

On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

Severin Winkler, Jürg Wullschleger

Lecture notes in computer science•Jan 1, 2010•25 citations

Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

Claude Crépeau, George Savvides

Lecture notes in computer science•Jan 1, 2006•33 citations

Oblivious decision program evaluation

Salman Niksefat, Babak Sadeghiyan, Payman Mohassel

In this study, the authors design efficient protocols for a number of ‘oblivious decision program (DP) evaluation’ problems. Consider a general form of the problem where a client who holds a private input interacts with a server who holds a private DP (e.g. a decision tree or a branching program) with the goal of evaluating his input on the DP without learning any additional information. Many known private database query problems such as symmetric private information retrieval and private keyword search can be formulated as special cases of this problem. Most of the existing works on the same problem focus on optimising communication. However, in some environments (supported by a few experimental studies), it is the computation and not the communication that may be the performance bottleneck. In this study, we design ‘computationally efficient’ protocols for the above general problem, and a few of its special cases. In addition to being one‐round and requiring a small amount of work by the client (in the RAM model), the proposed protocols only require a small number of exponentiations (independent of the server's input) by both parties. The proposed constructions are, in essence, efficient and black‐box reductions of the above problem to 1‐out‐of‐2 oblivious transfer. It is proved that the proposed protocols secure (private) against ‘malicious’ adversaries in the standard ideal/real‐world simulation‐based paradigm.

IET Information Security•Jun 1, 2013•0 citations

Efficiently from Semi-honest to Malicious OT via OLFE.

Jürg Wullschleger

A combiner securely implements a functionality out of a set implementations of another functionality from which some may be insecure. We present two efficient combiners for oblivious linear function evaluation (OLFE). The first is a constant-rate OLFE combiner in the semihonest model, the second combiner implements Rabin string oblivious transfer (RabinOT) from OLFE in the malicious model. As an application, we show a very efficient reductions in the malicious model of RabinOT over strings to one-out-of-two oblivious transfer over bits (OT) that is only secure in the semihonest model. For string of size ℓ = ω(k 2), our reductions uses only 4ℓ + o(ℓ) instances of OT, while previous results required Ω(ℓk 2). Our new reduction leads to an efficiency improvement for general multi-party computation (MPC) based on semi-honest OT, and makes it almost as efficient as MPC based on malicious OT. All reductions are unconditionally secure, black-box, universally composable and secure against adaptive adversaries. 1 1

•Jan 1, 2009•1 citation

Realizations of oblivious transfer with reduced assumptions

K.Y. Cheong

•Jan 1, 2009•0 citations
In this study, the authors design efficient protocols for a number of ‘oblivious decision program (DP) evaluation’ problems. Consider a general form of the problem where a client who holds a private input interacts with a server who holds a private DP (e.g. a decision tree or a branching program) with the goal of evaluating his input on the DP without learning any additional information. Many known private database query problems such as symmetric private information retrieval and private keyword search can be formulated as special cases of this problem. Most of the existing works on the same problem focus on optimising communication. However, in some environments (supported by a few experimental studies), it is the computation and not the communication that may be the performance bottleneck. In this study, we design ‘computationally efficient’ protocols for the above general problem, and a few of its special cases. In addition to being one‐round and requiring a small amount of work by the client (in the RAM model), the proposed protocols only require a small number of exponentiations (independent of the server's input) by both parties. The proposed constructions are, in essence, efficient and black‐box reductions of the above problem to 1‐out‐of‐2 oblivious transfer. It is proved that the proposed protocols secure (private) against ‘malicious’ adversaries in the standard ideal/real‐world simulation‐based paradigm.
A combiner securely implements a functionality out of a set implementations of another functionality from which some may be insecure. We present two efficient combiners for oblivious linear function evaluation (OLFE). The first is a constant-rate OLFE combiner in the semihonest model, the second combiner implements Rabin string oblivious transfer (RabinOT) from OLFE in the malicious model. As an application, we show a very efficient reductions in the malicious model of RabinOT over strings to one-out-of-two oblivious transfer over bits (OT) that is only secure in the semihonest model. For string of size ℓ = ω(k 2), our reductions uses only 4ℓ + o(ℓ) instances of OT, while previous results required Ω(ℓk 2). Our new reduction leads to an efficiency improvement for general multi-party computation (MPC) based on semi-honest OT, and makes it almost as efficient as MPC based on malicious OT. All reductions are unconditionally secure, black-box, universally composable and secure against adaptive adversaries. 1 1