<?xml version="1.0"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>

<title>David Kotz papers for project 'dist'</title>
<description>Papers from David Kotz and his research group, about DIST (Dartmouth Internet Security Testbed).
</description>
<language>en-us</language>
<pubDate>Mon, 06 Oct 2025 14:06:05 +0000</pubDate>
<link>https://www.cs.dartmouth.edu/~kotz/research/project/dist/index.html</link>
<docs>https://validator.w3.org/feed/docs/rss2.html</docs>
<atom:link href="https://www.cs.dartmouth.edu/~kotz/research/project/dist/feed.xml" rel="self" type="application/rss+xml"/>

<item>
<title>From MAP to DIST: the evolution of a large-scale WLAN monitoring system</title>
<guid>tan:dist</guid>
<pubDate>Wed, 01 Jan 2014 00:00:00 </pubDate>
<description>
Keren Tan, Chris McDonald, Bennet Vance, Chrisil Arackaparambil, Sergey Bratus, and David Kotz.
 &lt;b&gt;From MAP to DIST: the evolution of a large-scale WLAN monitoring system.&lt;/b&gt;
 &lt;i&gt;IEEE Transactions on Mobile Computing&lt;/i&gt;, volume&#160;13, number&#160;1, pages&#160;216&#8211;229.
 IEEE, January 2014.
 doi:10.1109/TMC.2012.237.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;The edge of the Internet is increasingly becoming wireless. Therefore, monitoring the wireless edge is important to understanding the security and performance aspects of the Internet experience. We have designed and implemented a large-scale WLAN monitoring system, the Distributed Internet Security Testbed (DIST), at Dartmouth College. It is equipped with distributed arrays of &#8220;sniffers&#8221; that cover 210 diverse campus locations and more than 5,000 users. In this paper, we describe our approach, designs and solutions for addressing the technical challenges that have resulted from efficiency, scalability, security, and management perspectives. We also present extensive evaluation results on a production network, and summarize the lessons learned.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/tan-dist/index.html</link>
</item>

<item>
<title>Large-scale Wireless Local-area Network Measurement and Privacy Analysis</title>
<guid>tan:thesis</guid>
<pubDate>Mon, 01 Aug 2011 00:00:00 </pubDate>
<description>
Keren Tan.
 &lt;b&gt;Large-scale Wireless Local-area Network Measurement and Privacy Analysis.&lt;/b&gt;
 PhD thesis, Dartmouth Computer Science, Hanover, NH, August 2011.
 Available as Dartmouth Computer Science Technical Report TR2011-703.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;The edge of the Internet is increasingly becoming wireless. Understanding the wireless edge is therefore important for understanding the performance and security aspects of the Internet experience. This need is especially necessary for enterprise-wide wireless local-area networks (WLANs) as organizations increasingly depend on WLANs for mission-critical tasks. To study a live production WLAN, especially a large-scale network, is a difficult undertaking. Two fundamental difficulties involved are (1) building a scalable network measurement infrastructure to collect traces from a large-scale production WLAN, and (2) preserving user privacy while sharing these collected traces to the network research community. In this dissertation, we present our experience in designing and implementing one of the largest distributed WLAN measurement systems in the United States, the Dartmouth Internet Security Testbed (DIST), with a particular focus on our solutions to the challenges of efficiency, scalability, and security. We also present an extensive evaluation of the DIST system. To understand the severity of some potential trace-sharing risks for an enterprise-wide large-scale wireless network, we conduct privacy analysis on one kind of wireless network traces, a user-association log, collected from a large-scale WLAN. We introduce a machine-learning based approach that can extract and quantify sensitive information from a user-association log, even though it is sanitized. Finally, we present a case study that evaluates the tradeoff between utility and privacy on WLAN trace sanitization.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/tan-thesis/index.html</link>
</item>

<item>
<title>Saluki: a High-Performance Wi-Fi Sniffing Program</title>
<guid>tan:saluki</guid>
<pubDate>Sat, 01 May 2010 00:00:00 </pubDate>
<description>
Keren Tan and David Kotz.
 &lt;b&gt;Saluki: a High-Performance Wi-Fi Sniffing Program.&lt;/b&gt;
 &lt;i&gt;Proceedings of the International Workshop on Wireless Network Measurements (WiNMee)&lt;/i&gt;, pages&#160;591&#8211;596.
 IEEE, May 2010.
 Invited paper.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;Building a campus-wide wireless LAN measurement system faces many efficiency, scalability and security challenges. To address these challenges, we developed a distributed Wi-Fi sniffing program called Saluki. Compared to our previous implementation and to other available sniffing programs, Saluki has the following advantages: (1) its small footprint makes it suitable for a resource-constrained Linux platform, such as those in commercial Wi-Fi access points; (2) the frame-capture rate increased more than three-fold over tcpdump with minimal frame loss; (3) all traffic between this sniffer and the back-end server was secured using 128-bit encryption; and (4) the traffic load on the backbone network was reduced to only 30% of that in our previous implementation. In this paper, we introduce the design and the implementation details of this high-performance sniffing program, along with preliminary evaluation results.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/tan-saluki/index.html</link>
</item>

<item>
<title>On the Reliability of Wireless Fingerprinting using Clock Skews</title>
<guid>arackaparambil:clock-skew</guid>
<pubDate>Mon, 01 Mar 2010 00:00:00 </pubDate>
<description>
Chrisil Arackaparambil, Sergey Bratus, Anna Shubina, and David Kotz.
 &lt;b&gt;On the Reliability of Wireless Fingerprinting using Clock Skews.&lt;/b&gt;
 &lt;i&gt;Proceedings of the ACM Conference on Wireless Network Security (WiSec)&lt;/i&gt;, 6&#160;pages, pages&#160;169&#8211;174.
 ACM, March 2010.
 doi:10.1145/1741866.1741894.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. But cryptographic exchange protocols are complex and therefore induce potential vulnerabilities in themselves. We show that measurement of clock skews of access points in an 802.11 network can be useful in this regard, since it provides fingerprints of the devices. Such fingerprints can be used to establish the first point of trust for client stations wishing to connect to an access point. Fingerprinting can also be used in the detection of fake access points. &lt;/p&gt;&lt;p&gt; We demonstrate deficiencies of previously studied methods that measure clock skews in 802.11 networks by means of an attack that spoofs clock skews. We then provide means to overcome those deficiencies, thereby improving the reliability of fingerprinting. Finally, we show how to perform the clock-skew arithmetic that enables network providers to publish clock skews of their access points for use by clients.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/arackaparambil-clock-skew/index.html</link>
</item>

<item>
<title>On the Reliability of Wireless Fingerprinting using Clock Skews</title>
<guid>arackaparambil:clock-skew-tr</guid>
<pubDate>Fri, 01 Jan 2010 00:00:00 </pubDate>
<description>
Chrisil Arackaparambil, Sergey Bratus, Anna Shubina, and David Kotz.
 &lt;b&gt;On the Reliability of Wireless Fingerprinting using Clock Skews.&lt;/b&gt;
 Technical Report number&#160;TR2010-661, Dartmouth Computer Science, Hanover, NH, January 2010.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. But cryptographic exchange protocols are complex and therefore induce potential vulnerabilities in themselves. We show that measurement of clock skews of access points in an 802.11 network can be useful in this regard, since it provides fingerprints of the devices. Such fingerprints can be used to establish the first point of trust for client stations wishing to connect to an access point. Fingerprinting can also be used in the detection of fake access points. We demonstrate deficiencies of previously studied methods that measure clock skews in 802.11 networks by means of an attack that spoofs clock skews. We then provide means to overcome those deficiencies, thereby improving the reliability of fingerprinting. Finally, we show how to perform the clock-skew arithmetic that enables network providers to publish clock skews of their access points for use by clients.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/arackaparambil-clock-skew-tr/index.html</link>
</item>

<item>
<title>Dartmouth Internet Security Testbed (DIST): building a campus-wide wireless testbed</title>
<guid>bratus:dist-cset</guid>
<pubDate>Sat, 01 Aug 2009 00:00:00 </pubDate>
<description>
Sergey Bratus, David Kotz, Keren Tan, William Taylor, Anna Shubina, Bennet Vance, and Michael E. Locasto.
 &lt;b&gt;Dartmouth Internet Security Testbed (DIST): building a campus-wide wireless testbed.&lt;/b&gt;
 &lt;i&gt;Proceedings of the Workshop on Cyber Security Experimentation and Test (CSET)&lt;/i&gt;, 6&#160;pages.
 USENIX Association, August 2009.
 &lt;p&gt;&lt;b&gt;Abstract:&lt;/b&gt;
&lt;p&gt;We describe our experiences in deploying a campus-wide wireless security testbed. The testbed gives us the capability to monitor security-related aspects of the 802.11 MAC layer in over 200 diverse campus locations. We describe both the technical and the social challenges of designing, building, and deploying such a system, which, to the best of our knowledge, is the largest such testbed in academia (with the UCSD&#8217;s Jigsaw infrastructure a close competitor). In this paper we focus on the &lt;em&gt;testbed setup&lt;/em&gt;, rather than on the experimental data and results.&lt;/p&gt;&lt;/p&gt;
 
</description>
<link>https://www.cs.dartmouth.edu/~kotz/research/bratus-dist-cset/index.html</link>
</item>

</channel>
</rss>
