On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

DOI10.1007/978-3-540-92295-7_19zbMath1365.94418OpenAlexW1502676516MaRDI QIDQ3616571

Ashish Choudhury, Arpita Patra, C. Pandu Rangan, B. V. Ashwinkumar, Kannan Srinathan

Publication date: 26 March 2009

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92295-7_19

zbMATH Keywords

asynchronous networksinformation theoretic security

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12)

Related Items (3)

Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission ⋮ Secure message transmission in asynchronous networks ⋮ Secure Message Transmission in Asynchronous Directed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient perfectly secure message transmission in synchronous networks
• Secure communication in minimal connectivity models
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Perfectly secure message transmission
• Asynchronous Secure Communication Tolerating Mixed Adversaries
• Advances in Cryptology – CRYPTO 2004
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Theory of Cryptography

This page was built for publication: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks