How To Exchange Secrets with Oblivious Transfer

By M. Rabin. 2005

1,564 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

Secure Federated Submodel Learning (2019, background): “We note that another celebrated cryptographic primitive, called Oblivious Transfer (OT) [17], is stronger than private information retrieval.”
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.”
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “Upon receiving the circuit, the evaluator engages in a 1-out-of-2 oblivious transfer protocol [13], [14] with the garbler, playing the role of the chooser, so as to obliviously obtain the garbled-circuit input values corresponding to its private input a 2 , GI(a 2 ).”
Secure Multiparty Computation for Privacy-Preserving Data Mining (2009, methodology): “We will use a specific variant of oblivious transfer, 1-out-of-2 oblivious transfer, which was suggested by Even, Goldreich and Lempel (14) (as a variant of a different but equivalent type of oblivious transfer that has been suggested by Rabin (42)).”
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011, methodology): “We also consider the models of universal composability and covert adversaries, and refer the reader to [4] and [1], respectively, for appropriate definitions.”
Universally Composable Two-Party and Multi-party Secure Computation (unknown): “Some of the many works in this model are [43, 4, 25, 36, 47, 33, 28, 3, 15, 2, 34, 38, 44, 31].”
No Peek: A Survey of private distributed deep learning (2018, background): “Yao’s [48] garbled circuit protocol for the millionaire’s problem and 1–2 oblivious transfer [114,113] are prominent works in this direction.”
Secure Function Evaluation Using an FPGA Overlay Architecture (2017, background): “Subsequently, the Evaluator, Garbler, and the input owners engage in a proxy oblivious transfer [7, 25, 32].”
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (2007, background): “In the oblivious transfer functionality [9,28], a sender has two inputs (x0, x1) and a receiver has an input bit σ .”
A Proof of Security of Yao’s Protocol for Two-Party Computation (2009, methodology): “The above two problems are solved by having P1 and P2 run 1-out-of-2 oblivious transfer protocols [6,13].”
Theory of Cryptography (2014, methodology): “As a first step, we use the NC(1) randomization technique (see [3,31,22]), as was done in [24] (however, unlike [24], we don’t need to extend the matrix dimensions beyond 5×5).”
GSHADE: faster privacy-preserving distance computation and biometric identification (2014, methodology): “Several techniques can be applied to realize Secure TwoParty Computation (S2PC), most prominently Yao’s garbled circuits protocol [45] and the protocol of GoldreichMicali-Wigderson (GMW) [21] that both use oblivious transfer [19, 40]; or alternatively (additively) homomorphic en-”
Secure Cloud Services: Matrix Multiplication Revisited (2013, background): “Similar approaches such as secure outsourcing [5] based on information theoretic principles, secure multi party computation[3], [4], oblivious transfer [9] have been proposed to tackle this problem.”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, background): “The oblivious PRF, or OPRF [15], is a protocol that allows the sender S, on input the key k, to let the receiver R compute the value fk(x) of a PRF fk(·) on any input x of R’s choice without releasing any other information to R, and do so obliviously in the sense that sender S learns nothing from th”
Scalable Private Set Union from Symmetric-Key Techniques (2019, methodology): “The very first OT protocol was proposed by Rabin [48].”
Secret-Sharing Schemes: A Survey (2011, background): “Next, we recall the notion of 1-out-of-2 oblivious transfer [53, 35].”
Faster Secure Two-Party Computation Using Garbled Circuits (2011, background): “One-out-of-two oblivious transfer (OT(2)1) [5, 28] is a crucial component of the garbled-circuit approach.”
XONN: XNOR-based Oblivious Deep Neural Network Inference (2019, methodology): “, GC, is the Oblivious Transfer (OT) protocol [15].”