Consider two parties holding correlated random variables W and W′, respectively, that are
within distance t of each other in some metric space. These parties wish to agree on a …

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 …

Consider two parties holding samples from correlated distributions W and W^′,
respectively, where these samples are within distance t of each other in some metric space …

A fuzzy extractor (FE) aims at deriving and reproducing (almost) uniform cryptographic keys
from noisy non-uniform sources. To reproduce an identical key R from subsequent readings …

In studying how to communicate over a public channel with an active adversary, Dodis and
Wichs introduced the notion of a nonmalleable extractor. A nonmalleable extractor …

We consider information-theoretic key agreement between two parties sharing somewhat
different versions of a secret w that has relatively little entropy. Such key agreement, also …

Fuzzy extractors have been proposed in 2004 by Dodis et al. as a secure way to generate
cryptographic keys from noisy sources. In recent years, fuzzy extractors have become an …

Abstract Robustly reusable Fuzzy Extractor (rrFE) considers reusability and robustness
simultaneously. We present two approaches to the generic construction of rrFE. Both of …

With the growing adoption of facial recognition worldwide as a popular authentication
method, there is increasing concern about the invasion of personal privacy due to the …

Abstract Robustly reusable Fuzzy Extractor (rrFE) allows multiple extractions from the same
fuzzy source in a reproducible way. The reusability of rrFE asks the pseudo-randomness of …