Hop integrity in computer networks

Authors:
M. G. Gouda;E. N. Elnozahy;C.-T. Huang;T. M. McGuire
Affiliations:
-;-;-;-
Venue:
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Year:
2000

Citing 0
Cited 4

Hop integrity in computer networks

IEEE/ACM Transactions on Networking (TON)
On the Security and Vulnerability of PING

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles

IEEE/ACM Transactions on Networking (TON)
On the power of non-spoofing adversaries

DISC'10 Proceedings of the 24th international conference on Distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was indeed sent by q, was not modified after it was sent, and was not a replay of an old message sent from q to p. We describe three protocols that can be added to the routers in a computer network so that the network can provide hop integrity. These three protocols are a secret exchange protocol, a weak integrity protocol, and a strong integrity protocol. All three protocols are stateless, require small overhead, and do not constrain the network protocol in the routers in any way.