A one-round secure message broadcasting protocol through a key sharing tree
From MaRDI portal
Publication:989505
DOI10.1016/j.ipl.2009.04.004zbMath1209.68232OpenAlexW2054436134MaRDI QIDQ989505
Takuya Sato, Takaaki Mizuki, Hideaki Sone
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.004
cryptographydesign of algorithmsinformation-theoretic securitykey sharing graphmultiparty secret key exchange
Related Items (1)
Cites Work
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Characterization of optimal key set protocols
- Secure communication in minimal connectivity models
- Advances in Cryptology - EUROCRYPT 2004
- Secure Hypergraphs: Privacy from Partial Broadcast
- Secure communication in multicast channels: The answer to Franklin and Wright's question
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A one-round secure message broadcasting protocol through a key sharing tree