ACM Home Page
Please provide us with feedback. Feedback
Proactive secure message transmission in asynchronous networks
Full text PdfPdf (1.07 MB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-second annual symposium on Principles of distributed computing table of contents
Boston, Massachusetts
Pages: 223 - 232  
Year of Publication: 2003
ISBN:1-58113-708-7
Authors
Michael Backes  IBM Research, Zurich Research Laboratory, Rüschlikon, Switzerland
Christian Cachin  IBM Research, Zurich Research Laboratory, Rüschlikon, Switzerland
Reto Strobl  IBM Research, Zurich Research Laboratory, Rüschlikon, Switzerland
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/872035.872069
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
 
5
R. Canetti, R. Gennaro, A. Herzberg, and D. Naor. Proactive security: Long-term protection against break-ins. RSA Laboratories' CryptoBytes, 3(1): 1--8, 1997.
 
6
R. Canetti, S. Halevi, and A. Herzberg. Maintaining authenticated communication in the presence of break-ins. Journal of Cryptology, 13(1):61--106, 2000.
 
7
M. Castro and B. Liskov. Proactive recovery in a Byzantine-fault-tolerant system. In Proc. Fourth Symp. Operating Systems Design and Implementation (OSDI), pages 273--287, 2000.
 
8
Y. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449--457, 1994.
 
9
 
10
11
 
12
 
13
IBM PCI 4758 cryptographic coprocessor. http://www-3.ibm.com/security/cryptocards/.
 
14
Java card technology. http://java.sun.com/products/javacard/.
15
 
16
 
17
 
18


Collaborative Colleagues:
Michael Backes: colleagues
Christian Cachin: colleagues
Reto Strobl: colleagues