Jump to content

Flash proxy

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 04:06, 27 March 2023 (Alter: title. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 388/3352). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Flash proxy is a pluggable transport and proxy which runs in a web browser. Flash proxies are an Internet censorship circumvention tool which enables users to connect to the Tor anonymity network (amongst others) via a plethora of ephemeral browser-based proxy relays. The essential idea is that the IP addresses contingently used are changed faster than a censoring agency can detect, track, and block them. The Tor traffic is wrapped in a WebSocket format and disguised with an XOR cipher.[1]

Implementation

A free software[2] implementation of flash proxies is available. It uses JavaScript, WebSocket, and a Python implementation of the obfsproxy protocol,[3] and was crafted by the Security Project in Computer Security at Stanford University.[4] This work was supported by the Defense Advanced Research Project Agency (DARPA) and the Space and Naval Warfare Systems Center Pacific under Contract No. N66001-11-C-4022.[5]

See also

References

  1. ^ Gallagher, Sean (2014-08-14). "A portable router that conceals your Internet traffic". Ars Technica. Retrieved 2016-04-10.
  2. ^ "Welcome to nginx". gitweb.torproject.org. Archived from the original on 24 September 2013. Retrieved 27 January 2022.
  3. ^ "Combined flash proxy + pyobfsproxy browser bundles | The Tor Blog". Blog.torproject.org. 2013-02-23. Retrieved 2016-04-10.
  4. ^ "Flash Proxies". Crypto.stanford.edu. Retrieved 2016-04-10.
  5. ^ Jones, Martin (2011). "Biting the Hand That Serves You: A Closer Look at Client-Side Flash Proxies for Cross-Domain Requests". Detection of Intrusions and Malware, and Vulnerability Assessment. Lecture Notes in Computer Science. 6739: 85–103. doi:10.1007/978-3-642-22424-9_6. ISBN 978-3-642-22423-2.