ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH

Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

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. In a key sharing graph, 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 first give a necessary and sufficient condition on a key sharing graph for the existence of such a unicast protocol. We then extend the condition to the case where a multiple number of players other than the sender and receiver passively collude. We finally give a sufficient condition for the existence of a secure multicast protocol.

Original languageEnglish
Article number1250053
JournalDiscrete Mathematics, Algorithms and Applications
Volume4
Issue number4
DOIs
Publication statusPublished - 2012 Dec 1

Keywords

  • 2-connected graph
  • Message transmission
  • absolutely secure
  • collusion
  • eavesdropper
  • internally disjoint paths
  • key sharing graph
  • multicast
  • tree
  • unicast

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH'. Together they form a unique fingerprint.

Cite this