skip to main content
article

Controlled and cooperative updates of XML documents in byzantine and failure-prone distributed systems

Published:01 November 2006Publication History
Skip Abstract Section

Abstract

This paper proposes an infrastructure and related algorithms for the controlled and cooperative updates of XML documents. Key components of the proposed system are a set of XML-based languages for specifying access-control policies and the path that the document must follow during its update. Such path can be fully specified before the update process begins or can be dynamically modified by properly authorized subjects while being transmitted. Our approach is fully distributed in that each party involved in the process can verify the correctness of the operations performed until that point on the document without relying on a central authority. More importantly, the recovery procedure also does not need the participation of a central authority. Our approach is based on the use of some special control information that is transmitted together with the document and a suite of protocols. We formally specify the structure of such control information and the protocols. We also analyze security and complexity of the proposed protocols.

References

  1. Bertino, E., Castano, S., and Ferrari, E. 2001. On specifying security policies for web documents with an xml-based language. In Proceedings of the 1st ACM Symposium on Access Control Models and Technologies. Chantilly, VA. ACM Press, New York. 49--59. Google ScholarGoogle Scholar
  2. Bertino, E. and Ferrari, E. 2002. Secure and selective dissemination of xml documents. ACM Transactions on Information and System Security (TISSEC) 5, 3, 290--331. Google ScholarGoogle Scholar
  3. Bertino, E., Ferrari, E., and Mella, G. 2005. An approach to cooperative updates of xml documents in distributed systems. Journal of Computer Security 13, 2, 191--242. Google ScholarGoogle Scholar
  4. Kane, B., Su, H., and Rundensteiner, E. 2002. Consistently updating xml documents using incremental constraint check queries. In Proceedings of the 4th ACM CIKM International Workshop on Web Information and Data Management (WIDM'02). Virginia. ACM Press, New York. 1--8. Google ScholarGoogle Scholar
  5. Koglin, Y., Mella, G., Bertino, E., and Ferrari, E. 2005. An update protocol for xml documents in distributed and cooperative systems. In Proceedings of the 25th International Conference on Distributed Computing Systems. Ohio. ACM Press, New York. 49--59. Google ScholarGoogle Scholar
  6. Lamport, L., Shostak, R., and Pease, M. 1982. The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4, 3, 382--401. Google ScholarGoogle Scholar
  7. Lim, C., Park, S., and Son, S. 2003. Access control of xml documents considering update operations. In Proceedings of the ACM Workshop on XML Security. Virginia. ACM Press, New York. 49--59. Google ScholarGoogle Scholar
  8. Malkhi, D., Mansour, Y., and Reiter, M. K. 1999. On diffusing updates in a byzantine environment. In Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems. IEEE Computer Society, Lausanne, Switzerland. 134--143. Google ScholarGoogle Scholar
  9. Malkhi, D. and Reiter, M. K. 1997. Byzantine quorum systems. In Proceedings of the 29th ACM Symposium on Theory of Computing. El Paso, Texas. ACM Press, New York. 569--578. Google ScholarGoogle Scholar
  10. Malkhi, D., Reiter, M. K., Rodeh, O., and Sella, Y. 2001a. Efficient update diffusion in byzantine environments. In Proceedings of the 20th IEEE Symposium on Reliable Distributed Systems. New Orleans. IEEE Computer Society, Washington, DC. 90--98.Google ScholarGoogle Scholar
  11. Malkhi, D., Reiter, M. K., Wool, A., and Wright, R. N. 2001b. Probabilistic quorum systems. The Information and Computation Journal 170, 2, 184--206. Google ScholarGoogle Scholar
  12. Mella, G. 2004. Distributed and cooperative updates of xml documents. Ph.D. thesis, University of Milano, DICO Department, Milano, Italy. Available at: http://homes.dico.unimi.it/dbandsec/mellagiovanni.Google ScholarGoogle Scholar
  13. Pollmann, C. G. 2003. The xml security page. Availabe at: http://www.dcs.uni-siegen.de/geuer-pollmann/xml_security.html.Google ScholarGoogle Scholar
  14. Reiter, M. K. 1994. Secure agreement protocols: Reliable and atomic group multicast in rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security. Fairfax, Virginia. ACM Press, New York. 68--80. Google ScholarGoogle Scholar
  15. Reiter, M. K. 1996. A secure group membership protocol. IEEE Transactions on Software Engineering 22, 1, 31--42. Google ScholarGoogle Scholar
  16. Tatarinov, I., Ives, Z. G., Halevy, A. Y., and Weld, D. S. 2001. Updating xml. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. California. ACM Press, New York. 413--424. Google ScholarGoogle Scholar
  17. Thuraisingham, B., Gupta, A., Bertino, E., and Ferrari, E. 2002. Collaborative commerce and knowledge management. Knowledge and Process Management 9, 1, 43--53.Google ScholarGoogle Scholar
  18. Vitenberg, R., Keidar, I., Chockler, G., and Dolev, D. 1999. Group communication specifications: A comprehensive study. In Tech. report CS9931. Comp. Sci. Inst., The Hebrew University of Jerusalem and MIT Technical Report MIT-LCS-TR-790.Google ScholarGoogle Scholar
  19. W3C. 1999. XML Path Language (Xpath) 1.0. Availabe at: http://www.w3.org/TR/1999/REC-xpath-19991116.Google ScholarGoogle Scholar

Index Terms

  1. Controlled and cooperative updates of XML documents in byzantine and failure-prone distributed systems

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader