3 search results - page 1 / 1 » 2-Source Extractors under Computational Assumptions and Cryp... |
152
click to vote
FOCS
2009
IEEE
16 years 13 days 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...
200
click to vote
ASIACRYPT
2011
Springer
14 years 5 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...
181
Voted
FOCS
2000
IEEE
15 years 10 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...