Unconditionally Secure Key Insulated Cryptosystems: Models, Bounds and Constructions

  • Authors:
  • Yumiko Hanaoka;Goichiro Hanaoka;Junji Shikata;Hideki Imai

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computer systems are constantly under attack and illegal access is a constant threat which makes security even more critical. A system can be broken into and secret information, e.g. decryption key, may be exposed. Very recently, a new framework for the protection against such key exposure problem was suggested and was called, key-insulated encryption (KIE). In this paper, we study key insulated cryptosystems without computational assumptions. First, we define the model of KIE in unconditional setting and show lower bounds on required memory sizes. Our bounds are all tight since our concrete construction of KIE achieves the bounds. In other words, this construction is optimal in terms of memory sizes of a user, a trusted device and a sender. We then, extend the concept of it further, and add an extra property so that any pair of users in the system can communicate with each other. We called the version with this added extension, dynamic and mutual key insulated encryption (DMKIE), and concrete implementations of DMKIE are also shown. Finally, we discuss the relationship among KIE, key predistribution schemes (KPS) and broadcast encryption schemes (BES), specifically, showing that DMKIE can be constructed from KPS or BES.