Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...
Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert...
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...