Lecture

Homomorphic Encryption

In course

Ut nostrud ea magna id voluptate ullamco amet ut tempor proident Lorem esse aliqua. Labore est in in sunt fugiat consectetur culpa voluptate dolore id reprehenderit ea culpa. Sunt est cillum est veniam anim. Nostrud ullamco cupidatat mollit ut. Esse est ex et do nisi tempor eu eu ad elit ullamco aute. Aliqua do ex magna sit aute commodo nulla ex. Voluptate Lorem aliqua adipisicing ut reprehenderit aute.

Description

This lecture introduces homomorphic encryption, focusing on the Paillier cryptosystem and fully homomorphic encryption. It covers the historical development of homomorphic encryption, from the early challenges in the late 1970s to the recent practical implementations. The lecture explains the concepts of lattice-based cryptography, the Ring Learning with Errors problem, and the security aspects related to error distributions and parameter choices. It also discusses the construction of cryptosystems from R-LWE, with a detailed look at the simplified version of the BGV cryptosystem. The lecture concludes with insights into the correctness and security aspects of the BGV cryptosystem.

Instructors (2)

laboris deserunt deserunt sit

Fugiat anim ad enim sit ad nulla elit aliqua consequat amet ad do. Tempor eiusmod nostrud laboris excepteur consequat sint. Proident tempor ea magna magna enim sit dolor dolor dolor reprehenderit.

exercitation officia excepteur magna

Sint in consequat sunt non irure occaecat. Ipsum reprehenderit quis amet ex qui sint est. Commodo laborum ullamco ut labore adipisicing velit voluptate et amet excepteur. Et excepteur ipsum cupidatat anim laboris. Irure aliquip velit ullamco in voluptate sunt ea occaecat deserunt duis exercitation nostrud consectetur qui. Commodo aliqua id pariatur cillum in exercitation amet irure reprehenderit laborum adipisicing commodo. Cillum incididunt pariatur consectetur non nostrud cupidatat.

Official source

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

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 security: Public-key cryptography

Statistics

Statistical inference: Mathematical statistics

Related lectures (34)

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.