172 search results - page 19 / 35 » Black-Box Constructions of Protocols for Secure Computation |
CRYPTO
2001
Springer
14 years 11 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
SIGOPS
1998
13 years 7 months ago
1998
Abstract. We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous...
CIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
ICCSA
2005
Springer
14 years 1 months ago
2005
Springer
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
JOC
2007
13 years 7 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...