Perfectly Secure Message Transmission Revisited

DOI10.1109/TIT.2008.921676MaRDI QIDQ3604420zbMATH OpenFDO

Authors Y. Wang, Yvo Desmedt

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05) Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 2086727
• Perfectly secure message transmission
• Algorithms and Computation
• Perfectly reliable message transmission
• On perfectly secure communication over arbitrary networks

Cited in

(10)

• Cryptanalysis of secure message transmission protocols with feedback
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Algorithms and Computation
• Secure message transmission on directed networks
• Human Perfectly Secure Message Transmission Protocols and Their Applications
• Secure message transmission in the presence of a fully generalised adversary
• Perfectly Secure Message Transmission in Two Rounds
• On minimal connectivity requirements for secure message transmission in directed networks
• Probabilistic reliability and privacy of communication using multicast in general neighbor networks
• scientific article; zbMATH DE number 2086727 (Why is no real title available?)

This page was built for publication: Perfectly Secure Message Transmission Revisited

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