Secure Communication in an Unknown Network Using Certificates

We consider the problem of secure communication in a network with malicious (Byzantine) faults for which the trust graph, with vertices the processors and edges corresponding to certified public keys, is not known except possibly to the adversary. This scenario occurs in several models, as for example in survivability models in which the certifying authorities may be corrupted, or in networks which are being constructed in a decentralized way. We present a protocol that allows secure communication in this case, provided the trust graph is sufficiently connected.

[1]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[2]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[3]  Yvo Desmedt,et al.  Trust and security: A new look at the Byzantine generals problem , 1996, Network Threats.

[4]  Ueli Maurer,et al.  Modelling a Public-Key Infrastructure , 1996, ESORICS.

[5]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[6]  Ronald L. Rivest,et al.  SDSI - A Simple Distributed Security Infrastructure , 1996 .

[7]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[8]  Nathan Linial,et al.  Fault-Tolerant Computation in the Full Information Model , 1998, SIAM J. Comput..

[9]  Dieter Gollmann,et al.  Computer Security — ESORICS 94 , 1994, Lecture Notes in Computer Science.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Matthew K. Franklin,et al.  Secure Communication in Minimal Connectivity Models , 1998, Journal of Cryptology.

[12]  Elisa Bertino,et al.  Computer Security — ESORICS 96 , 1996, Lecture Notes in Computer Science.

[13]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[14]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[15]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[16]  Gerald J. Popek,et al.  Encryption and Secure Computer Networks , 1979, CSUR.

[17]  Philip R. Zimmermann,et al.  The official PGP user's guide , 1996 .

[18]  Kaisa Nyberg,et al.  Advances in Cryptology — EUROCRYPT'98 , 1998 .

[19]  Matthew K. Franklin,et al.  Secure hypergraphs: privacy from partial broadcast , 1995, STOC '95.

[20]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[21]  Thomas Beth,et al.  Valuation of Trust in Open Networks , 1994, ESORICS.

[22]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[23]  Yongge Wang,et al.  Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question , 1999, EUROCRYPT.

[24]  Yvo Desmedt,et al.  Secure communication in an unknown network with Byzantine faults , 1998 .

[25]  Michael K. Reiter,et al.  Path independence for authentication in large-scale systems , 1997, CCS '97.

[26]  Moti Yung,et al.  Perfectly secure message transmission , 1993, JACM.