A one-round secure message broadcasting protocol through a key sharing tree

Authors:
Takaaki Mizuki;Takuya Sato;Hideaki Sone
Affiliations:
Cyberscience Center, Tohoku University, Aramaki-Aza-Aoba 6-3, Aoba-ku, Sendai 980-8578, Japan;Sone Lab., Graduate School of Information Sciences, Tohoku University, Aramaki-Aza-Aoba 6-3, Aoba-ku, Sendai 980-8578, Japan;Cyberscience Center, Tohoku University, Aramaki-Aza-Aoba 6-3, Aoba-ku, Sendai 980-8578, Japan
Venue:
Information Processing Letters
Year:
2009

Citing 10
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
An efficient protocol for unconditionally secure secret key exchange

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
Private Computations in Networks: Topology versus Randomness

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Multiparty Secret Key Exchange Using a Random Deal of Cards

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient and Secure Conference-Key Distribution

Proceedings of the International Workshop on Security Protocols
Characterization of optimal key set protocols

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Secure Hypergraphs: Privacy from Partial Broadcast

SIAM Journal on Discrete Mathematics
Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 incident with the edge. Assume that, given a key sharing graph which contains a spanning tree, any designated player wishes to broadcast a message to all the other players securely against an eavesdropper. This can be easily done by flooding the message on the tree using the one-time pad scheme. However, the number of communication rounds in such a protocol is equal to the height of the tree. This paper provides another efficient protocol, which has exactly one communication round, i.e., we give a non-interactive protocol.