Information Theoretic Security Based on Bounded Observability

1. Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory IT-39(3), 733–742 (1993)

   Article  MathSciNet  Google Scholar 

2. Chachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292–306. Springer, Heidelberg (1997)

   Google Scholar 

3. Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory IT-48(6), 1668–1680 (2002)

   Article  MathSciNet  Google Scholar 

4. Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers Systems and Signal Processing, Bangalore, India, pp. 175–179 (1984)

   Google Scholar 

5. Maurer, U.M., Wolf, S.: Unconditionally secure key agreement and the intrinsic conditional information. IEEE Transactions on Information Theory IT-45(2), 499–514 (1999)

   Article  MathSciNet  Google Scholar 

6. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)

   MATH  Google Scholar 

7. Bennett, C.H., Brassard, G., Crepeau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Transactions on Information Theory IT-41(6), 1915–1923 (1995)

   Article  MathSciNet  Google Scholar 

8. Muramatsu, J., Yoshimura, K., Davis, P.: Secret key capacity and advantage distillation capacity. IEICE Transactions on Fundamentals E89-A(10), 2589–2596 (2006)

   Article  Google Scholar 

Download references