Proactive Secure Message Transmission in Asynchronous Networks

We study the problem of secure message transmission among a group of parties in an insecure asynchronous network, where an adversary may repeatedly break into some parties for transient periods of time. A solution for this task is needed for using proactive cryptosystems in wide-area networks with loose synchronization. Parties have access to a secure hardware device that stores some cryptographic keys, but can carry out only a very limited set of operations. We provide a formal model of the system using the framework for asynchronous reactive systems proposed by Pfitzmann and Waidner (Symposium on Security & Privacy, 2001), present a protocol for proactive message transmission, and prove it secure using the composability property of the framework.

By: Michael Backes, Christian Cachin and Reto Strobl

Published in: Proc. Twenty-second Annual Symp. on Principles of Distributed Computing Citation "PODC 2003," Boston, MA, July 13 - 16, 2003, 223-232, ACM, p.223-232 in 2003

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .