Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

DOI10.1007/978-3-540-85093-9_15zbMath1162.94323OpenAlexW1564893486MaRDI 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

Cryptography (94A60) Information theory (general) (94A15) Distributed systems (68M14) Network protocols (68M12)

Related Items (2)

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

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

This page was built for publication: Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary