Secure message transmission on directed networks

DOI10.1016/J.GEB.2014.01.012MaRDI QIDQ2442837zbMATH OpenOpenAlexFDO

Authors Jérôme Renault, Ludovic Renou, Tristan Tomala

Publication date 1 April 2014

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL http://publications.ut-capitole.fr/15871/1/1_s2%200_s0899825614000177_main.pdf

zbMATH Keywords

communicationprotocolssecure communication

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Signaling and communication in game theory (91A28) Games involving graphs (91A43) Cryptography (94A60)

Recommendations

• Minimal connectivity for unconditionally secure message transmission in synchronous directed networks
• Perfectly Secure Message Transmission Revisited
• On perfectly secure communication over arbitrary networks
• Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
• Round-optimal perfectly secret message transmission with linear communication complexity

Cites work

• A computational introduction to number theory and algebra
• Cheap talk in games with incomplete information.
• Communication in repeated games with private monitoring
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Distributed computing meets game theory
• Distributed games
• Fair Distribution Protocols or How the Players Replace Fortune
• Fault reporting in partially known networks and folk theorems
• How to share a secret
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• scientific article; zbMATH DE number 2086727 (Why is no real title available?)
• scientific article; zbMATH DE number 1418286 (Why is no real title available?)
• Learning the state of nature in repeated games with incomplete information and signals
• Lower Bounds on Implementing Robust and Resilient Mediators
• Mechanism design and communication networks
• Perfectly secure message transmission
• Probabilistic reliability and privacy of communication using multicast in general neighbor networks
• Rational secret sharing and multiparty computation
• Rational Secret Sharing, Revisited
• Repeated proximity games.
• Secret-Sharing Schemes: A Survey
• Secure communication in minimal connectivity models
• Specification faithfulness in networks with rational nodes
• Strategic Information Transmission
• Universal Mechanisms
• Unmediated communication in games with complete and incomplete information.

Cited in

(13)

• Incentives and the structure of communication
• Communications in unknown networks: preserving the secret of topology
• Secure Message Delivery Games for Device-to-Device Communications
• Round-optimal perfectly secret message transmission with linear communication complexity
• Secure Message Transmission in Asynchronous Directed Graphs
• Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
• Mechanism design and communication networks
• Absolutely secure message transmission using a key sharing graph
• Repeated games with incomplete information
• Structural Information and Communication Complexity
• Private disclosure with multiple agents
• Communication on networks and strong reliability
• Games with information constraints: seeds and spillovers

This page was built for publication: Secure message transmission on directed networks

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