Lecture

Privacy-Preserving Crypto I

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.

In course

CS-523: Advanced topics on privacy enhancing technologies

This advanced course will provide students with the knowledge to tackle the design of privacy-preserving ICT systems. Students will learn about existing technologies to prect privacy, and how to evaluate the protection they provide. ...

Description

This lecture covers Secure Multiparty Computation (SMC) techniques, focusing on the Danish Sugar Beets Auction as a historic example. It introduces the theoretical framework of SMC, the SecureSum protocol, and the design of secure protocols. The lecture explains the concepts of Network Model, Adversarial Model, and Security Guarantees in the context of SMC. It delves into the Real/Ideal Simulation Paradigm, proving security in passive and malicious adversary models. The lecture also discusses Garbled Circuits, Oblivious Transfer, and Shamir Secret Sharing, highlighting their applications and operations. Finally, it explores the combination of SMC with Homomorphic Encryption and references key works in the field.

Instructors (2)

Alessandro Chiesa

Alessandro Chiesa is a faculty member in computer science. He conducts research in complexity theory, cryptography, and security, with a focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. He is a co-author of several zkSNARK libraries, and is a co-inventor of the Zerocash protocol. He has co-founded Zcash and StarkWare Industries. He is a recipient of a Sloan Research Fellowship (2021), an Okawa Foundation Research Grant (2020), and Google Faculty Research Awards (2018 and 2017). He was included in MIT Technology Review's "35 Innovators Under 35" list in 2018.

Carmela González Troncoso

SPRING Lab Our research focuses on building secure and privacy-preserving systems. We aim to develop tools and methodologies to help engineers embedding strong security and privacy guarantees in their designs, as well as techniques that help them to systematically quantifying the information that an adversary can infer from data she may have access to.More information about our activities here: https://spring.epfl.ch/ Teaching & PhD PhD Students Saiid El Hajj Chehade, Eric Jollès, Christian Knabenhans, Boy

Official source

Ontological neighbourhood

Computer engineering

Computer security: Public-key cryptography

Related concepts (32)

Secure multi-party computation

Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography with the goal of creating methods for parties to jointly compute a function over their inputs while keeping those inputs private. Unlike traditional cryptographic tasks, where cryptography assures security and integrity of communication or storage and the adversary is outside the system of participants (an eavesdropper on the sender and receiver), the cryptography in this model protects participants' privacy from each other.

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.

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.

Oblivious transfer

In cryptography, an oblivious transfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece (if any) has been transferred. The first form of oblivious transfer was introduced in 1981 by Michael O. Rabin. In this form, the sender sends a message to the receiver with probability 1/2, while the sender remains oblivious as to whether or not the receiver received the message.

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.

Related lectures (64)

Secure Collaborative Systems: Building Efficient Protocols for Linear Models

Explores building efficient protocols for linear models in secure collaborative systems, emphasizing security guarantees and computational efficiency.

Secure Multiparty Computation: Danish Sugar Beets Auction

Explores the Danish Sugar Beets Auction, Secure Multiparty Computation, and the design of secure protocols for privacy and correctness.

Privacy-preserving authentication

Explores privacy-preserving authentication methods, zero-knowledge proofs, Schnorr's proof of identification, and their real-world applications.

Homomorphic Encryption: Delegating Calculations Securely

Explores homomorphic encryption, enabling secure computations on encrypted data without data exposure, with applications in healthcare and finance.

Introduction to Cryptography: Fundamentals and Applications