ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH

DOI10.1142/S179383091250053XzbMath1257.68065OpenAlexW2120592021MaRDI QIDQ4903639

Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091250053x

zbMATH Keywords

treemulticastcollusionunicast2-connected graphinternally disjoint pathskey sharing graphmessage transmissioneavesdropperabsolutely secure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Paths and cycles (05C38) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Connectivity (05C40) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• A one-round secure message broadcasting protocol through a key sharing tree
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Secure communication in minimal connectivity models
• AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT
• Communication Theory of Secrecy Systems*
• Perfectly secure message transmission
• Secure Hypergraphs: Privacy from Partial Broadcast
• Secure communication in multicast channels: The answer to Franklin and Wright's question

This page was built for publication: ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH