Authenticated adversarial routing

DOI10.1007/s00145-013-9157-6zbMath1319.68015arXiv0808.0156OpenAlexW1755465830MaRDI QIDQ484328

Yair Amir, Paul Bunn, Rafail Ostrovsky

Publication date: 7 January 2015

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.0156

zbMATH Keywords

error-correctioncommunication complexitynetwork routingfault localizationend-to-end communicationmulti-party computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Adaptive packet routing for bursty adversarial traffic
• On-line/off-line digital signatures
• Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
• A coding theorem for distributed computation
• Slide—The Key to Polynomial End-to-End Communication
• Coding for interactive communication
• Asynchronous Throughput-Optimal Routing in Malicious Networks
• Log-Space Polynomial End-to-End Communication
• Foundations of Cryptography
• The slide mechanism with applications in dynamic networks
• Protocols and Lower Bounds for Failure Localization in the Internet
• Theory of Cryptography

This page was built for publication: Authenticated adversarial routing