Probabilistic reliability and privacy of communication using multicast in general neighbor networks

DOI10.1007/s00145-007-9018-2zbMath1159.91006OpenAlexW2113783471MaRDI QIDQ2425532

Tristan Tomala, Jérôme Renault

Publication date: 6 May 2008

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://publications.ut-capitole.fr/3137/1/secure_fin_0907.pdf

zbMATH Keywords

securitycommunication networksrepeated gamesdirected graphsincomplete informationmulticast

Mathematics Subject Classification ID

Cryptography (94A60) Multistage and repeated games (91A20)

Related Items (3)

Mechanism design and communication networks ⋮ Secure message transmission on directed networks ⋮ Repeated Games with Incomplete Information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reliable communication over partially authenticated networks
• Learning the state of nature in repeated games with incomplete information and signals
• Repeated proximity games.
• Secure communication in minimal connectivity models
• Communication in repeated games with private monitoring
• The Byzantine generals strike again
• Perfectly secure message transmission
• Possibility and complexity of probabilistic reliable communication in directed networks
• Efficient reliable communication over partially authenticated networks
• Secure communication in multicast channels: The answer to Franklin and Wright's question

This page was built for publication: Probabilistic reliability and privacy of communication using multicast in general neighbor networks