Skip to main content
SpringerLink
Log in

Implementing Trustworthy Services Using Replicated State Machines

  • Chapter
Replication

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5959))

Abstract

A thread of research has emerged to investigate the interactions of replication with threshold cryptography for use in environments that satisfy weak assumptions. The result is a new paradigm known as distributed trust, and this chapter attempts to survey that landscape.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barak, B., Herzberg, A., Naor, D., Shai, E.: The proactive security toolkit and applications. In: Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS’99), November 1999, pp. 18–27. ACM SIGSAC (1999)

    Google Scholar 

  2. Blakley, G.: Safeguarding cryptographic keys. In: Merwin, R., Zanca, J., Smith, M. (eds.) Proceedings of the 1979 National Computer Conference. AFIPS Conference Proceedings, vol. 48, pp. 313–317. AFIPS Press, New York (1979)

    Google Scholar 

  3. Boyd, C.: Digital multisignatures. In: Baker, H., Piper, F. (eds.) Cryptography and Coding, pp. 241–246. Clarendon Press, Oxford (1989)

    Google Scholar 

  4. Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, November 2002, pp. 88–97. ACM Press, New York (2002)

    Google Scholar 

  5. Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), July 2000, pp. 123–132. ACM Press, New York (2000)

    Google Scholar 

  6. Cachin, C., Poritz, J.A.: Secure intrusion-tolerant replication on the Internet. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN-2002), June 2002, pp. 167–176. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  7. Canetti, R., Herzberg, A.: Maintaining security in the presence of transient faults. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 425–438. Springer, Heidelberg (1994)

    Google Scholar 

  8. Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems 20(4), 398–461 (2002)

    Article  Google Scholar 

  9. Chockler, G., Malkhi, D., Reiter, M.K.: Backoff protocols for distributed mutual exclusion and ordering. In: Proceedings of the International Conference on Distributed Systems, pp. 11–20. IEEE Computer Society Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  10. Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)

    Google Scholar 

  11. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Forrest, S., Somayaji, A., Ackley, D.: Building diverse computer systems. In: Proceedings of the Sixth Workshop on Hot Topics in Operating Systems, Cape Cod, MA, May 1997, pp. 67–72. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  13. Garay, J.A., Gennaro, R., Jutla, C., Rabin, T.: Secure distributed storage and retrieval. Theoretical Computer Science 243(1–2), 363–389 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the 19th Annual Conference on Theory of Computing, STOC’87, May 25–27, 1987, pp. 218–229. ACM Press, New York (1987)

    Google Scholar 

  15. Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)

    Google Scholar 

  16. Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology 13(1), 31–60 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jakobsson, M.: On quorum controlled asymmetric proxy re-encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 112–121. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Knight, J., Leveson, N.G.: An experimental evaluation of the assumption of independence in multi-version programming. IEEE Transactions on Software Engineering 12(1), 96–109 (1986)

    Article  Google Scholar 

  19. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  20. Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems 16(2), 133–169 (1998)

    Article  Google Scholar 

  21. Liskov, B., Ladin, R.: Highly available distributed services and fault-tolerant distributed garbage collection. In: Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 1986, pp. 29–39. ACM Press, New York (1986)

    Chapter  Google Scholar 

  22. Malkhi, D., Reiter, M.: Byzantine quorum system. Distributed Computing 11(4), 203–213 (1998)

    Article  MATH  Google Scholar 

  23. Malkhi, D., Reiter, M.: Secure and scalable replication in Phalanx. In: Proceedings of the 17th Symposium on Reliable Distributed Systems, West Lafayette, IN, USA, October 20–22, 1998, pp. 51–58. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  24. Marsh, M.A., Schneider, F.B.: CODEX: A robust and secure secret distribution system. IEEE Transactions on Dependable and Secure Computing 1(1), 34–47 (2003)

    Article  Google Scholar 

  25. Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proceedings of the 10th Annual Symposium on Principles of Distributed Computing (PODC’91), Montreal, Quebec, Canada, August 19–21, 1991, pp. 51–59. ACM, New York (1991)

    Google Scholar 

  26. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  27. Reiter, M.K.: Distributing trust with the Rampart toolkit. Communications of the ACM 39(4), 71–74 (1996)

    Article  Google Scholar 

  28. Rodrigues, R., Castro, M., Liskov, B.: BASE: using abstraction to improve fault tolerance. In: Proceedings of the 18th ACM Symposium on Operating System Principles, Banff, Canada, October 2001, pp. 15–28. ACM, New York (2001)

    Google Scholar 

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

    Article  Google Scholar 

  30. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  31. Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE Symposium Security and Privacy, Oakland, CA USA, May 2000, pp. 44–45. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  32. Wu, T., Malkin, M., Boneh, D.: Building intrusion tolerant applications. In: Proceedings of the 8th USENIX Security Symposium, Washington, D.C. USA, August 22–26, 1999, pp. 79–91. USENIX Association (1999)

    Google Scholar 

  33. Wylie, J.J., Bigrigg, M.W., Strunk, J.D., Ganger, G.R., Kiliççöte, H., Khosla, P.K.: Survivable information storage systems. IEEE Computer 33(8), 61–68 (2000)

    Article  Google Scholar 

  34. Xu, J., Kalbarczyk, Z., Iyer, R.K.: Transparent runtime randomization for security. Tech. Rep. UILU-ENG-03-2207 (CRHC-03-03), Center for Reliable and High-Performance Computing, University of Illinois at Urbana-Champaign, Urbana-Champaign, IL (May 2003)

    Google Scholar 

  35. Zhou, L., Marsh, M.A., Schneider, F.B., Redz, A.: Distributed blinding for distributed ElGamal re-encryption. In: Proceedings of the 25th International Conference on Distributed Computing Systems, Columbus, Ohio, USA, June 2005, pp. 814–824. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  36. Zhou, L., Schneider, F.B., van Renesse, R.: COCA: A secure distributed on-line certification authority. ACM Transactions on Computer Systems 20(4), 329–368 (2002)

    Article  Google Scholar 

  37. Zhou, L., Schneider, F.B., van Renesse, R.: APSS: Proactive secret sharing in asynchronous systems. ACM Trans. on Information and Sytem Security 8(3) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, USA

    Fred B. Schneider

  2. Microsoft Research Asia, China

    Lidong Zhou

Authors
  1. Fred B. Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidong Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  2. Facoltà di scienze informatiche, Università della Svizzera italiana (USI), Via Giuseppe Buffi 6, 6900, Lugano, Switzerland

    Fernando Pedone

  3. School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Station 14, 1015, Lausanne, Switzerland

    André Schiper

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schneider, F.B., Zhou, L. (2005). Implementing Trustworthy Services Using Replicated State Machines. In: Charron-Bost, B., Pedone, F., Schiper, A. (eds) Replication. Lecture Notes in Computer Science, vol 5959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11294-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11294-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11293-5

  • Online ISBN: 978-3-642-11294-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation