Efficient oblivious transfer protocols

By Moni Naor, Benny Pinkas. 2001

853 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, background): “While the garbler can directly send the garbled values for its input bits, the parties need to run an oblivious transfer (OT) protocol [55, 62] to enable the evaluator to obtain the input garbled labels corresponding its input bits without revealing those inputs to the generator.”
Secure Multiparty Computation for Privacy-Preserving Data Mining (2009, methodology): “The number of rounds of the protocol is constant (namely, the variant described here has two rounds using the two-round oblivious transfer protocols of (14; 21; 36)).”
Extending Oblivious Transfers Efficiently (2003, background): “[ 28 ]) in fact realize OT with these parameters.”
Computationally Secure Oblivious Transfer (2004, methodology): “We note that in a subsequent work [44] we described how to implement 1-out-of-N OT with an amortized overhead of a single 1-out-of-2 OT.”
Blind Vision (2006, methodology): “The first relies on cryptographic methods that leverage a small number of OT operations to perform a large number of OT [12, 8].”
Improved Garbled Circuit: Free XOR Gates and Applications (2008, methodology): “One-round OT is a widely studied primitive in the standard model [2,1], with improved implementations in the RO model [20,3].”
Evaluating Branching Programs on Encrypted Data (2007, methodology): “Protocols for computing on encrypted data in the above model give rise to one-round (two-message) protocols for secure two-party computation of U(·, ·) under the relaxed security definitions of [29,1,13].”
Lossy trapdoor functions and their applications (2008, methodology): “Our approach can be contrasted with the oblivious transfer (OT) paradigm of Even, Goldreich, and Lempel [18] and the efficient OT protocols of Naor and Pinkas [28].”
Security and Privacy in Radio-Frequency Identification Devices (2003, methodology): “Oblivious transfer protocols may rely on base assumptions involving Diffie-Hellman [70], channel noise [26] or quantum properties [25].”
Strathprints Institutional Repository (unknown): “It is easy to see that s can be recovered by computing r 1 ⊕ , ..., ⊕ r n and any subset of less than n shares reveals no information about the secret.”
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation (2015, methodology): “While OT protocols require costly public-key cryptography, OT extension [1], [6], [41] allows to extend a few base OTs (for which we use [56] in our experiments) using only symmetric cryptographic primitives and a constant number of rounds.”
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007, background): “Candidate protocols can be the protocol of [7] compiled according to the GMW paradigm, or the tworound protocols of [25,2,16] with additional proofs of knowledge.”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, methodology): “For the “base” OTs we use the Naor-Pinkas protocol [31], whose security is based on the computational Difﬁe-Hellman assumption in the random-oracle model.”
Practical Multi-party Private Set Intersection from Symmetric-Key Techniques (2017, methodology): “In our protocol, the offline phase is conducted to obtain an 128 base-OTs using Naor-Pinkas construction [33].”
Keyword Search and Oblivious Pseudorandom Functions (2005, methodology): “These improvements are partially relevant also in the context of t-outof-n OT, as originally studied in [23, 25].”