Key Insulation and Intrusion Resilience over a Public Channel
- 858 Downloads
Key insulation (KI) and Intrusion resilience (IR) are methods to protect a user’s key against exposure by utilizing periodic communications with an auxiliary helper. But existing work assumes a secure channel between user and helper. If we want to realize KI or IR in practice we must realize this secure channel. This paper looks at the question of how to do this when the communication is over what we are more likely to have in practice, namely a public channel such as the Internet or a wireless network. We explain why this problem is not trivial, introduce models and definitions that capture the desired security in a public channel setting, and provide a complete (and surprising) answer to the question of when KI and IR are possible over a public channel. The information we provide is important to guide practitioners with regard to the usage of KI and IR and also to guide future research in this area.
KeywordsSignature Scheme Active Attack Secure Channel Public Channel Interactive Algorithm
Unable to display preview. Download preview PDF.
- 1.Anderson, R.: Two Remarks on Public-Key Cryptology. In: 2000, and Invited Lecture at the Fourth Annual Conference on Computer and Communications Security, Zurich, Switzerland (April 1997) (manuscript)Google Scholar
- 3.Bellare, M., Duan, S., Palacio, A.: Key Insulation and Intrusion Resilience Over a Public Channel. IACR Eprint Archive (2009)Google Scholar
- 8.Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proceedings of the 30th Annual Symposium on the Theory of Computing. ACM, New York (1998)Google Scholar
- 9.Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi- Party Computation. In: Proceedings of the 28th Annual Symposium on the Theory of Computing. ACM, New York (1996)Google Scholar
- 10.Canetti, R., Halevi, S., Katz, J.: A Forward-Secure Public-Key Encryption Scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656. Springer, Heidelberg (2003)Google Scholar
- 17.Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.: Magic Functions. In: Proceedings of the 40th Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1999)Google Scholar