CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
141
click to vote
CRYPTO
2006
Springer
15 years 7 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...
152
click to vote
CRYPTO
2006
Springer
15 years 7 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...
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
131
click to vote
CRYPTO
2006
Springer
15 years 7 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...