Advertisement

Designing secure communication protocols from trust specifications

  • Christos H. Papadimitriou
  • Venkat Rangan
  • Martha Sideri
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)

Abstract

In a very large distributed system, entities may trust and mistrust others with respect to communication security in arbitrarily complex ways. We formulate the problem of designing a secure communication protocol, given a network interconnection and a ternary relation which captures trust between the entities. We identify several important ways of synthesizing secure channels, and study the algorithmic problem of designing a secure communication protocol connecting the entities, given the connectivity of the network and the trust relationship between the nodes. We show that whether secure communication is possible can be decided easily in polynomial time. If we also require that channel synthesis proceed along unambiguous paths (in which case the protocol is defined on a spanning tree of the netowrk), we show that the design problem is NP-complete, and we give a linear-time algorithsibly grm for an interesting special case of the problem.

Keywords

Span Tree Secure Communication Duality Theorem Trust Relationship Network Design Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BLNS]
    A. D. Birrell, B. W. Lampson, R. M. Needham, M. D. Schroeder “A Global Authentication Service without Global Trust,” Proc. IEEE Symposium on Security and Privacy, 1986.Google Scholar
  2. [GJ]
    M. R. Garey and D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.Google Scholar
  3. [PS]
    C. H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.Google Scholar
  4. [Ra]
    V. Rangan “An Axiomatic Theory of Trust in Secure Communication Protocols,” J. of Computers and Security, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  • Venkat Rangan
    • 1
  • Martha Sideri
    • 2
  1. 1.University of California at San DiegoUSA
  2. 2.Athens University of Economics and BusinessUSA

Personalised recommendations