SkypeMorph: Protocol Obfuscation for Censorship Resistance
نویسنده
چکیده
The Tor network is designed to provide users with low-latency anonymous communication. Tor clients build circuits with publicly listed relays to anonymously reach their destinations. Low-latency anonymous communication is also an essential property required by censorship circumvention tools and thus Tor has been widely used as a censorship resistance tool. However, since the Tor relays are publicly listed, they can be easily blocked by censoring adversaries. Consequently, the Tor project envisioned the possibility of unlisted entry points to the Tor network, commonly known as bridges. In recent years, there have been attempts to achieve fast and real-time methods to discover Tor, and specifically bridge, connections. In this thesis we address the issue of preventing censors from detecting a certain type of traffic, for instance Tor connections, by observing the communications between a remote node and nodes in their network. We propose a generic model in which the client obfuscates its messages to the bridge in a widely used protocol over the Internet. We investigate using Skype video calls as our target protocol and our goal is to make it difficult for the censoring adversary to distinguish between the obfuscated bridge connections and actual Skype calls using statistical comparisons. Although our method is generic and can be used by any censorship resistance application, we present it for Tor, which has well-studied anonymity properties. We have implemented our model as a proof-of-concept proxy that can be extended to a pluggable transport for Tor, and it is available under an open-source licence. Using this implementation we observed the obfuscated bridge communications and showed their characteristics match those of Skype calls. We also compared two methods for traffic shaping and concluded that they perform almost equally in terms of overhead; however, the simpler method makes fewer assumptions about the characteristics of the censorship resistance application’s network traffic, and so this is the one we recommend.
منابع مشابه
Poster: Games Without Frontiers: Investigating Video Games as a Covert Channel
Censorship circumvention tools face an arms race as they work to evade increasingly motivated censors. Tools which have distinctive features can be detected and blocked by censors (e.g., Tor is actively targeted by censors around the world). As a result, there is increasing interest in disguising censorship circumvention traffic as benign protocols. SkypeMorph [1] and StegoTorus [2] are two plu...
متن کاملMarionette: A Programmable Network Traffic Obfuscation System
Recently, a number of obfuscation systems have been developed to aid in censorship circumvention scenarios where encrypted network traffic is filtered. In this paper, we present Marionette, the first programmable network traffic obfuscation system capable of simultaneously controlling encrypted traffic features at a variety of levels, including ciphertext formats, stateful protocol semantics, a...
متن کاملScrambleSuit: A Polymorph Network Protocol to Circumvent Censorship
Deep packet inspection technology became a cornerstone of Internet censorship by facilitating cheap and effective filtering of what censors consider undesired information. Moreover, filtering is not limited to simple pattern matching but makes use of sophisticated techniques such as active probing and protocol classification to block access to popular circumvention tools such as Tor. In this pa...
متن کاملWhen the User Disappears: Situational Non-Use of Social Technologies
While most research on use and non-use focuses on the adoption or rejection of technology, this paper proposes “situational non-use” as a framework to examine occasional non-use behaviors for established users of social technologies. I introduce the concepts of obfuscation and self-censorship as situational non-use practices and explore them in reflections of ongoing research projects. Author
متن کاملConstant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for P/poly (with slightly super-polynomial security).
متن کامل