Elements of information theory
Elements of information theory
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Unconditional Security Against Memory-Bounded Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Coin flipping from a cosmic source: On error correction of truly random bits
Random Structures & Algorithms
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The impossibility of non-signaling privacy amplification
Theoretical Computer Science
| Hi-index | 5.23 |
We study the problem of non-interactive correlation distillation (NICD). Suppose that Alice and Bob each have a string, denoted by A=a0a1…an-1 and B=b0b1…bn-1, respectively. Furthermore, for every k=0,1,…,n-1, (ak,bk) is drawn independently from a distribution , known as the 'noise model'. Alice and Bob wish to 'distill' the correlation non-interactively, i.e., they wish to each apply a function to their strings, and output one random bit, denoted by X and Y, such that Pr[X=Y] can be made as close to 1 as possible. The problem is, for what noise models can they succeed? This problem is related to various topics in computer science, including information reconciliation and random beacons. In fact, if NICD is indeed possible for some general class of noise models, then some of these topics would, in some sense, become straightforward corollaries. We prove two negative results on NICD for various noise models. We prove that, for these models, it is impossible to distill the correlation to be arbitrarily close to 1. We also give an example where Alice and Bob can increase their correlation with one bit of communication (in this case they need to each output two bits). This example, which may be of interest on its own, demonstrates that even the smallest amount of communication is provably more powerful than no communication.