Information-theoretic cryptography

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

Volumn 1666, Issue , 1999, Pages 47-65

  Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Conditional in dependence; Generalized random oracle; Information theory; Information theoretic primitive; Unconditional security

Indexed keywords

COMPUTATION THEORY; INFORMATION THEORY;

COMPUTATIONAL SECURITY; CRYPTOGRAPHIC PRIMITIVES; INFORMATION-THEORETIC CRYPTOGRAPHY; INFORMATION-THEORETIC PRIMITIVE; MULTIPARTY COMPUTATION; RANDOM ORACLE; UNCONDITIONAL SECURITY; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 84957050617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_4     Document Type: Conference Paper

References (48)

1. M. Bellare, J. Kilian, and P. Rogaway, The security of the cipher block chaining message authentication code, Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, vol. 839, Springer-Verlag, 1995.
2. M. Bellare, J. Guérin, and P. Rogaway, The security of the cipher block chaining message authentication code, Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, vol. 963, Springer-Verlag, 1994.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp 10, 1988.
4. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, Experimental quantum cryptography, Journal of Cryptology, vol. 5, no. 1, pp 3-28, Springer-Verlag, 1992.
5. C.H. Bennett, G. Brassard, C. Crépeau, and U.M. Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory, vol. 41, no. 6, pp 1915-1923, 1995.
6. C.H. Bennett, G. Brassard, and J.-M. Robert, Privacy amplification by public discussion, SIAM Journal on Computing, vol. 17, pp 210-229, 1988.
7. R. E. Blahut, Principles and practice of information theory, Addison-Wesley Publishing Company, 1988.
8. G. Brassard and C. Crépeau, Oblivious transfer and privacy amplification, Advances in Cryptology - EUROCRYPT '97, Lecture Notes in Computer Science, vol. 1233, pp 334-345, Springer-Verlag, 1997.
9. C. Cachin, Entropy measures and unconditional security in cryptography, Ph. D. Thesis, ETH Zürich, Hartung-Gorre Verlag, Konstanz, 1997.
10. C. Cachin, On the foundation of oblivious transfer, Advances in Cryptology - EURO-CRYPT '98, Lecture Notes in Computer Science, vol. 1403, pp 361-374, Springer-Verlag, 1998.
11. C. Cachin and U.M. Maurer, Unconditional security against memory-bounded adversaries, Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science, vol. 1294, pp 292-306, Springer-Verlag, 1997.
12. D. Chaum, C. Crépeau, and I. Damgård, Multiparty unconditionally secure protocols, In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 11-19, 1988.
13. T. M. Cover and J.A. Thomas, Elements of information theory, Wiley Series in Telecommunications, 1992.
14. C. Crépeau, Equivalence between two flavours of oblivious transfer, Advances in Cryptology - CRYPTO '87, Lecture Notes in Computer Science, pp 350-354, Springer-Verlag, 1988.
15. C. Crépeau, Efficient cryptographic protocols based on noisy channels, Advances in Cryptology - EUROCRYPT '97, Lecture Notes in Computer Science, vol. 1233, pp 306-317, Springer-Verlag, 1997.
16. C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions, 29th Symposium on Foundations of Computer Science, pp 42-52, IEEE, 1988.
17. I. Csiszár and J. Körner, Broadcast channels with con_dential messages, IEEE Transactions on Information Theory, vol. IT-24, pp 339-348, 1978.
18. I. Damgård, J. Kilian, and L. Salvail, On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions, Advances in Cryptology - EUROCRYPT '99, Lecture Notes in Computer Science, vol. 1592, pp 56-73, Springer-Verlag, 1999.
19. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol. 22, no. 6, pp 644-654, 1976.
20. Y. Dodis and S. Micali, Lower bounds for oblivious transfer reductions, Advances in Cryptology - EUROCRYPT '99, Lecture Notes in Computer Science, vol. 1592, pp 42-55, Springer-Verlag, 1999.
21. W. Feller, An introduction to probability theory and its applications, 3rd edition, vol. 1, Wiley International, 1968.
22. M. J. Fischer and R. N. Wright, Bounds on secret key exchange using a random deal of cards, Journal of Cryptology, vol. 9, no. 2, pp 71-99, Springer-Verlag, 1996.
23. P. Gemmell and M. Naor, Codes for interactive authentication, Advances in Cryptology - CRYPTO '93, Lecture Notes in Computer Science, vol. 773, pp 355-367, Springer-Verlag, 1993.
24. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell Syst. Tech. J., vol. 53, No. 3, 1974, pp 405-424.
25. O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol. 33, no. 4, pp 210-217, 1986.
26. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on the Theory of Computing (STOC), pp 218-229, 1987.
27. J. H_astad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudorandom generator from any one-way function, Technical Report no. 91-068, ICSI, Berkeley, CA, 1991.
28. L. Lamport, R. Shostak, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, vol. 4, pp 382-401, 1982.
29. M. Luby and C. Racko_, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, no. 2, pp 373-386, 1988.
30. U. M. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, Journal of Cryptology, vol. 5, pp. 53-66, Springer-Verlag, 1992.
31. U. M. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudo-random permutation generators, Advances in Cryptology - EUROCRYPT '92, Lecture Notes in Computer Science, vol. 658, pp 239-255, Springer-Verlag, 1992.
32. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Transactions on Information Theory, vol. 39, no. 3, pp 733-742, 1993.
33. U. M. Maurer, A unified and generalized treatment of authentication theory, Proceedings 13th Symp. on Theoretical Aspects of Computer Science - STACS '96, Lecture Notes in Computer Science, vol. 1046, pp 387-398, Springer-Verlag, 1996.
34. U. M. Maurer, Information-theoretically secure secret-key agreement by NOT authenticated public discussion, Advances in Cryptology - EUROCRYPT '97, Lecture Notes in Computer Science, vol. 1233, pp 209-225, Springer-Verlag, 1997.
35. U. M. Maurer and S. Wolf, Unconditionally secure key agreement and the intrinsic conditional information, IEEE Transactions on Information Theory, vol. 45, no. 2, pp 499-514, 1999.
36. M. Naor and O. Reingold, On the construction of pseudorandom permutations: Luby-Rackoff revisited, Journal of Cryptology, vol. 12, no. 1, pp 29-66, 1999.
37. M.O. Rabin, personal communication, 1998.
38. T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st ACM Symposium on the Theory of Computing (STOC), pp 73-85, 1989.
39. C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, vol. 28, pp 656-715, 1949.
40. C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal, vol. 27, pp 379-423 and 623-656, 1948.
41. G. J. Simmons, A survey of information authentication, Proceedings of the IEEE, vol. 76, pp 603-620, 1988.
42. D. R. Stinson, Universal hashing and authentication codes, Advances in Cryptology - CRYPTO '91, Lecture Notes in Computer Science, vol. 576, pp 74-85, Springer-Verlag, 1992.
43. G. S. Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communications, Journal of the American Institute for Electrical Engineers, vol. 55, pp 109-115, 1926.
44. M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences, vol. 22, pp 265-279, 1981.
45. S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement, Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, vol. 1514, pp 405-419, Springer-Verlag, 1998.
46. S. Wolf, Unconditional security in cryptography, Proceedings of Summer School in Cryptology and Data Security, July 1998, Aarhus, Denmark, Lecture Notes in Computer Science, vol. 1561, pp 217-250, Springer-Verlag, 1999.
47. S. Wolf, Information-theoretically and unconditionally secure key agreement in cryptography, Ph.D. Thesis no. 13138, ETH Zurich, 1999.
48. A. D. Wyner, The wire-tap channel, Bell System Technical Journal, vol. 54, no. 8, pp 1355-1387, 1975.