Lecture

Anonymity in Communication: Tor and Cryptographic Protocols

Graph Chat

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.

Description

This lecture by the instructor explores the concept of anonymity in communication, focusing on the development of Tor, the limitations of Chaum's cryptographic protocols, and the challenges in achieving perfect anonymity. The presentation covers the history of Tor, the vulnerabilities in the protocol, and the implications of cryptographic breakthroughs. It questions the feasibility of achieving complete anonymity in communication systems, using examples from forensics and cryptography. The lecture delves into the technical background of entropy, impossibility results in achieving perfect anonymity, and the possibilities of partial broadcast solutions. It concludes with open problems in achieving anonymity, the impact on e-voting, and the relevance of the research in digital forensics.

Official source

Related concepts (32)

Cryptography

Cryptography, or cryptology (from κρυπτός "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others.

Key (cryptography)

A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different sizes and varieties, but in all cases, the strength of the encryption relies on the security of the key being maintained. A key's security strength is dependent on its algorithm, the size of the key, the generation of the key, and the process of key exchange.

Cryptographic protocol

A cryptographic protocol is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences of cryptographic primitives. A protocol describes how the algorithms should be used and includes details about data structures and representations, at which point it can be used to implement multiple, interoperable versions of a program. Cryptographic protocols are widely used for secure application-level data transport.

Cryptographic primitive

Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer security systems. These routines include, but are not limited to, one-way hash functions and encryption functions. When creating cryptographic systems, designers use cryptographic primitives as their most basic building blocks. Because of this, cryptographic primitives are designed to do one very specific task in a precisely defined and highly reliable fashion.

Post-quantum cryptography

In cryptography, post-quantum cryptography (PQC) (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.

Related lectures (64)

Technologies for Identity & Anonymity

Explores technologies for identity and anonymity, including e-ID, social media identities, and cryptographic signatures.

E-Voting: Research and Challenges

Explores e-voting research, digital algorithms, privacy challenges, and cryptographic methods in ensuring legitimacy and participation.

Anonymous Communication: Motivations and Approaches

Explores motivations for anonymous communication and various approaches to achieve anonymity.

Privacy Technologies: Some Privacy Technologies (part II)

Explores anonymous communication systems, attribute-based credentials, the Tor network, and other privacy technologies.

Information in Networked Systems: Functional Representation and Data Compression