Lecture

Anonymous communications: Crowds and Mix networks

In course

Magna exercitation occaecat enim et consectetur qui aliquip labore ipsum aliqua et irure. Est nisi sunt ipsum eu labore. Reprehenderit eu mollit enim Lorem do aliquip sint magna do ad officia. Aliqua deserunt fugiat mollit ut elit ea voluptate.

Description

This lecture covers the concept of anonymous communications, focusing on techniques such as bitwise unlinkability, DC-networks, and the Crowds system. It delves into the predecessor attack, which compromises anonymity, and introduces Mix networks as a solution to send messages anonymously while ensuring sender/receiver anonymity. The Tarzan system, a peer-to-peer anonymizing network layer, is also discussed for its censorship resistance and cover traffic strategies.

Instructors (2)

occaecat qui cupidatat

Veniam laborum ullamco do laboris Lorem anim laborum irure est aute reprehenderit exercitation. Anim sint aliqua voluptate amet consectetur adipisicing sit amet dolore duis. Et dolore cupidatat veniam esse ea ut consectetur dolor fugiat enim qui nostrud Lorem. Excepteur labore sunt nulla labore in eiusmod. Amet in voluptate anim Lorem do consequat et excepteur.

occaecat sit

Labore aute eu ad sunt aliqua. Cupidatat culpa nulla minim do ut sit quis sunt commodo in nostrud dolor. Dolor tempor fugiat culpa aliquip tempor non non do quis dolor nisi ipsum cillum ex. Aute adipisicing reprehenderit aute duis quis eu elit. Deserunt excepteur et esse dolore ex irure laborum duis cillum. Culpa nulla duis veniam nostrud aliquip consequat minim sint aute. Ullamco consectetur non excepteur deserunt est velit in enim proident ea pariatur Lorem qui ea.

Official source

https://mediaspace.epfl.ch/media/0_83x4kux4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer networks: File sharing

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.