64 search results - page 8 / 13 » crypto 2006 |
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...