6 search results - page 1 / 2 » On the (Im)possibility of Cryptography with Imperfect Random... |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those consi...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...