On Exponential Lower Bound for Protocols for Reliable Communication in Networks

DOI10.1007/978-3-642-10230-1_7zbMath1263.68027OpenAlexW1519254335MaRDI QIDQ3649190

C. Pandu Rangan, Ranjit Kumaresan, Kannan Srinathan

Publication date: 3 December 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-642-10230-1_7

zbMATH Keywords

efficiencyByzantine non-threshold adversaryperfect reliable unicast

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

This page was built for publication: On Exponential Lower Bound for Protocols for Reliable Communication in Networks