Name
Abstract | ||
|---|---|---|
Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. A key sharing graph is one in which each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players corresponding to the ends of the edge. Given a key sharing graph, a player wishes to send a message to another player so that the eavesdropper Eve and any other player can get no information on the message. In this paper, we give a necessary and sufficient condition on a key sharing graph for the existence of a protocol for such a purpose. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1142/S179383091250053X | Lecture Notes in Operations Research |
Keywords | Field | DocType |
Message transmission,Key sharing graph,Eavesdropper,Absolutely secure,2-connected graph,Internally disjoint paths,Tree | Key sharing,Graph,Vertex (geometry),Communication source,Computer network,Secure multicast,Unicast,Multicast,Shared secret,Mathematics | Journal |
Volume | Issue | ISSN |
14 | 4 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshihiro Indo | 1 | 0 | 0.34 |
| Takaaki Mizuki | 2 | 221 | 37.60 |
| Takao Nishizeki | 3 | 1771 | 267.08 |