A randomized protocol for signing contracts

By S. Even, Oded Goldreich, A. Lempel. 1985

Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined. The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is received with probability one half, while the sender is ignorant of which secret has been received. An implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.

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 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): “There are simple and efficient protocols for oblivious transfer which are secure only against semi-honest adversaries (14; 21).”
Theory of Cryptography (2014, methodology): “4 This encoding is done as in [10,11]: we encode each matrix Mj,b relative to a unique generator of progj (denoted ρprogj ,b), and also provide an encoding of the generators.”
Efficient oblivious transfer protocols (2001, methodology): “This primitive was suggested by Even, Goldreich and Lempel [18], as a generalization of Rabin's "oblivious transfer" [28].”
Universally composable two-party and multi-party secure computation (2002, background): “Some of the many works in this model are [43, 4, 25, 36, 47, 33, 28, 3, 15, 2, 34, 38, 44, 31].”
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (2007, background): “In the oblivious transfer functionality [30, 10], a sender has two inputs (x0, x1) and a receiver has an input bit σ.”
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007, methodology): “This can be accomplished by running |y| instances of a secure 1-out-of-2 Oblivious Transfer protocol [27,7].”
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”
Lecture Notes on Cryptography (2001, background): “Even, O. Goldreich, and A. Lempel.”
How To Simulate It - A Tutorial on the Simulation Proof Technique (2016, methodology): “We will show how to securely compute the bit oblivious transfer functionality, defined by f((b0, b1), σ) = (λ, bσ), where b0, b1, σ ∈ {0, 1} [35, 16].”
GSHADE: faster privacy-preserving distance computation and biometric identification (2014, background): “A 1-out-of-2 oblivious transfer (OT) [19,40], denoted by OT, is a two-party protocol where one party (the sender) inputs two `-bit strings x0, x1 ∈ {0, 1} and the other party (the receiver) inputs a bit b.”
Privacy preserving auctions and mechanism design (1999, background): “The notion of 1-out-2 oblivious transfer was suggested by Even, Goldreich and Lempel [12] as a generalization of Ra-bin's \oblivious transfer" [32].”
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.”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, background): “The idea resembles that of the gradual release protocols used for exchanging secret keys [3, 6], signing contracts [8], and secure computation [18].”