Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality

DOI10.1007/978-3-540-77026-8_9zbMath1153.68325OpenAlexW1509903572MaRDI QIDQ5458204

Ashish Choudhury, Arpita Patra, C. Pandu Rangan, Kannan Srinathan

Publication date: 11 April 2008

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-77026-8_9

zbMATH Keywords

Fault ToleranceInformation Theoretic SecurityProbabilistic Reliability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

On minimal connectivity requirements for secure message transmission in directed networks ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Cites Work

• Unnamed Item
• Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
• Perfectly secure message transmission
• Advances in Cryptology – CRYPTO 2004
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Secure communication in multicast channels: The answer to Franklin and Wright's question

This page was built for publication: Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality