Information Theoretic Security Based on Bounded Observability

Under the condition that all users can observe a common object, each using an observation function independently chosen from the same limited set of observation functions, we show necessary and sufficient conditions for users to be able to generate secret keys by public discussion.

[1]  Ueli Maurer,et al.  Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.

[2]  Jun Muramatsu,et al.  Secret Key Capacity and Advantage Distillation Capacity , 2006, 2006 IEEE International Symposium on Information Theory.

[3]  Burton S. Kaliski.  Advances in Cryptology - CRYPTO '97 , 1997 .

[4]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[5]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[6]  Yonatan Aumann,et al.  Everlasting security in the bounded storage model , 2002, IEEE Trans. Inf. Theory.

[7]  Ueli Maurer,et al.  Unconditionally Secure Key Agreement and the Intrinsic Conditional Information , 1999, IEEE Trans. Inf. Theory.

[8]  Jun Muramatsu,et al.  Secret Key Capacity and Advantage Distillation Capacity , 2006, ISIT.

[9]  Ueli Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.