Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

DOI10.1007/978-3-540-85093-9_15zbMath1162.94323MaRDI QIDQ5502798

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

Publication date: 9 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_15

Mathematics Subject Classification ID

94A60: Cryptography

94A15: Information theory (general)

68M14: Distributed systems

68M12: Network protocols

Related Items

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary, Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity

Cites Work

• Unnamed Item
• Efficient perfectly secure message transmission in synchronous networks
• Secure communication in minimal connectivity models
• On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
• Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
• On Proactive Perfectly Secure Message Transmission
• Perfectly secure message transmission
• On perfectly secure communication over arbitrary networks
• Advances in Cryptology – CRYPTO 2004
• Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission