Lecture

Privacy Preserving Crypto I: Secure Multi-Party Computation

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 covers Secure Multi-Party Computation (SMC) as a toolbox for privacy engineering, focusing on cryptographic techniques, Boolean and arithmetic circuits, and protocols like Yao's Garbled Circuits. It explains the security properties, threat models, and the ideal-world equivalent. The lecture also delves into the concept of honest but curious vs malicious parties, the use of additive secret shares, and Shamir's Secret Sharing. Real-world applications of SMC are discussed, such as the Estonian Study on graduation rates and data privacy in government agencies like the Tax Board and Ministry of Education, showcasing the benefits of MPC frameworks like Sharemind.

Official source

Related concepts (32)

Boolean circuit

In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.

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.

Circuit (computer science)

In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates.

Circuit complexity

In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits (see below). Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a popular approach to separating complexity classes.

Boolean algebra

In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (and) denoted as ∧, disjunction (or) denoted as ∨, and the negation (not) denoted as ¬.

Related lectures (64)

Homomorphic Encryption: Cloud and Aggregation

Explores homomorphic encryption for secure cloud computing and data aggregation.

Homomorphic Encryption: Delegating Calculations Securely

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

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.

Privacy Technologies: Some Privacy Technologies (part II)

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

Internet Capsules: Opportunities and Dangers