Difference between revisions of "Deep web"

From Hidden Wiki
Jump to navigation Jump to search
(*ATTENTION*THIS*SCAM*WIKI*IS*RUN*BY*ISIS*TERRORIST*ORGANIZATION*ALL*LINKS*ARE*SCAM*ALL*INFO*MISLEADING*WILL*BRING*YOU*TO*PRISON*)
Line 1: Line 1:
{{Shortcut}}
*ATTENTION*THIS*SCAM*WIKI*IS*RUN*BY*ISIS*TERRORIST*ORGANIZATION*ALL*LINKS*ARE*SCAM*ALL*INFO*MISLEADING*WILL*BRING*YOU*TO*PRISON*
== Summary ==
{{Distinguish|Darknet (overlay network)|Dark internet}}
{{Refimprove|date=December 2013}}
 
'''Deep Web''' (also called the '''[[Deepnet]]''',<ref name="nhamilton">{{cite paper|id = {{citeseerx|10.1.1.90.5847}}|title=The Mechanics of a Deep Net Metasearch Engine|last=Hamilton|first=Nigel}}</ref> '''[[Invisible Web]]''',<ref name="jal">{{cite journal|title=Beyond google: the invisible web in the academic library|url=https://www.sciencedirect.com/science/article/pii/S0099133304000801?np=y|volume=30|issue=4|date=July 2004|pages=265–269|last1=Devine|first1=Jane|last2=Egger-Sider|first2=Francine|journal=The Journal of Academic Librarianship|accessdate=2014-02-06}}</ref> or '''[[Hidden Web]]'''<ref name="cthw">{{cite journal|title=Crawling the Hidden Web|work=27th International Conference on Very Large Data Bases|date=11–14 September 2001|first1=Sriram|last1=Raghavan|first2=Hector|last2=Garcia-Molina|location=Rome, Italy|url=http://ilpubs.stanford.edu:8090/725/}}</ref>) is the portion of [[World Wide Web]] content that is not [[Search engine indexing|indexed]] by standard [[search engine]]s.
 
Mike Bergman, founder of BrightPlanet and credited with coining the name,<ref name="wright2009"/> said that searching on the internet today can be compared to dragging a net across the surface of the ocean: a great deal may be caught in the net, but there is a wealth of information that is deep and therefore missed.<ref name=bergman2000>{{cite book |first= Michael K | last= Bergman | title = The Deep Web: Surfacing Hidden Value | publisher = BrightPlanet LLC |date=July 2000 | url = http://brightplanet.com/wp-content/uploads/2012/03/12550176481-deepwebwhitepaper1.pdf}}</ref> Most of the web's information is buried far down on sites, and standard search engines do not find it. Traditional search engines cannot see nor retrieve content in the deep web. The portion of the web that is indexed by standard search engines is known as the [[Surface Web|surface web]]. {{As of| 2001}},{{update inline|date=August 2014}} the deep web was several [[order of magnitude|orders of magnitude]] larger than the surface web.<ref name="bergman2001"/>
 
The deep web is a separate entity from the [[dark Internet|dark internet]], which is made up of computers that can no longer be reached via the internet. Also, the [[Darknet (overlay network)|Darknet]]—[[Darknet (overlay network)#Ambiguously called dark web|ambiguously known as Dark Web]]—which consists of various anonymizing networks like [[Tor (anonymity network)|Tor]] and the resources that they provide access to, is not synonymous with the deep web, but is a subsection of it.<ref>[http://www.pcadvisor.co.uk/how-to/internet/3593569/what-is-dark-web-how-access-dark-web/ What is the Dark Web? How to access the Dark Web - How to turn out the lights and access the Dark Web (and why you might want to)]</ref><ref>[http://www.brightplanet.com/2014/03/clearing-confusion-deep-web-vs-dark-web/ Clearing Up Confusion – Deep Web vs. Dark Web]</ref>
 
Although much of the deep web is innocuous, some prosecutors and government agencies, among others, are concerned that the deep web is a haven for serious [[criminality]].<ref>[http://content.time.com/time/magazine/article/0,9171,2156271,00.html?pcd=pw-magic The Secret Web: Where Drugs, Porn and Murder Live Online]</ref>
 
== How to use it safely ==
There are several important rules to protect you from government officers.
 
=== Concealing private information ===
You must not answer any kind of question about you. Because it makes you in danger. Also you don't ask anybody these kind of questions. And you shouldn't write any information about you on the Deep Web. The police is very clever!
 
==== Managing IDs ====
 
=== Using [[antivirus software]]s ===
It is good to use an [[antivirus software]] to protect you from [[computer virus]]es made by [[hacker]]s.
 
=== Updating Tor Browser Bundle ===
 
=== Not to use [[JavaScript]] and [[plug-in]]s ===
Using [[NoScript]]
 
=== Encryption of data ===
Using [[truecrypt]]
==== Why should we encrypt our data? ====
==== How to make safe passwords? ====
 
=== [[Computer forensic]] ===
==== [[Thumbnail]]s ====
 
==== Windows searching index ====
==== Recognizing hard disks ====
==== Evading from computer forensic ====
 
=== Using e-mails, clouds and messangers safely ===
=== Using [[open source software]]s ===
Using [[Chromium]], [[LibreOffice]], [[GIMP]] and [[Linux]]
 
==== Using Chromium instead of [[Chrome]] ====
 
==== Using LibreOffice instead of [[MS Office]] ====
 
==== Using GIMP instead of [[Photoshop]] ====
 
==== Using Linux instead of [[Windows]] ====
 
== How to use Deep Web by [[smartphone]]s and [[tablet]]s ==
Using [[Orbot]] and [[Orweb]] or [[Firefox]], [[Proxy Mobile]] and [[NoScript]] for [[Android]].
 
==Size==
Bright Planet, a web-services company, describes the size of the deep web in this way:
 
<blockquote>
It is impossible to measure, and hard to put estimates on, the size of the deep web because the majority of the information is hidden or locked inside databases. Early estimates suggested that the deep web is 400 to 550 times larger than the surface web. However, since more information and sites are always being added, it can be assumed that the deep web is growing exponentially at a rate that cannot be quantified.
 
Estimates based on [[extrapolation]]s from a study done at [[University of California, Berkeley]] in 2001<ref name="bergman2001">{{cite journal |first= Michael K | last= Bergman | title = The Deep Web: Surfacing Hidden Value | journal = The Journal of Electronic Publishing |date=August 2001 | volume = 7 | issue = 1 | url = http://quod.lib.umich.edu/cgi/t/text/text-idx?c=jep;view=text;rgn=main;idno=3336451.0007.104 |doi=10.3998/3336451.0007.104}}</ref> speculate that the deep web consists of about 7.5 [[petabyte]]s. More accurate estimates are available for the number of resources in the deep web: research of He et al. detected around 300,000 deep web sites in the entire web in 2004,<ref name="he07">{{cite journal |first=Bin |last=He |last2 = Patel | first2 = Mitesh | last3 = Zhang | first3 = Zhen | last4 = Chang | first4 = Kevin Chen-Chuan | title = Accessing the Deep Web: A Survey | journal = Communications of the ACM (CACM) | pages = 94–101 |date=May 2007 | volume = 50 | issue = 2 | url = http://doi.acm.org/10.1145/1230819.1241670 |doi=10.1145/1230819.1241670}}</ref> and, according to Shestakov, around 14,000 deep web sites existed in the Russian part of the Web in 2006.<ref>{{cite paper
| first = Denis
| last = Shestakov
| authorlink =
| title = Sampling the National Deep Web
| conference = DEXA 2011
| pages = 331–340
| version =
| publisher =
| year = 2011
| url = http://www.mendeley.com/download/public/1423991/4300016182/a07080a3191f90cc97cf60fcd21566b1b915d894/dl.pdf
| format = PDF}}</ref>
</blockquote>
 
==Naming==
Bergman, in a seminal paper on the deep Web published in ''The Journal of Electronic Publishing'', mentioned that Jill Ellsworth used the term ''invisible Web'' in 1994 to refer to [[website]]s that were not registered with any search engine.<ref name=bergman2001/> Bergman cited a January 1996 article by Frank Garcia:<ref>{{cite journal
| last = Garcia
| first = Frank
| authorlink =
| title = Business and Marketing on the Internet
| journal = Masthead
| volume = 15
| issue = 1
| pages =
| publisher =
| location =
| date = January 1996
| url = http://tcp.ca/Jan96/BusandMark.html
| issn =
| doi =
| id =
| accessdate = 2009-02-24 |archiveurl = http://web.archive.org/web/19961205083117/http://tcp.ca/Jan96/BusandMark.html |archivedate = 1996-12-05}}</ref>
 
<blockquote>It would be a site that's possibly reasonably designed, but they didn't bother to register it with any of the search engines. So, no one can find them! You're hidden. I call that the invisible Web.</blockquote>
 
Another early use of the term ''Invisible Web'' was by Bruce Mount and Matthew B. Koll of Personal Library Software, in a description of the @1 deep Web tool found in a December 1996 press release.<ref name="PLS">@1 started with 5.7 terabytes of content, estimated to be 30 times the size of the nascent World Wide Web; PLS was acquired by AOL in 1998 and @1 was abandoned. {{cite press release
| title = PLS introduces AT1, the first 'second generation' Internet search service
| publisher = Personal Library Software
| date = December 1996
| url = http://web.archive.org/web/19971021232057/www.pls.com/news/pr961212_at1.html
| accessdate = 2009-02-24}}</ref>
 
The first use of the specific term ''Deep Web'', now generally accepted, occurred in the aforementioned 2001 Bergman study.<ref name=bergman2001/>
 
==Methods==
 
Methods which prevent web pages from being indexed by traditional search engines may be categorized as one or more of the following:
 
* Dynamic content: [[Dynamic Web page|dynamic pages]] which are returned in response to a submitted query or accessed only through a form, especially if open-domain input elements (such as text fields) are used; such fields are hard to navigate without domain knowledge.
* Unlinked content: pages which are not linked to by other pages, which may prevent [[web crawling]] programs from accessing the content. This content is referred to as pages without [[backlink]]s (also known as inlinks). Also, search engines do not always detect all backlinks from searched web pages.
* Private Web: sites that require registration and login (password-protected resources).
* Contextual Web: pages with content varying for different access contexts (e.g., ranges of client IP addresses or previous navigation sequence).
* Limited access content: sites that limit access to their pages in a technical way (e.g., using the [[Robots Exclusion Standard]] or [[CAPTCHA]]s, or no-store directive which prohibit search engines from browsing them and creating [[web cache|cached]] copies.<ref>{{cite web|title = Hypertext Transfer Protocol (HTTP/1.1): Caching|publisher = [[Internet Engineering Task Force]]|year = 2014|url=http://tools.ietf.org/html/rfc7234#section-5.2.2.3|accessdate = 2014-07-30}}</ref>)
* Scripted content: pages that are only accessible through links produced by [[JavaScript]] as well as content dynamically downloaded from Web servers via [[Macromedia Flash|Flash]] or [[Ajax (programming)|Ajax]] solutions.
* Non-HTML/text content: textual content encoded in multimedia (image or video) files or specific [[file formats]] not handled by search engines.
* Software: Certain content is intentionally hidden from the regular internet, accessible only with special software, such as Tor, [[I2P]], or other [[Darknet (overlay network)|darknet software]]. For example, Tor allows users to access websites using the [[.onion]] host suffix anonymously, hiding their IP address.
 
==Indexing the Deep Web==
While it is not always possible to directly discover a specific web server's content so that it may be indexed, a site potentially can be accessed indirectly (due to [[Vulnerability (computing)|computer vulnerabilities]]).
 
To discover content on the web, search engines use web crawlers that follow hyperlinks through known protocol virtual [[port numbers]]. This technique is ideal for discovering content on the surface web but is often ineffective at finding deep web content. For example, these crawlers do not attempt to find dynamic pages that are the result of database queries due to the indeterminate number of queries that are possible.<ref name="wright2009">{{cite news
| last = Wright
| first = Alex
| title = Exploring a 'Deep Web' That Google Can’t Grasp
| work = The New York Times
| date = 2009-02-22
| url = http://www.nytimes.com/2009/02/23/technology/internet/23search.html?th&emc=th
| accessdate = 2009-02-23}}</ref> It has been noted that this can be (partially) overcome by providing links to query results, but this could unintentionally inflate the popularity for a member of the deep web.
 
[[DeepPeep]], [[Intute]], [[Deep Web Technologies]], [[Scirus]], and Ahmia.fi are a few search engines that have accessed the deep web. Intute ran out of funding and is now a temporary static archive as of July, 2011.<ref>{{cite web | url=http://www.intute.ac.uk/faq.html | title=Intute FAQ | accessdate=October 13, 2012}}</ref> Scirus retired near the end of January, 2013.<ref>http://library.bldrdoc.gov/news.html/</ref>
 
Researchers have been exploring how the deep web can be crawled in an automatic fashion, including content that can be accessed only by special software such as Tor. In 2001, Sriram Raghavan and Hector Garcia-Molina (Stanford Computer Science Department, Stanford University)<ref name = raghavan2000>{{cite paper
| author = [http://www.almaden.ibm.com/cs/people/rsriram/ Sriram Raghavan]
| first2 = Hector | last2 = Garcia-Molina
| title = Crawling the Hidden Web
| publisher = Stanford Digital Libraries Technical Report
| year = 2000
| url = http://ilpubs.stanford.edu:8090/456/1/2000-36.pdf
| format = PDF
| accessdate = 2008-12-27}}</ref><ref>{{cite conference |first=Sriram |last=Raghavan |author2=Garcia-Molina, Hector | year = 2001 | title = Crawling the Hidden Web | booktitle = Proceedings of the 27th International Conference on Very Large Data Bases (VLDB) | pages = 129–38 | url = http://www.dia.uniroma3.it/~vldbproc/017_129.pdf |format=PDF}}</ref> presented an architectural model for a hidden-Web crawler that used key terms provided by users or collected from the query interfaces to query a Web form and crawl the Deep Web content. Alexandros Ntoulas, Petros Zerfos, and Junghoo Cho of [[UCLA]] created a hidden-Web crawler that automatically generated meaningful queries to issue against search forms.<ref>{{cite paper
| first = Ntoulas
| last = Alexandros
| authorlink =
| first2 = Petros | last2 = Zerfos | first3 = Junghoo | last3 = Cho
| title = Downloading Hidden Web Content
| version =
| publisher = [[UCLA]] Computer Science
| year = 2005
| url = http://oak.cs.ucla.edu/~cho/papers/ntoulas-hidden.pdf
| format = PDF
| accessdate = 2009-02-24}}</ref> Several form query languages (e.g., DEQUEL<ref>{{cite paper
| first = Denis
| last = Shestakov
| authorlink =
| first2 = Sourav S. | last2 = Bhowmick | first3 = Ee-Peng | last3 = Lim
| title = DEQUE: Querying the Deep Web
| journal = Data & Knowledge Engineering 52(3)
| pages = 273–311
| version =
| publisher =
| year = 2005
| url = http://www.mendeley.com/download/public/1423991/3893295922/dc0f7d824fd2a8fbbc84f6fdf9e4f337d343987d/dl.pdf
| format = PDF}}</ref>) have been proposed that, besides issuing a query, also allow extraction of structured data from result pages. Another effort is [[DeepPeep]], a project of the [[University of Utah]] sponsored by the [[National Science Foundation]], which gathered hidden-web sources (web forms) in different domains based on novel focused crawler techniques.<ref>{{cite paper
| first = Luciano
| last = Barbosa
| authorlink =
| first2 = Juliana | last2 = Freire
| title = An Adaptive Crawler for Locating Hidden-Web Entry Points
| version =
| publisher = WWW Conference 2007
| year = 2007
| url = http://www.cs.utah.edu/~lbarbosa/publications/ache-www2007.pdf
| format = PDF
| accessdate = 2009-03-20}}</ref><ref>{{cite paper
| first = Luciano
| last = Barbosa
| authorlink =
| first2 = Juliana | last2 = Freire
| title = Searching for Hidden-Web Databases.
| version =
| publisher = WebDB 2005
| year = 2005
| url = http://www.cs.utah.edu/~lbarbosa/publications/webdb2005.pdf
| format =
| accessdate = 2009-03-20}}</ref>
 
Commercial search engines have begun exploring alternative methods to crawl the deep web. The [[Sitemap Protocol]] (first developed, and introduced by Google in 2005) and [[mod oai]] are mechanisms that allow search engines and other interested parties to discover deep web resources on particular web servers. Both mechanisms allow web servers to advertise the URLs that are accessible on them, thereby allowing automatic discovery of resources that are not directly linked to the surface web. Google's deep web surfacing system computes submissions for each HTML form and adds the resulting HTML pages into the Google search engine index. The surfaced results account for a thousand queries per second to deep web content.<ref>{{cite paper
| first = Jayant
| last = Madhavan
| authorlink =
| first2 = David | last2 = Ko | first3 = Łucja | last3 = Kot | first4 = Vignesh | last4 = Ganapathy | first5  = Alex | last5 = Rasmussen | first6 = Alon | last6 = Halevy
| title = Google’s Deep-Web Crawl
| version =
| publisher = VLDB Endowment, ACM
| year = 2008
| url = http://www.cs.cornell.edu/~lucja/Publications/I03.pdf
| format = PDF
| accessdate = 2009-04-17}}</ref> In this system, the pre-computation of submissions is done using three algorithms:
# selecting input values for text search inputs that accept keywords,
# identifying inputs which accept only values of a specific type (e.g., date), and
# selecting a small number of input combinations that generate URLs suitable for inclusion into the Web search index.
 
In 2008, to facilitate users of [[Tor (anonymity network)#Hidden services|Tor hidden services]] in their access and search of a hidden [[.onion]] suffix, [[Aaron Swartz]] designed [[Tor2web]]—a proxy application able to provide access by means of common web browsers.<ref name=RELEASE>{{cite web|last=Aaron|first=Swartz|title=In Defense of Anonymity|url=http://www.aaronsw.com/weblog/tor2web|accessdate=4 February 2014}}</ref> Using this application, deep web links appear as a random string of letters followed by the .onion TLD. For example, <nowiki>http://xmh57jrzrnw6insl.onion</nowiki> links to TORCH, the Tor search engine web page.
 
==Classifying resources==
Most of the work of classifying search results has been in categorizing the surface web by topic. For classification of deep web resources, [[Panos Ipeirotis|Ipeirotis]] et al.<ref>
{{cite conference |first=Panagiotis G. |last=Ipeirotis | last2 = Gravano | first2 = Luis | last3 = Sahami | first3 = Mehran | year = 2001 | title = Probe, Count, and Classify: Categorizing Hidden-Web Databases | booktitle = Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data | pages = 67–78 | url = http://qprober.cs.columbia.edu/publications/sigmod2001.pdf|format=PDF}}</ref> presented an algorithm that classifies a deep web site into the category that generates the largest number of hits for some carefully selected, topically-focused queries. Deep web directories under development include [[OAIster]] at the [[University of Michigan]], [[Intute]] at the [[University of Manchester]], Infomine<ref>[http://infomine.ucr.edu UCR.edu]</ref> at the [[University of California, Riverside]], and DirectSearch (by [[Gary Price (librarian)|Gary Price]]).
 
This classification poses a challenge while searching the deep web whereby two levels of categorization are required. The first level is to categorize sites into vertical topics (e.g., health, travel, automobiles) and sub-topics according to the nature of the content underlying their databases.
 
The more difficult challenge is to categorize and map the information extracted from multiple deep web sources according to end-user needs. Deep web search reports cannot display URLs like traditional search reports. End users expect their search tools to not only find what they are looking for, but to be intuitive and user-friendly. In order to be meaningful, the search reports have to offer some depth to the nature of content that underlie the sources or else the end-user will be lost in the sea of URLs that do not indicate what content lies beneath them. The format in which search results are to be presented varies widely by the particular topic of the search and the type of content being exposed. The challenge is to find and map similar data elements from multiple disparate sources so that search results may be exposed in a unified format on the search report irrespective of their source.
 
==See also==
* [[Dark Internet]]
* [[Darknet (overlay network)]]
* [[TorChat]]
* [[TrueCrypt]]
* [[I2P]]
** [[iMule]]
** [[I2PSnark]]
* [[Tor (anonymity network)|Tor]]
* [[Tor2web]]
* [[Gopher protocol]]
* [[The Hidden Wiki]]
* [[Freenet]]
* [[GPG]]
** [[gpg4usb]]
** [[GPG Suite]]
* [[Bitcoin]]
* [[BCWipe]]
* [[Telegram]]
* [[Tribler]]
 
==References==
<references/>
 
==Further reading==
{{refbegin}}
* {{citation | last = Barker | first = Joe | date = Jan 2004 | url = http://www.lib.berkeley.edu/TeachingLib/Guides/Internet/InvisibleWeb.html | contribution = Invisible Web: What it is, Why it exists, How to find it, and its inherent ambiguity | publisher = UC | place = Berkeley, CA, USA | title = Teaching Library Internet Workshops}}.
* {{citation | first = Saikat | last = Basu | url = http://www.makeuseof.com/tag/10-search-engines-explore-deep-invisible-web/ | title = 10 Search Engines to Explore the Invisible Web | publisher = MakeUseOf.com | date = March 14, 2010}}.
* {{citation | last = Ozkan | first = Akin | date = Nov 2014 | url = http://akinozkan.com/deep-web-derin-internet/ | title = DEEP WEB /DERİN İNTERNET}}.
* {{citation | last = Gruchawka | first = Steve | date = June 2006 | url = http://techdeepweb.com/ | title = How-To Guide to the Deep Web}}.
* {{citation | last = Hamilton | first = Nigel | year = 2003 | url = http://www2003.org/cdrom/papers/poster/p170/poster/poster.html | title = The Mechanics of a Deep Net Metasearch Engine | publisher = 12th World Wide Web Conference}}.
* {{cite conference |first=Bin |last=He | last2 = Chang | first2 = Kevin Chen-Chuan | year = 2003 | title = Statistical Schema Matching across Web Query Interfaces | booktitle = Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data | url = http://eagle.cs.uiuc.edu/pubs/2003/unifiedschema-sigmod03-hc-mar03.pdf|format=PDF | archiveurl = http://web.archive.org/web/20110720085124/http://eagle.cs.uiuc.edu/pubs/2003/unifiedschema-sigmod03-hc-mar03.pdf |archivedate = 20 July 2011}}
* {{citation | last = Howell O'Neill | first = Patrick | date = October 2013 | publisher = The Daily Dot | url = http://www.dailydot.com/technology/how-to-search-the-deep-web/ | title = How to search the Deep Web}}.
* {{cite conference |first=Panagiotis G. |last=Ipeirotis | last2 = Gravano | first2 = Luis | last3 = Sahami | first3 = Mehran | year = 2001 | title = Probe, Count, and Classify: Categorizing Hidden-Web Databases | booktitle = Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data | pages = 67–78 | url = http://qprober.cs.columbia.edu/publications/sigmod2001.pdf |format=PDF}}
* {{cite journal |last=King |first=John D. | last2 = Li | first2 = Yuefeng | last3 = Tao | first3 = Daniel | last4 = Nayak | first4 = Richi | title = Mining World Knowledge for Analysis of Search Engine Content | journal = Web Intelligence and Agent Systems: an International Journal | pages = 233–53 |date=November 2007 | volume = 5 | issue = 3 | url = http://sky.fit.qut.edu.au/~kingj2/downloads/king07mining.pdf|format=PDF}}
* {{cite journal | last = McCown | first = Frank | last2 = Liu | first2 = Xiaoming | last3 = Nelson | first3 = Michael L. | last4 = Zubair | first4 = Mohammad | title = Search Engine Coverage of the OAI-PMH Corpus | journal = [[IEEE Internet Computing]] | pages = 66–73 |date=March–April 2006 | volume = 10 | issue = 2 | url = http://library.lanl.gov/cgi-bin/getfile?LA-UR-05-9158.pdf |format=PDF| doi = 10.1109/MIC.2006.41}}
* {{cite book |last=Price |first=Gary |authorlink= Gary Price (librarian) | last2 = Sherman | first2 = Chris | title= The Invisible Web: Uncovering Information Sources Search Engines Can't See |date=July 2001 |publisher=CyberAge Books |location= |isbn=0-910965-51-X }}
* Shestakov, Denis (June 2008). ''[https://oa.doria.fi/handle/10024/38506 Search Interfaces on the Web: Querying and Characterizing]''. TUCS Doctoral Dissertations 104, University of Turku
* {{citation | url = http://www.washingtonpost.com/wp-dyn/content/article/2008/12/10/AR2008121003241.html | title = Firms Push for a More Searchable Federal Web | work = The Washington Post | date = December 11, 2008 | page = D01 | first = Peter | last = Whoriskey}}.
* {{citation | last = Wright | first = Alex | date = Mar 2004 | url = http://www.salon.com/tech/feature/2004/03/09/deep_web/ | title = In Search of the Deep Web | work = Salon | archiveurl = http://archive.salon.com/tech/feature/2004/03/09/deep_web/index_np.html | archivedate = 9 March 2007}}.
{{refend}}
 
{{Tor (anonymity network)}}
 
== External links ==
* [[The Uncensored Hidden Wiki]] - http://ev3h5yxkjz4hin75.onion/wiki/index.php/Main_Page
 
* [[The Hidden Wiki]](fake) - http://kpvz7ki2lzvnwve7.onion/index.php/Main_Page
 
[[Category:Deep Web]]
[[Category:Anonymity]]
[[Category:Security]]

Revision as of 22:12, 22 October 2016

  • ATTENTION*THIS*SCAM*WIKI*IS*RUN*BY*ISIS*TERRORIST*ORGANIZATION*ALL*LINKS*ARE*SCAM*ALL*INFO*MISLEADING*WILL*BRING*YOU*TO*PRISON*
Retrieved from "http://hiddenwep33eg4w225lcdwcez4iefacwpiia6cwg7pfmcz4hvijzbgid.onion/index.php?title=Deep_web&oldid=9557"