100 search results - page 7 / 20 » Alice and Bob |
EUROCRYPT
2000
Springer
14 years 12 days ago
2000
Springer
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 &...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
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...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
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...
LATIN
2004
Springer
14 years 2 months ago
2004
Springer
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,...