Marcus Brandenburger, Christian Cachin, et al.
ACM TOPS
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 in order to use 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.
Marcus Brandenburger, Christian Cachin, et al.
ACM TOPS
Alexander Shraer, Christian Cachin, et al.
CCS 2010
Christian Cachin, Jonathan A. Poritz
DSN 2002
Michael Backes, Birgit Pfitzmann, et al.
Int. J. Inf. Secur.