One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3621 LNCS, Issue , 2006, Pages 478-493

  Holenstein, Thomas ^a   Renner, Renato ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; ERRORS; IMMUNIZATION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLARIZATION; PROBABILISTIC LOGICS; SECURITY OF DATA;

CIRCUIT POLARIZATION; PUBLIC-KEY ENCRYPTION SCHEMES; SECRET-KEY AGREEMENT; ZERO-KNOWLEDGE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33745169714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. Rudolph Ahlswede and Imre Csiszàr. Common randomness in information theory and cryptography - part I: Secret sharing. IEEE Transactions on Information Theory, 39(4):1121-1132, 1993.
2. Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer. Generalized privacy amplification. IEEE Transaction on Information Theory, 41(6):1915-1923, 1995.
3. Imre Csiszár and János Körner. Broadcast channels with confidential messages. IEEE Transactions on Information Theory, 22(6):644-654, 1978.
4. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., first edition, 1991. ISBN 0-471-06259-6.
5. Cynthia Dwork, Moni Naor, and Omer Reingold. Immunizing encryption schemes from decryption errors. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT 2004, volume 3027 of LNCS, pages 342-360, 2004.
6. Ilya I. Dumer. Concatenated codes and their multilevel generalizations. In V. S. Pless and W. C. Huffman, editors, The Handbook of Coding Theory, volume 2, chapter 23, pages 1191-1988. North-Holland, Elsevier, 1998.
7. Thomas Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th STOC, pages 664-673, 2005.
8. Thomas Holenstein and Renato Renner. On the smooth Rényi entropy of independently repeated random experiments, manuscript, 2005.
9. Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions (extended abstract). In Proceedings of the 21st STOC, pages 12-24, 1989.
10. Russell Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th FOCS, pages 538-545, 1995.
11. Ueli Maurer. Secret key agreement by public discussion. IEEE Transaction on Information Theory, 39(3):733-742, 1993.
12. Ueli Maurer and Stefan Wolf. Unconditionally secure key agreement and the intrinsic conditional information. IEEE Transaction on Information Theory, 45(2):499-514, 1999.
13. Renato Renner and Stefan Wolf. New bounds in secret-key agreement: The gap between formation and secrecy extraction. In Eli Biham, editor, EUROCRYPT 2003, volume 2656 of LNCS, pages 562-577, 2003.
14. Renato Renner and Stefan Wolf. Smooth Rényi entropy and applications. In Proceedings of 2004 IEEE International Symposium on Information Theory, page 233. IEEE, 2004.
15. Renato Renner and Stefan Wolf. Simple and tight bounds for information reconciliation and privacy amplification. Manuscript, 2005.
16. Claude E. Shannon. Communication theory of secrecy systems. Bell Systems Technical Journal, 28:656-715, 1949.
17. Amit Sahai and Salil Vadhan. A complete promise problem for statistical zero-knowledge. In The 38th FOCS, pages 448-457, 1997.
18. Amit Sahai and Salil Vadhan. Manipulating statistical difference. In Panos Pardalos, Sanguthevar Rajasekaran, and José Rolim, editors, DIMACS Series, volume 43, pages 251-270, 1999.
19. Stefan Wolf. Information-Theoretically and Computationally Secure Key Agreement in Cryptography. PhD thesis, ETH Zürich, 1999.
20. Aaron D. Wyner. The wire-tap channel. Bell Systems Technical Journal, 54:1355-1387, 1975.