Abstract
Secure checkpointing appears to be a useful technique for designing survivable systems. These are fault-tolerant systems that are robust against malicious security attacks. Secure checkpointing, however, is not easily done. Without adequate protection, the checkpointing process can be attacked and compromised. The checkpointing data can be subjected to malicious attacks and be a source of security breach. In this paper, we present a new secure checkpointing scheme that is robust against malicious attacks. Our approach uses strong cryptographic techniques for data confidentiality and integrity, Byzantine agreement protocols for compromised peer detection and information dispersal techniques for reliability and availability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Feldman, S.I., Brown, C.B.: Igor: A system for program debugging via reversible execution. ACM SIGPLAB Notices, Workshop on Parallel and Distributed Debugging 24(1) (January 1989)
Plank, J., Xu, J., Netzer, R.: Compressed differences: An algorithm for fast incremental checkpointing. Technical Report CS-95-302, University of Tennessee (August 1995)
Nam, H., Kim, J., Hong, S.J., Lee, S.: Probabilistic checkpointing. In: Proceedings of the 27th International Symposium on Fault-Tolerant Computing, Seattle, WA (June 1997)
Elnozahy, E.N.: How safe is probabilistic checkpointing? In: Proceedings of the 28th International Symposium on Fault-Tolerant Computing, Munich, Germany (June 1998)
Rabin, M.: Fingerprinting by random polynomials. Technical Report TR-15-81. Center for Research in Computing Technology. Harvard University, Cambridge, MA (1981)
Rabin, M.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM 36(2) (April 1989)
Nam, H., Kim, J., Hong, S.J., Lee, S.: Secure checkpointing. In: Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing, Seoul, Korea (December 2001)
Ray, I., Ray, I., Narasimhamurthi, N.: A fair exchange e-commerce protocol with automated dispute resolution. In: Proceedings of the 14th Annual IFIP WG 11.3 Working Conference on Database Security, Schoorl, The Netherlands (August 2000)
Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Byzantine Fault Detectors for Solving consensus. The Computer Journal 46(1) (2003)
Lamport, L., et al.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3) (July 1982)
Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2) (March 1996)
Malkhi, D., Reiter, D.M.: Unreliable intrusion detection in distributed computations. In: Proceedings of the 10th Computer Security Foundations Workshop, Rockport, MA (June 1997)
Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, IL (May 1988)
Steiner, M., Tsudik, G., Waidner, M.: CLIQUES: A new approach to group key agreement. In: Proceedings of the 18th International Conference on Distributed Computing Systems, Amsterdam, The Netherlands (May 1998)
Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, Athens, Greece (November 2000)
Plack, J.S., Li, K., Puening, M.A.: Diskless checkpointing. IEEE Transaction on Parallel and Distributed System 9(10) (October 1998)
Plank, J.S., Beck, M., Kingsley, G., Li, K.: Libckpt: Transparent checkpointing under Unix. In: Proceedings of the USENIX Winter 1995 Technical Conference, New Orleans (January 1995)
Fisher, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2) (April 1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kambhampati, V., Ray, I., Kim, E. (2004). A Secure Checkpointing Protocol for Survivable Server Design. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-30555-2_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24075-4
Online ISBN: 978-3-540-30555-2
eBook Packages: Computer ScienceComputer Science (R0)