Up:Contents Previous:Conclusions

Bibliography

1
M. Bellare and D. Micciancio.
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost. In Advances in Cryptology - EUROCRYPT, 1997.
2
J. Black et al.
UMAC: Fast and Secure Message Authentication. In Advances in Cryptology - CRYPTO, 1999.
3
R. Canetti, S. Halevi, and A. Herzberg.
Maintaining Authenticated Communication in the Presence of Break-ins. In ACM Conference on Computers and Communication Security, 1997.
4
M. Castro.
Practical Byzantine Faul Tolerance. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 2000. In preparation.
5
M. Castro and B. Liskov.
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm. Technical Memo MIT/LCS/TM-590, MIT Laboratory for Computer Science, 1999.
6
M. Castro and B. Liskov.
Practical Byzantine Fault Tolerance. In USENIX Symposium on Operating Systems Design and Implementation, 1999.
7
C. Collberg and C. Thomborson.
Watermarking, Tamper-Proofing, and Obfuscation - Tools for Software Protection. Technical Report 2000-03, University of Arizona, 2000.
8
S. Floyd et al.
A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing. IEEE/ACM Transactions on Networking, 5(6), 1995.
9
S. Forrest et al.
Building Diverse Computer Systems. In Proceedings of the 6th Workshop on Hot Topics in Operating Systems, 1997.
10
J. Garay et al.
Secure Distributed Storage and Retrieval. Theoretical Computer Science, to appear.
11
L. Gong.
A Security Risk of Depending on Synchronized Clocks. Operating Systems Review, 26(1):49-53, 1992.
12
M. Herlihy and J. Wing.
Axioms for Concurrent Objects. In ACM Symposium on Principles of Programming Languages, 1987.
13
A. Herzberg et al.
Proactive Secret Sharing, Or: How To Cope With Perpetual Leakage. In Advances in Cryptology - CRYPTO, 1995.
14
A. Herzberg et al.
Proactive Public Key and Signature Systems. In ACM Conference on Computers and Communication Security, 1997.
15
J. Howard et al.
Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems, 6(1), 1988.
16
K. Kihlstrom, L. Moser, and P. Melliar-Smith.
The SecureRing Protocols for Securing Group Communication. In Hawaii International Conference on System Sciences, 1998.
17
L. Lamport.
Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7), 1978.
18
L. Lamport.
The Part-Time Parliament. Technical Report 49, DEC Systems Research Center, 1989.
19
B. Liskov et al.
Replication in the Harp File System. In ACM Symposium on Operating System Principles, 1991.
20
D. Malkhi and M. Reiter.
Secure and Scalable Replication in Phalanx. In IEEE Symposium on Reliable Distributed Systems, 1998.
21
D. Maziéres et al.
Separating Key Management from File System Security. In ACM Symposium on Operating System Principles, 1999.
22
Ron Minnich.
The Linux BIOS Home Page. http://www.acl.lanl.gov/linuxbios, 2000.
23
B. Oki and B. Liskov.
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems. In ACM Symposium on Principles of Distributed Computing, 1988.
24
R. Ostrovsky and M. Yung.
How to Withstand Mobile Virus Attacks. In ACM Symposium on Principles of Distributed Computing, 1991.
25
J. Ousterhout.
Why Aren't Operating Systems Getting Faster as Fast as Hardware? In USENIX Summer, 1990.
26
M. Reiter.
The Rampart Toolkit for Building High-Integrity Services. Theory and Practice in Distributed Systems (LNCS 938), 1995.
27
R. Rivest.
The MD5 Message-Digest Algorithm. Internet RFC-1321, 1992.
28
F. Schneider.
Implementing Fault-Tolerant Services Using The State Machine Approach: A Tutorial. ACM Computing Surveys, 22(4), 1990.

Miguel Castro and Barbara Liskov, "Proactive Recovery in a Byzantine-Fault-Tolerant System", in Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, USA, October 2000.