Perfectly reliable message transmission

DOI10.1016/J.IPL.2005.11.027zbMATH Open1185.68095OpenAlexW2011463728MaRDI QIDQ845819FDOQ845819

Authors: Arvind Narayanan, C. Pandu Rangan, Kannan Srinathan 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.027

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Perfectly secure message transmission
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

zbMATH Keywords

fault tolerancesecurity

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Title not available (Why is that?)
• Perfectly secure message transmission
• Title not available (Why is that?)
• Efficient perfectly secure message transmission in synchronous networks

Cited In (8)

• Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
• Perfectly Secure Message Transmission Revisited
• 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
• Title not available (Why is that?)
• On one-round reliable message transmission
• Reliable communication across parallel asynchronous channels with glitches

This page was built for publication: Perfectly reliable message transmission

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845819)