24 search results - page 3 / 5 » Committed Oblivious Transfer and Private Multi-Party Computa... |
TCC
2009
Springer
14 years 6 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
ISW
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a one-round 1-out-of-n computationally-private information retrieval protocol for -bit strings with low-degree polylogarithmic receivercomputation, linear send...
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...