On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary

DOI10.1145/1400751.1400768zbMath1301.94105MaRDI QIDQ2934339

C. Pandu Rangan, Ashwinkumar Badanidiyuru Varadaraja, Ashish Choudhury, Arpita Patra, Kannan Srinathan

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1400751.1400768

zbMATH Keywords

unbounded computing power

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

68M14: Distributed systems

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

68M12: Network protocols

Related Items

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary, The disagreement power of an adversary