We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not hav...
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles ...