skip to main content
research-article

Formal definitions and complexity results for trust relations and trust domains fit for TTPs, the web of trust, PKIs, and ID-based cryptography

Published:01 March 2010Publication History
Skip Abstract Section

Abstract

We propose computational, declarative definitions of the concepts of weak and strong trust relations between interacting agents, and trust domains of trust-related agents in distributed systems. Our definitions yield computational complexity results for deciding potential and actual trust relationships and membership in trust domains. We instantiate our trust concepts in four major applications of trust, namely: Trusted Third Parties (TTPs), the Web of Trust, Public-Key Infrastructures (PKIs), and Identity-Based Cryptography. Finally, we point out computational means for building trust, and by that, building up trust relations and trust domains. Our defining principle for weak and strong trust is (common) belief in and knowledge of agent correctness, respectively

References

  1. Cloud computing. http://csrc.nist.gov/groups/SNS/cloud-computing/index.html.Google ScholarGoogle Scholar
  2. R. Anderson. Security Engineering: A Guide to Building Dependable Distributed Systems. Wiley, second edition, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Areces and B. ten Cate. Handbook of Modal Logic, chapter Hybrid Logics. Volume 3 of Blackburn et al. {5}, 2007.Google ScholarGoogle Scholar
  4. P. Blackburn and J. van Benthem. Handbook of Modal Logic, chapter Modal Logic: A Semantic Perspective. Volume 3 of Blackburn et al. {5}, 2007.Google ScholarGoogle Scholar
  5. P. Blackburn, J. van Benthem, and F. Wolter, editors. Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning. Elsevier, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Boyd and A. Mathuria. Protocols for Authentication and Key Establishment. Springer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Bradfield and C. Stirling. Handbook of Modal Logic, chapter Modal Mu-Calculi. Volume 3 of Blackburn et al. {5}, 2007.Google ScholarGoogle Scholar
  8. M. Carbone, M. Nielsen, and V. Sassone. A formal model for trust in dynamic networks. In Proceedings of the Conference on Software Engineering and Formal Methods, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Carbone, M. Nielsen, and V. Sassone. A calculus for trust management. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, volume 3328 of LNCS. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990 (2002).Google ScholarGoogle ScholarCross RefCross Ref
  11. R. Demolombe. Reasoning about trust: A formal logical framework. In Proceedings of the Conference on Trust Management, volume 2995 of LNCS. Springer, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(12), 1983.Google ScholarGoogle Scholar
  13. R. Fagin, J.Y. Halpern, Y. Moses, and M.Y. Vardi. Reasoning about Knowledge. MIT Press, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J.D. Guttman, F.J. Thayer, J.C. Carlson, J.C. Herzog, J.D. Ramsdell, and B.T. Sniffen. Trust management in strand spaces: A rely-guarantee method. In Proceedings of the European Symposium on Programming, volume 2986 of LNCS. Springer, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  15. J.Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3), 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J.Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3), 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J.Y. Halpern and Y. Moses. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(2), 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Huang and M.S. Fox. An ontology of trust -- formal semantics and transitivity. In Proceedings of the Conference on Electronic Commerce. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Huang and D. Nicol. A calculus of trust and its application to PKI and identity management. In Proceedings of the Symposium on Identity and Trust on the Internet. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Joye and G. Neven. Identity-Based Cryptography. IOS Press, 2009.Google ScholarGoogle Scholar
  21. L.M. Kaufman. Data security in the world of cloud computing. IEEE Security & Privacy, 7(4), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. K. Krukowa and A. Twigg. The complexity of fixed point models of trust in distributed networks. Theoretical Computer Science, 389(3), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Ch.-J. Liau. Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation. Artificial Intelligence, 149(1), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. F. Martinelli and M. Petrocchi. A uniform framework for security and trust modeling and analysis with Crypto-CCS. Electronic Notes in Theoretical Computer Science, 186, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. J.-J. Meyer and F. Veltnam. Handbook of Modal Logic, chapter Intelligent Agents and Common Sense Reasoning. Volume 3 of Blackburn et al. {5}, 2007.Google ScholarGoogle Scholar
  27. B. Michael. In clouds shall we trust? IEEE Security & Privacy, 7(5), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. M. Nielsen, K. Krukow, and V. Sassone. A Bayesian model for event-based trust. Electronic Notes in Theoretical Computer Science, 172, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. R. Parikh. Social software. Synthese, 132, 2002.Google ScholarGoogle Scholar
  30. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1), 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. P.V. Rangan. An axiomatic basis of trust in distributed systems. In Proceedings of the IEEE Symposium on Security and Privacy, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  32. S. Ruohomaa and L. Kutvonen. Trust management survey. In Proceedings of the Conference on Trust Management, volume 3477 of LNCS. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. A. Jøsang, R. Ismail, and C. Boyd. A survey of trust and reputation systems for online service provision. Decision Support Systems, 43(2), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. B. Schneier. Security, group size, and the human brain. IEEE Security & Privacy, 7(4), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. H.C.A. van Tilborg, editor. Encyclopedia of Cryptography and Security, pages 398--400. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. D. Xiu and Z. Liu. A formal definition for trust in distributed systems. In Proceedings of the Information Security Conference, volume 3650 of LNCS. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. A. Yao. Protocols for secure computations. In Proceedings of the IEEE Symposium on Foundations of Computer Science, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. H. Yu, Ch. Jin, and H. Che. A description logic for PKI trust domain modeling. In Proceedings of the Conference on Information Technology and Applications. IEEE Computer Society, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. W. Zhao, V. Varadharajan, and G. Bryan. Analysis and modelling of trust in distributed information systems. In Proceedings of the Conference on Information Systems Security, volume 3803 of LNCS. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Philip Zimmermann. http://www.philzimmermann.com/.Google ScholarGoogle Scholar

Index Terms

(auto-classified)
  1. Formal definitions and complexity results for trust relations and trust domains fit for TTPs, the web of trust, PKIs, and ID-based cryptography

    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

    • Published in

      cover image ACM SIGACT News
      ACM SIGACT News  Volume 41, Issue 1
      March 2010
      127 pages
      ISSN:0163-5700
      DOI:10.1145/1753171
      Issue’s Table of Contents

      Copyright © 2010 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 2010

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader