Leaving timing-channel fingerprints in hidden service log files

被引:6
作者
Shebaro, Bilal [1 ]
Perez-Gonzalez, Fernando [2 ,3 ]
Crandall, Jedidiah R. [1 ]
机构
[1] Univ New Mexico, Dept Comp Sci, Albuquerque, NM 87131 USA
[2] Univ Vigo, Signal Theory & Commun Dept, Sch Telecommun Engn, Vigo, Spain
[3] Univ New Mexico, Dept Elect & Comp Engn, Albuquerque, NM 87131 USA
基金
美国国家科学基金会;
关键词
Timing channel; Fingerprints; Tor network; Hidden services; Timestamps;
D O I
10.1016/j.diin.2010.05.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hidden services are anonymously hosted services that can be accessed over an anonymity network, such as Tor. While most hidden services are legitimate, some host illegal content. There has been a fair amount of research on locating hidden services, but an open problem is to develop a general method to prove that a physical machine, once confiscated, was in fact the machine that had been hosting the illegal content. In this paper we assume that the hidden service logs requests with some timestamp, and give experimental results for leaving an identifiable fingerprint in this log file as a timing channel that can be recovered from the timestamps. In 60 min, we are able to leave a 36-bit fingerprint that can be reliably recovered. The main challenges are the packet delays caused by the anonymity network that requests are sent over and the existing traffic in the log from the actual clients accessing the service. We give data to characterize these noise sources and then describe an implementation of timing-channel fingerprinting for an Apache web server based hidden service on the Tor network, where the fingerprint is an additive channel that is superencoded with a ReedeSolomon code for reliable recovery. Finally, we discuss the inherent tradeoffs and possible approaches to making the fingerprint more stealthy. (C) 2010 Digital Forensic Research Workshop. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:S104 / S113
页数:10
相关论文
共 21 条
[1]  
[Anonymous], 2006, HOT NOT REVEALING HI, DOI [DOI 10.1145/1180405.1180410, 10.1145/1180405.1180410]
[2]  
[Anonymous], 2004, TOR 2 GENERATION ONI
[3]  
Bauer K, 2007, WPES'07: PROCEEDINGS OF THE 2007 ACM WORKSHOP ON PRIVACY IN ELECTRONIC SOCIETY, P11
[4]  
CABUK S, 2004, CCS 04, P178
[5]  
Danezis G, 2005, LECT NOTES COMPUT SC, V3424, P35
[6]  
DIAZ C, 2004, LNCS
[7]  
Gianvecchio S, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P307
[8]  
Giffin John., 2002, Proceedings of the Workshop on Privacy Enhancing Technologies, P194
[9]  
KANG MH, 1993, P 1 ACM C COMP COMM, P119, DOI DOI 10.1145/168588.168604
[10]   CONFINEMENT PROBLEM [J].
LAMPSON, BW .
COMMUNICATIONS OF THE ACM, 1973, 16 (10) :613-615