41 search results - page 3 / 9 » On extracting common random bits from correlated sources |
SOUPS
2009
ACM
14 years 8 days ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
ICNS
2009
IEEE
14 years 13 days ago
2009
IEEE
Hashing technique have been widely adopted for various computer network applications such as IP address lookup and intrusion detection, among which XOR-hashing is one of most popu...
FOCS
2002
IEEE
13 years 10 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...
FOCS
2009
IEEE
14 years 15 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...
EUROCRYPT
2007
Springer
13 years 12 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....