A one-round secure message broadcasting protocol through a key sharing tree
From MaRDI portal
Publication:989505
DOI10.1016/J.IPL.2009.04.004zbMATH Open1209.68232OpenAlexW2054436134MaRDI QIDQ989505FDOQ989505
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
Recommendations
- Information Security and Privacy
- One-Way Chain Based Broadcast Encryption Schemes
- Tree based symmetric key broadcast encryption
- Broadcast (and round) efficient verifiable secret sharing
- Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
- Dynamic Balanced Key Tree Management for Secure Multicast Communications
- On Forward Secrecy in One-Round Key Exchange
cryptographyinformation-theoretic securitydesign of algorithmskey sharing graphmultiparty secret key exchange
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure communication in minimal connectivity models
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Characterization of optimal key set protocols
- Title not available (Why is that?)
- Secure Hypergraphs: Privacy from Partial Broadcast
- Secure communication in multicast channels: The answer to Franklin and Wright's question
Cited In (3)
This page was built for publication: A one-round secure message broadcasting protocol through a key sharing tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989505)
