Sciweavers

242 search results - page 41 / 49
» Randomness in Cryptography
Sort
View
EUROCRYPT
2009
Springer
15 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
CCS
2005
ACM
15 years 3 months ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
EUROCRYPT
2004
Springer
15 years 3 months ago
Immunizing Encryption Schemes from Decryption Errors
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
Cynthia Dwork, Moni Naor, Omer Reingold
CC
2007
Springer
108views System Software» more  CC 2007»
14 years 9 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
13 years 16 hour ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman