Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity

DOI10.1007/978-3-319-17470-9_3zbMath1336.94059OpenAlexW900247415MaRDI QIDQ2947521

Ravi Kishore, Chiranjeevi Vanarasa, Srinathan Kannan, Ashutosh Kumar

Publication date: 24 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_3

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

On minimal connectivity requirements for secure message transmission in directed networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient perfectly secure message transmission in synchronous networks
• Secure message transmission on directed networks
• Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
• How to share a secret
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• On Proactive Perfectly Secure Message Transmission
• A new approach to the maximum-flow problem
• New directions in cryptography
• Perfectly secure message transmission
• Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
• On perfectly secure communication over arbitrary networks
• Possibility and complexity of probabilistic reliable communication in directed networks
• How to withstand mobile virus attacks (extended abstract)
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
• Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

This page was built for publication: Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity