Secure communication in multicast graphs

DOI10.1007/978-3-642-25385-0_29MaRDI QIDQ3102209zbMATH OpenOpenAlexFDO

Authors Qiushi Yang, Yvo Desmedt

Publication date 2 December 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25385-0_29

zbMATH Keywords

adversary structuremulticastprivacyreliabilityreliable communicationsecure communication

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secure communication in multicast channels: The answer to Franklin and Wright's question
• scientific article; zbMATH DE number 1304089
• Secure communication in minimal connectivity models
• Probabilistic reliability and privacy of communication using multicast in general neighbor networks
• Perfectly secure message transmission

Cited in

(6)

• Secure communication in minimal connectivity models
• Probabilistic reliability and privacy of communication using multicast in general neighbor networks
• Secure Message Transmission in Asynchronous Directed Graphs
• scientific article; zbMATH DE number 1303134 (Why is no real title available?)
• Constructing disjoint paths for secure communication
• Secure communication in multicast channels: The answer to Franklin and Wright's question

This page was built for publication: Secure communication in multicast graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102209)