Sciweavers

CRYPTO
2006
Springer
115views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
The Number Field Sieve in the Medium Prime Case
Antoine Joux, Reynald Lercier, Nigel P. Smart, Fre...
139
Voted
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
CRYPTO
2006
Springer
84views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Strengthening Digital Signatures Via Randomized Hashing
Shai Halevi, Hugo Krawczyk
CRYPTO
2006
Springer
110views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
On the Power of the Randomized Iterate
We consider two of the most fundamental theorems in Cryptography. The first, due to H
Iftach Haitner, Danny Harnik, Omer Reingold