Maintaining security in the presence of transient faults

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 839 LNCS, Issue , 1994, Pages 425-438

  Canetti, Ran ^a   Herzberg, Amir ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; RANDOM PROCESSES; VIRUSES;

PSEUDO-RANDOM NUMBERS; SIGN-ON; TRANSIENT FAULTS;

COMPUTER VIRUSES;

EID: 84984842401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_38     Document Type: Conference Paper

References (18)

1. Ray Bird, Inder Gopal, Amir Herzberg, Phil Janson, Shay Kutten, Refik Molva, and Moti Yung. A family of light-weight protocols for authentication and key distribution. Submitted to IEEE T. Networking, 1993.
2. Ray Bird, Inder Gopal, Amir Herzberg, Phil Janson, Shay Kutten, Refik Molva, and Moti Yung. Systematic design of a family of attack-resistant authentication protocols. IEEE Journal on Selected Areas in Communications, 11(5):679–693, June 1993. Special issue on Secure Communications. See also a different version in Crypto 91.
3. Steven M. Bellovin and Michael Merritt. Augmented encrypted key exchange: a password based protocol secure against dictionary attacks and password file compromise. In 1st ACM Conference on Computer and Communications Security, pages 244–250, November 1993.
4. Mihir Bellare and Phil Rogaway. Entity authentication and key distribution. In Advances in Cryptology: Proc. of Crypto 93, pages 232–249, August 1993.
5. Chee-Seng Chow and Amir Herzberg. A reconstructible proactive pseudorandomness protocol. Work in progress, June 1994.
6. M. Elchin and J. Rochlis. With microscope and tweezers: An analysis of the internet virus of november 1988. In IEEE Symp. on Security and Privacy, pages 326–343, 1989.
7. P. Feldman and S. Micali. Optimal algorithms for byzantine agreement. In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing, pages 148–161, May 1988.
8. Mat Franklin and Moti Yung. Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. In 34th Annual Symposium on Foundations of Computer Science, pages 670–679, November 1993.
9. Juan A. Garay. Reaching (and maintaining) agreement in the presence of mobile faults. To be presented in WDAG, 1994.
10. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. On the cryptographic applications of random functions. In Advances in Cryptology: Proc. of Crypto 84, pages 276–288, 1984.
11. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. J. ACM, 33(4):792–807, 1986. Extended abstract in FOCS84.
12. John Hästad, Russell Impagliazzo, Leonid Levin, and Mike Luby. Construction of pseudo-random generator from any one-way functions. Manuscript, see preliminary versions by Impagliazzo et al. in 21st STOC and Hästad in 22nd STOC, 1993.
13. Thomas A. Longstaff and Schultz E. Eugene. Beyond preliminary analysis of the wank and oilz worms: A case of study of malicious code. Computers and Security, 12(1):61–77, 1993.
14. S. P. Miller, C. Neuman, J. I. Schiller, and J. H. Saltzer. Kerberos authentication and authorization system. In Project Athena Technical Plan. Massachusetts Institute of Technology, July 1987.
15. R. H. Morris and K. Thompson. Unix password security. Comm. ACM, 22(11):594–597, November 1979.
16. Rafail Ostrovsky and Moti Yung. How to withstand mobile virus attacks. In Proceedings of the 10 th Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, pages 51–59, 1991.
17. R. Reischuk. A new solution to the byzantine generals problem. Information and Control, pages 23–42, 1985.
18. Cliff Stoll. How secure are computers in the u.s.a.? Computers and Security, 7(6):543–547, 1988