Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
We introduce delegation schemes wherein a user may delegate certain rights to himself, but may not safely delegate these rights to others. In our motivating application, a user ha...
Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractabili...
We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents. We analyze the main drawbacks of the time-st...
Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Wille...
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...