Using a Byzantine-Fault-Tolerant Algorithm to Provide a Secure DNS (1995)
| Citations: | 2 - 0 self |
BibTeX
@MISC{Yang95usinga,
author = {Zheng Yang},
title = {Using a Byzantine-Fault-Tolerant Algorithm to Provide a Secure DNS},
year = {1995}
}
OpenURL
Abstract
The Domain Name System, or DNS, is a distributed database that is used to provide a name service for the Internet. It has become a critical part of the Internet infrastructure. Because of its importance, DNS is a favorite target of malicious hackers. However, DNS is not designed to be a secure protocol. To make the DNS more robust, a DNS security extension has been proposed. In this extension, the authentication of the queried data can be verified by using a public-private key scheme. But this extension still has some security flaws. This thesis analyzes the security issues of DNS and its security extension. It presents a design and implementation of a Byzantine-fault-tolerant DNS based on a new Byzantine-fault-tolerant algorithm. This DNS also support secure dynamic update operations. The malicious user needs to compromise at least f + 1 replicas to effectively attack the system, which consists of 3f +1 replicas. This thesis also shows that the Byzantine-fault-tolerant DNS performs almost as well as an implementation







