Abstract
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an information-theoretic sense if the parties share many independent pairs of correlated and partially secure bits. We study the special case where only one-way communication from Alice to Bob is allowed and where, for each of the bit pairs, with a certain probability, the adversary has no information on Alice’s bit. We give an expression which, for this situation, exactly characterizes the rate at which Alice and Bob can generate secret key bits.
This result can be used to analyze a slightly restricted variant of the problem of polarizing circuits, introduced by Sahai and Vadhan in the context of statistical zero-knowledge, which we show to be equivalent to secret-key agreement as described above. This provides us both with new constructions to polarize circuits, but also proves that the known constructions work for parameters which are tight.
As a further application of our results on secret-key agreement, we show how to immunize single-bit public-key encryption schemes from decryption errors and insecurities of the encryption, a question posed and partially answered by Dwork, Naor, and Reingold. Our construction works for stronger parameters than the known constructions.
Supported by the Swiss National Science Foundation, project no. 200020-103847/1.
Chapter PDF
Similar content being viewed by others
Keywords
- Encryption Scheme
- Statistical Distance
- Polarization Method
- Bell System Technical Journal
- Decryption Error
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ahlswede, R., Csiszàr, I.: Common randomness in information theory and cryptography—part I: Secret sharing. IEEE Transactions on Information Theory 39(4), 1121–1132 (1993)
Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.: Generalized privacy amplification. IEEE Transaction on Information Theory 41(6), 1915–1923 (1995)
Csiszár, I., Körner, J.: Broadcast channels with confidential messages. IEEE Transactions on Information Theory 22(6), 644–654 (1978)
Cover, T.M., Thomas, J.A.: Elements of Information Theory, 1st edn. John Wiley & Sons, Inc., Chichester (1991) ISBN 0-471-06259-6
Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342–360. Springer, Heidelberg (2004)
Dumer, I.I.: Concatenated codes and their multilevel generalizations. In: Pless, V.S., Huffman, W.C. (eds.) The Handbook of Coding Theory, ch. 23, vol. 2, pp. 1191–1988. North-Holland/ Elsevier (1998)
Holenstein, T.: Key agreement from weak bit agreement. In: Proceedings of the 37th STOC, pp. 664–673 (2005)
Holenstein, T., Renner, R.: On the smooth Rényi entropy of independently repeated random experiments (2005) (manuscript)
Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstract). In: Proceedings of the 21st STOC, pp. 12–24 (1989)
Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: 36th FOCS, pp. 538–545 (1995)
Maurer, U.: Secret key agreement by public discussion. IEEE Transaction on Information Theory 39(3), 733–742 (1993)
Maurer, U., Wolf, S.: Unconditionally secure key agreement and the intrinsic conditional information. IEEE Transaction on Information Theory 45(2), 499–514 (1999)
Renner, R., Wolf, S.: New bounds in secret-key agreement: The gap between formation and secrecy extraction. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 562–577. Springer, Heidelberg (2003)
Renner, R., Wolf, S.: Smooth Rényi entropy and applications. In: Proceedings of 2004 IEEE International Symposium on Information Theory, p. 233. IEEE, Los Alamitos (2004)
Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification (2005) (manuscript)
Shannon, C.E.: Communication theory of secrecy systems. Bell Systems Technical Journal 28, 656–715 (1949)
Sahai, A., Vadhan, S.: A complete promise problem for statistical zero-knowledge. In: The 38th FOCS, pp. 448–457 (1997)
Sahai, A., Vadhan, S.: Manipulating statistical difference. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.). DIMACS Series, vol. 43, pp. 251–270 (1999)
Wolf, S.: Information-Theoretically and Computationally Secure Key Agreement in Cryptography. PhD thesis, ETH Zürich (1999)
Wyner, A.D.: The wire-tap channel. Bell Systems Technical Journal 54, 1355–1387 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holenstein, T., Renner, R. (2005). One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. In: Shoup, V. (eds) Advances in Cryptology – CRYPTO 2005. CRYPTO 2005. Lecture Notes in Computer Science, vol 3621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535218_29
Download citation
DOI: https://doi.org/10.1007/11535218_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28114-6
Online ISBN: 978-3-540-31870-5
eBook Packages: Computer ScienceComputer Science (R0)