Subverting BIND's SRTT Algorithm Derandomizing NS Selection

Authors: 

Roee Hay, IBM; Jonathan Kalechstein, Technion—Israel Institute of Technology; Gabi Nakibly, National EW Research & Simulation Center, Israel

Abstract: 

One of the defenses against DNS cache poisoning is randomization of the IP address of the queried name server. We present a newly found vulnerability in BIND, the most widely used DNS software on the Internet, which enables an attacker to easily and deterministically control the queried name server chosen by BIND's resolver. The vulnerability lies in BIND's SRTT (Smoothed Round Trip Time) algorithm. The attack reduces the time and eort required to successfully poison BIND's cache.

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

Presentation Video

Download Video

Presentation Audio

Hay PDF
View the slides
BibTeX
@inproceedings {179195,
author = {Roee Hay and Jonathan Kalechstein and Gabi Nakibly},
title = {Subverting BIND{\textquoteright}s {SRTT} Algorithm Derandomizing {NS} Selection},
booktitle = {Presented as part of the 7th {USENIX} Workshop on Offensive Technologies},
year = {2013},
address = {Washington, D.C.},
url = {https://www.usenix.org/conference/woot13/workshop-program/presentation/Hay},
publisher = {{USENIX}},
}
Download