Authenticated Adversarial Routing

The aim of this paper is to demonstrate the feasibility of authenticated throughput-efficient routing in an unreliable and dynamically changing synchronous network in which the majority of malicious insiders try to destroy and alter messages or disrupt communication in any way. More specifically, in...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of cryptology Ročník 27; číslo 4; s. 636 - 771
Hlavní autoři:	Amir, Yair, Bunn, Paul, Ostrovsky, Rafail
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.10.2014 Springer Springer Nature B.V
Témata:	Access methods and protocols, osi model Algorithms Applied sciences Coding and Information Theory Coding, codes Combinatorics Communication Communications Engineering Computational Mathematics and Numerical Analysis Computer networks Computer Science Corruption Cryptography Distributed processing Error correction Exact sciences and technology Fault location Feasibility Information, signal and communications theory Localization Microprocessors Networks Nodes Optimization Polynomials Principles Probability Theory and Stochastic Processes Protocol (computers) Questions Routing (telecommunications) Signal and communications theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Theorems Topology Transmission and modulation (techniques and equipments) End-to-end communication Fault localization Error-correction Multi-party computation Communication complexity Network routing Performance evaluation Worst case method High precision Information rate Distributed computing Cryptology Coding Defect localization Security of data Connectedness Routing protocols Cryptography Transmission protocol Algorithm Information transmission Interactive system Private key Public key Telecommunication network Feasibility Metric Error correction
ISSN:	0933-2790, 1432-1378
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!