Secure Message Transmission in Asynchronous Directed Graphs

DOI10.1007/978-3-642-25578-6_26MaRDI QIDQ3104754zbMATH OpenOpenAlexFDO

Authors Shashank Agrawal, Abhinav Mehta, Kannan Srinathan

Publication date 16 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-25578-6_26

zbMATH Keywords

directed graphinformation-theoretic securityasynchronous networkByzantine adversary

Mathematics Subject Classification ID

Cryptography (94A60) Signed and weighted graphs (05C22)

Recommendations

• Secure message transmission on directed networks
• Secure message transmission in asynchronous networks
• Secure communication in multicast graphs
• Absolutely secure message transmission using a key sharing graph
• Efficient perfectly secure message transmission in synchronous networks
• On the communication complexity of reliable and secure message transmission in asynchronous networks
• Proactive secure message transmission in asynchronous networks
• On minimal connectivity requirements for secure message transmission in directed networks
• On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

Cites work

• scientific article; zbMATH DE number 5764833 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263179 (Why is no real title available?)
• scientific article; zbMATH DE number 2086727 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Constant phase efficient protocols for secure message transmission in directed networks
• Cryptanalysis of secure message transmission protocols with feedback
• Efficient perfectly secure message transmission in synchronous networks
• How to share a secret
• Impossibility of distributed consensus with one faulty process
• Minimal connectivity for unconditionally secure message transmission in synchronous directed networks
• On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
• On Proactive Perfectly Secure Message Transmission
• On perfectly secure communication over arbitrary networks
• Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
• Perfectly secure message transmission
• Player simulation and general adversary structures in perfect multiparty computation
• Possibility and complexity of probabilistic reliable communication in directed networks
• Secure communication in minimal connectivity models
• The Byzantine Generals Problem
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited

Cited in

(7)

• Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
• On the communication complexity of reliable and secure message transmission in asynchronous networks
• Secure Message Delivery Games for Device-to-Device Communications
• On minimal connectivity requirements for secure message transmission in directed networks
• On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
• Minimal connectivity for unconditionally secure message transmission in synchronous directed networks
• Bounds and constructions for 1-round (0, )-secure message transmission against generalized adversary

This page was built for publication: Secure Message Transmission in Asynchronous Directed Graphs

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