Unconditional authenticity and privacy from an arbitrarily weak secret

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

Volumn 2729, Issue , 2003, Pages 78-95

  Renner, Renato ^a   Wolf, Stefan ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Authentication; Extractors; Information theoretic security; Privacy amplification; Quantum key agreement

Indexed keywords

ACCESS CONTROL; CRYPTOGRAPHY; INFORMATION THEORY;

CRYPTOGRAPHIC SECURITY; EXTRACTORS; INFORMATION- THEORETIC SECURITIES; MESSAGE AUTHENTICATION; POWER-OF-TWO; PRIVACY AMPLIFICATION; PRIVATE KEY; QUANTUM KEY;

AUTHENTICATION;

EID: 35048874991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_5     Document Type: Article

References (26)

1. Y. Aumann, Y. Z. Ding, and M. O. Rabin, Everlasting security in the bounded storage model, IEEE Trans. on Information Theory, Vol. 48, pp. 1668-1680, 2002.
2. C. H. Bennett and G. Brassard, Quantum cryptography: public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175-179, 1984.
3. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, Generalized privacy amplification, IEEE Trans. on Information Theory, Vol. 41, No. 6, pp. 1915-1923, 1995.
4. C. H. Bennett, G. Brassard, and J.-M. Robert, Privacy amplification by public discussion, SIAM Journal on Computing, Vol. 17, pp. 210-229, 1988.
5. C. Cachin, Entropy measures and unconditional security in cryptography, Ph. D. Thesis, ETH Zürich, Hartung-Gorre Verlag, Konstanz, 1997.
6. I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Trans. on Information Theory, Vol. 24, pp. 339-348, 1978.
7. Y. Dodis and J. Spencer, On the (non)universality of the one-time pad, Proceedings of FOCS 2002, 2002.
8. S. Dziembowski and U. M. Maurer, Tight security proofs for the bounded-storage model, Proceedings of STOC 2002, pp. 341-350, 2002.
9. W. Feller, An introduction to probability theory and its applications, 3rd edition, Vol. 1, Wiley International, 1968.
10. P. Gemmell and M. Naor, Codes for interactive authentication, Advances in Cryptology - CRYPTO '93, LNCS, Vol. 773, pp. 355-367, Springer-Verlag, 1993.
11. T. Holenstein, U. M. Maurer, and R. Renner, personal communication.
12. U. M. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, Journal of Cryptology, Vol. 5, No. 1, pp. 53-66, 1992.
13. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Trans. on Information Theory, Vol. 39, No. 3, pp. 733-742, 1993.
14. U. M. Maurer and S. Wolf, Privacy amplification secure against active adversaries, Advances in Cryptology - CRYPTO '97, LNCS, Vol. 1294, pp. 307-321, Springer-Verlag, 1997.
15. U. M. Maurer and S. Wolf, Secret-key agreement over unauthenticated public channels - Part I: Definitions and a completeness result, IEEE Trans. on Information Theory, Vol. 49, No. 4, pp. 822-831, 2003.
16. U. M. Maurer and S. Wolf, Secret-key agreement over unauthenticated public channels - Part II: The simulatability condition, IEEE Trans. on Information Theory, Vol. 49, No. 4, pp. 832-838, 2003.
17. U. M. Maurer and S. Wolf, Secret-key agreement over unauthenticated public channels - Part III: Privacy amplification, IEEE Trans. on Information Theory, Vol. 49, No. 4, pp. 839-851, 2003.
18. J. L. McInnes and B. Pinkas, On the impossibility of private key cryptography with weakly random keys, Advances in Cryptology - CRYPTO '90, LNCS, Vol. 537, pp. 421-436, Springer-Verlag, 1990.
19. R. Raz, O. Reingold, and S. Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, Proceedings of STOC '99, pp. 149-158, 1999.
20. R. Raz, O. Reingold, and S. Vadhan, Error reduction for extractors, Proceedings of FOCS '99, pp. 191-201, 1999.
21. A. Russell and H. Wang, How to fool an unbounded adversary with a short key, Advances in Cryptology - EUROCRYPT 2002, LNCS, Vol. 2332, pp. 133-148, . Springer-Verlag, 2002.
22. C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, pp. 656-715, 1949.
23. D. R. Stinson, Universal hashing and authentication codes, Advances in Cryptology - CRYPTO '91, LNCS, Vol. 576, pp. 74-85, Springer-Verlag, 1992.
24. S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, LNCS, Vol. 1514, pp. 405-419, Springer-Verlag, 1998.
25. S. Wolf, Information-theoretically and computationally secure key agreement in cryptography, ETH dissertation No. 13138, ETH Zürich, 1999.
26. A. D. Wyner, The wire-tap channel, Bell System Technical Journal, Vol. 54, No. 8, pp. 1355-1387, 1975.