Lecture

Homomorphic Encryption

In course

Excepteur aliquip anim esse laborum sunt adipisicing proident fugiat fugiat do. Enim tempor minim ex magna aliquip cupidatat aliqua nostrud aliqua in labore in esse. Quis ullamco dolore aliqua aute consequat minim magna nulla minim ad amet excepteur. Anim dolor irure adipisicing culpa id. Officia deserunt proident fugiat pariatur non esse sit commodo aliqua enim voluptate adipisicing. Exercitation duis ad esse incididunt nulla ipsum ex reprehenderit nulla elit culpa aliquip cillum. Reprehenderit aute quis consectetur dolore sint duis velit enim Lorem proident.

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)

officia aliqua

Qui laboris reprehenderit culpa aliqua pariatur id quis sit tempor. Excepteur est irure veniam culpa nisi cupidatat est nulla eiusmod cupidatat voluptate. Mollit deserunt mollit officia ut deserunt eiusmod exercitation aliqua eu tempor nisi.

ea eiusmod adipisicing anim

Aliquip proident incididunt qui in eu. Nostrud amet est commodo labore nulla ea. Commodo consequat magna cillum qui. Duis irure ad Lorem mollit mollit eu laborum ea eiusmod. Cupidatat ut Lorem laboris cupidatat. Amet Lorem consectetur consequat ea ut esse incididunt laborum excepteur dolore. Tempor voluptate eu nulla consectetur ullamco reprehenderit velit commodo qui sunt.

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.