Results 1  10
of
18,217
Extending Oblivious Transfers Efficiently
, 2003
"... We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers \for free," can one implement a large number of oblivious transfers? Beaver has shown how to extend oblivious transfers given a oneway function. However, this protocol is inecient in pract ..."
Abstract

Cited by 94 (1 self)
 Add to MetaCart
We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers \for free," can one implement a large number of oblivious transfers? Beaver has shown how to extend oblivious transfers given a oneway function. However, this protocol is inecient
Oblivious Transfer
"... This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multiagent systems, with respect to a perfect recall interpretation of knowledge and agents’ subjective probability. The algorithm has been implemented in the epistemic model checker MCK. So ..."
Abstract
 Add to MetaCart
This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multiagent systems, with respect to a perfect recall interpretation of knowledge and agents’ subjective probability. The algorithm has been implemented in the epistemic model checker MCK. Some experiments with the implemented algorithm are reported, in which some properties of agents ’ probabilistic knowledge are verified in two security protocols: Chaum’s Dining Cryptographers protocol, and a protocol for
Computationally Secure Oblivious Transfer
, 1999
"... We describe a new construction for 1outofN oblivious transfer which is highly efficient  it requires only log N executions of a 1outof2 oblivious transfer protocol. ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
We describe a new construction for 1outofN oblivious transfer which is highly efficient  it requires only log N executions of a 1outof2 oblivious transfer protocol.
Reducing String Oblivious Transfer to Universal Oblivious Transfer
 Proceedings of ISIT 2000
, 2000
"... This paper is concerned with informationtheoretic reductions of 1out of2 chosen string oblivious transfer to other primitives that are as weak as possible. At Eurocrypt '97, Brassard and Crpeau presented a reduction to socalled generalized bit oblivious transfer, a primitive in which th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper is concerned with informationtheoretic reductions of 1out of2 chosen string oblivious transfer to other primitives that are as weak as possible. At Eurocrypt '97, Brassard and Crpeau presented a reduction to socalled generalized bit oblivious transfer, a primitive in which
Rational Oblivious Transfer
, 2014
"... Oblivious transfer is widely used in secure multiparty computation. In this paper, we propose a game theoretic analysis of this primitive and discuss how a protocol for efficient rational oblivious transfer should be in the real world. 1 ..."
Abstract
 Add to MetaCart
Oblivious transfer is widely used in secure multiparty computation. In this paper, we propose a game theoretic analysis of this primitive and discuss how a protocol for efficient rational oblivious transfer should be in the real world. 1
On the Feasibility of Extending Oblivious Transfer
, 2012
"... Oblivious transfer is one of the most basic and important building blocks in cryptography. As such, understanding its cost is of prime importance. Beaver (STOC 1996) showed that it is possible to obtain poly(n) oblivious transfers given only n actual oblivious transfer calls and using oneway functi ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Oblivious transfer is one of the most basic and important building blocks in cryptography. As such, understanding its cost is of prime importance. Beaver (STOC 1996) showed that it is possible to obtain poly(n) oblivious transfers given only n actual oblivious transfer calls and using one
Oblivious Transfer is Symmetric
 In EUROCRYPT 2006, Springer (LNCS 4004
, 2006
"... Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991. 1 ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991. 1
Distributed Oblivious Transfer
 In Proc. ASIACRYPT 2000
, 2000
"... This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer
Oblivious Transfer and Quantum Channels
, 2006
"... We show that oblivious transfer can be seen as the classical analogue to a quantum channel in the same sense as nonlocal boxes are for maximally entangled qubits. ..."
Abstract
 Add to MetaCart
We show that oblivious transfer can be seen as the classical analogue to a quantum channel in the same sense as nonlocal boxes are for maximally entangled qubits.
Practical Quantum Oblivious Transfer
, 1992
"... We describe a protocol for quantum oblivious transfer , utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two onebit messages in such a way that the other party ("Bob") can choose which message he gets but cannot obta ..."
Abstract

Cited by 93 (13 self)
 Add to MetaCart
We describe a protocol for quantum oblivious transfer , utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two onebit messages in such a way that the other party ("Bob") can choose which message he gets but cannot
Results 1  10
of
18,217