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

DOI10.1016/J.IPL.2009.04.004MaRDI QIDQ989505zbMATH OpenOpenAlexFDO

Authors Takaaki Mizuki, Takuya Sato, 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

zbMATH Keywords

cryptographyinformation-theoretic securitydesign of algorithmskey sharing graphmultiparty secret key exchange

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

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

Cites work

• scientific article; zbMATH DE number 437574 (Why is no real title available?)
• scientific article; zbMATH DE number 176546 (Why is no real title available?)
• scientific article; zbMATH DE number 1304085 (Why is no real title available?)
• scientific article; zbMATH DE number 549855 (Why is no real title available?)
• scientific article; zbMATH DE number 1088922 (Why is no real title available?)
• scientific article; zbMATH DE number 1942421 (Why is no real title available?)
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• scientific article; zbMATH DE number 2086727 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Characterization of optimal key set protocols
• Secure Hypergraphs: Privacy from Partial Broadcast
• Secure communication in minimal connectivity models
• Secure communication in multicast channels: The answer to Franklin and Wright's question
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(3)

• Absolutely secure message transmission using a key sharing graph
• Information Security and Privacy
• One-Way Chain Based Broadcast Encryption Schemes

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)