BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:815@lincs.fr
DTSTART;TZID=Europe/Paris:20240207T103000
DTEND;TZID=Europe/Paris:20240207T113000
DTSTAMP:20240419T093230Z
URL:https://www.lincs.fr/events/an-introduction-to-anonymity-networks/
SUMMARY:An introduction to anonymity networks
DESCRIPTION:Anonymity networks play a crucial role in preserving privacy on
 the Internet by masking users' identities and guaranteeing the
 confidentiality of communications. In this talk\, we will explore the
 origins of anonymisation networks through Chaum's seminal paper on mix
 networks [1]. Following this paper\, research in this area emerged and gave
 rise to four classes of anonymity networks [2]\, those based on mixnets\,
 those based on Tor and Onion Routing [3\,4]\, those based on random walks
 and DHTs\, and those based on DCNets [5]. There are others that fall into
 several classes [2].\nWe will present some popular networks from these
 classes and use them in a practical way to connect to different
 services.\n\n--\nReferences\n\n[1] D. Chaum\, Untraceable electronic mail\,
 return addresses\, and digital pseudonyms\, Communications of the ACM\,
 vol. 24\, no. 2\, pp. 84–90\, Feb. 1981\, doi: 10.1145/358549.358563.
 Available at:  https://www.doi.org/10.1145/358549.358563\n[2] F. Shirazi\,
 M. Simeonovski\, M. R. Asghar\, M. Backes\, and C. Diaz\, A Survey on
 Routing in Anonymous Communication Protocols\, ACM Computing Surveys\, vol.
 51\, no. 3\, p. 51:1-51:39\, Jun. 2018\, doi: 10.1145/3182658. Available
 at: 
 https://lirias.kuleuven.be/bitstream/123456789/626536/2/a51-shirazi.pdf\n[3
 ] R. Dingledine\, N. Mathewson\, and P. Syverson\, Tor: The
 Second-Generation Onion Router\, Defense Technical Information Center\,
 Fort Belvoir\, VA\, Jan. 2004. doi: 10.21236/ADA465464. Available at: 
 https://apps.dtic.mil/sti/citations/ADA465464\n[4] D. M. Goldschlag\, M. G.
 Reed\, and P. F. Syverson\, Hiding Routing information\, in Information
 Hiding\, R. Anderson\, Ed.\, in Lecture Notes in Computer Science. Berlin\,
 Heidelberg: Springer\, 1996\, pp. 137–150. doi: 10.1007/3-540-61996-8_37.
 Available at:  https://www.doi.org/10.1007/3-540-61996-8_37\n[5] D. Chaum\,
 The dining cryptographers problem: Unconditional sender and recipient
 untraceability\, J. Cryptology\, vol. 1\, no. 1\, pp. 65–75\, Jan. 1988\,
 doi: 10.1007/BF00206326. Available at: 
 https://www.doi.org/10.1007/BF00206326\n\nSLIDES
CATEGORIES:Practical Networks,Working Group,Youtube
LOCATION:Room 4B07\, 19 place Marguerite Perey\, Palaiseau\, Gabon
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\,
 Palaiseau\, Gabon;X-APPLE-RADIUS=100;X-TITLE=Room 4B07:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR