3 search results - page 1 / 1 » 2-Source Extractors under Computational Assumptions and Cryp... |
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...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...