Skip to main content
SpringerLink
Log in

Towards fault-tolerant and secure agentry

  • Keynote Lectures
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1320))

Included in the following conference series:

Abstract

Processes that roam a network-agents-present new technical challenges. Two are discussed here. The first problem, which arises in connection with implementing fault-tolerant agents, concerns how a voter authenticates the agents comprising its electorate. The second is to characterize security policies that are enforceable as well as approaches for enforcing those policies.

Supported in part by ARPA/RADC grant F30602-96-1-0317, NASA/ARPA grant NAG-2-893, and AFOSR grant F49620-94-1-0198. The views and conclusions contained herein are those of the author and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of these organizations or the U.S. Government.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, B. and F.B. Schneider. Defining liveness. Information Processing Letters 21, 4 (Oct. 1985), 181–185.

    Article  Google Scholar 

  2. Alpern, B. and F.B. Schneider. Recognizing safety and liveness. Distributed Computing 2 (1987), 117–126.

    Article  Google Scholar 

  3. Bell, D.E. and L.J. La Padula. Secure computer systems: Mathematical foundations. Technical Report ESD-TR-73-278, Hanscom AFB, Bedford, Mass., Nov. 1973.

    Google Scholar 

  4. Ben-Or, M., S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. ACM Symposium on Theory of Computing, 1988, 1–10.

    Google Scholar 

  5. Hopcroft, J. and J. Ullman. Formal Languages and Their Relation to Automata. Addison Wesley Publishing Company, Reading, Mass., 1969.

    Google Scholar 

  6. Jarecki, S. Proactive Secret Sharing and Public Key Cryptosystems. Master's thesis, MIT, Sept. 1995.

    Google Scholar 

  7. Lamport, L. Logical Foundation. In Distributed Systems-Methods and Tools for Specification, Lecture Notes in Computer Science, Vol 190. M. Paul and H.J. Siegert, eds. (1985), Springer-Verlag, New York.

    Google Scholar 

  8. Lampson, B. Protection. Proceedings 5th Symposium on Information Sciences and Systems (Princeton, New Jersey, March 1971), 437–443. Reprinted in Operating System Review 8, 1 (Jan. 1974), 18–24.

    Google Scholar 

  9. McLean, J. A general theory of composition for trace sets closed under selective interleaving functions. Proceedings 1994 IEEE Computer Society Symposium on Research in Security and Privacy (Oakland, Calif., May 1994), IEEE Computer Society, Calif., 79–93.

    Google Scholar 

  10. Minsky, Y., R. van Renesse, F.B. Schneider, and S.D. Stoller. Cryptographic support for fault-tolerant distributed computing. Proc. of the Seventh ACM SIGOPS European Workshop “System Support for Worldwide Applications” (Connemara, Ireland, Sept. 1996), ACM, New York, 109–114.

    Google Scholar 

  11. Minsky, Y. and F.B. Schneider. Agents with Integrity: Tolerating Malicious Hosts. In preparation.

    Google Scholar 

  12. Morrisett, G., D. Walker, and K. Crary. From ML to typed assembly language. In preparation.

    Google Scholar 

  13. Necula, G. Proof-carrying code. Proceedings of the 24th Annual Symposium on Principles of Programming Languages (Paris, France, Jan. 1997), ACM, New York, 106–119.

    Google Scholar 

  14. Schneider, F.B. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22, 4 (Dec. 1990), 299–319.

    Article  Google Scholar 

  15. Shamir, A. How to share a secret. CALM 22, 11 (Nov. 1979), 612–613.

    Google Scholar 

  16. Siewiorek, D.P. and R.S. Swarz. The Theory and Practice of Reliable System Design. Digital Press, Bedford, Mass. 1982.

    Google Scholar 

  17. Wahbe, R., S. Lucco, T.E. Anderson, and S. L. Graham. Efficient Software-Based Fault Isolation. Proceeding of the Fourteenth ACM Symposium on Operating Systems Principles (Asheville, North Carolina, Dec. 1993), ACM, New York, 202–216.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, New York, USA

    Fred B. Schneider

Authors
  1. Fred B. Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marios Mavronicolas Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, F.B. (1997). Towards fault-tolerant and secure agentry. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030670

Download citation

  • DOI: https://doi.org/10.1007/BFb0030670

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63575-8

  • Online ISBN: 978-3-540-69600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation