Abstract
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a 0 a 1...a n − 1 and B = b 0 b 1...b n − 1, respectively. Furthermore, for every k=0,1,...,n-1, (a k ,b k ) is independently drawn from a distribution \(\mathcal{N}\), known as the “noise mode”. 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 bit, denoted by X and Y, such that Prob[X = Y] can be made as close to 1 as possible. The problem is, for what noise model 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. This example, which may be of its own interest, demonstrates that even the smallest amount of communication is provably more powerful than no communication.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Maurer, U., Wigderson, A.: Private communication
Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65–79. Springer, Heidelberg (1999)
Blahut, R.E.: Theory and practice of error control codes. Addison-Wesley, Reading (1983)
Bennett, C.H., Bessette, F., Brassard, G., Salvail, L., Smolin, J.: Experimental quantum cryptography. Journal of Cryptology 5(1), 3–28 (1992)
Bennett, C.H., DiVincenzo, D.P., Linsker, R.: Digital recording system with time-bracketed authentication by on-line challenges and method for authenticating recordings. US patent 5764769 (1998)
Brassard, G., Salvail, L.: Secret-key reconciliation by public discussion. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 410–423. Springer, Heidelberg (1994)
Cachin, C., Maurer, U.: Linking information reconciliation and privacy amplification. Journal of Cryptology 10(2), 97–110 (1997)
Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292–306. Springer, Heidelberg (1997)
Cover, T.M., Thomas, J.A.: Elements of information theory. John Wiley and Sons, Chichester (1991)
Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 155–177. Springer, Heidelberg (2001)
Lancaster, P., Tismenetsky, M.: The theory of matrices, with applications, 2nd edn. Academic Press, London (1985)
Maurer, U.M.: Conditionally-perfect secrecy and a provably secure randomized cipher. Journal of Cryptology 5, 53–66 (1992)
Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory 39, 733–742 (1993)
Mossel, E., O’Donnell, R.: Coin Flipping from a Cosmic Source: On Error Correction of Truly Random Bits (manuscript)
Rabin, M.: Transaction Protection by Beacons. Journal of Computer and System Sciences 27(2), 256–267 (1983)
Yang, K.: On the (Im)possibility of Non-interactive Correlation Distillation (full version). To appear in ECCC
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, K. (2004). On the (Im)possibility of Non-interactive Correlation Distillation. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive