Lecture

Fully Homomorphic Encryption (FHE)

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

MATH-489: Number theory II.d - Cryptography

. ...

Description

This lecture introduces Fully Homomorphic Encryption (FHE) based on Gentry's scheme from 2009, explaining the process of homomorphic decryption, encryption, and multiplication. It covers the importance of choosing a small random integer for encryption, the necessity of correct decryption, and the growth of noise in the resulting ciphertext. The lecture emphasizes the limited homomorphic capacity and the correct evaluation of homomorphic multiplication.

Instructor

Dimitar Petkov Jetchev

Official source

Related concepts (32)

Lattice-based cryptography

Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof. Lattice-based constructions are currently important candidates for post-quantum cryptography. Unlike more widely used and known public-key schemes such as the RSA, Diffie-Hellman or elliptic-curve cryptosystems — which could, theoretically, be defeated using Shor's algorithm on a quantum computer — some lattice-based constructions appear to be resistant to attack by both classical and quantum computers.

Ring learning with errors

In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms, such as NewHope, designed to protect against cryptanalysis by quantum computers and also to provide the basis for homomorphic encryption. Public-key cryptography relies on construction of mathematical problems that are believed to be hard to solve if no further information is available, but are easy to solve if some information used in the problem construction is known.

Ideal lattice

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient.

Encryption

In cryptography, encryption is the process of encoding information. This process converts the original representation of the information, known as plaintext, into an alternative form known as ciphertext. Ideally, only authorized parties can decipher a ciphertext back to plaintext and access the original information. Encryption does not itself prevent interference but denies the intelligible content to a would-be interceptor. For technical reasons, an encryption scheme usually uses a pseudo-random encryption key generated by an algorithm.

Ciphertext

In cryptography, ciphertext or cyphertext is the result of encryption performed on plaintext using an algorithm, called a cipher. Ciphertext is also known as encrypted or encoded information because it contains a form of the original plaintext that is unreadable by a human or computer without the proper cipher to decrypt it. This process prevents the loss of sensitive information via hacking. Decryption, the inverse of encryption, is the process of turning ciphertext into readable plaintext.

Related lectures (53)

Block Ciphers: Modes and WiFi Security

Explores block ciphers, stream ciphers, and WiFi security vulnerabilities, emphasizing the importance of encryption in modern communication.

Perfect Secrecy: One-time Pad

Explores perfect secrecy, the one-time pad encryption method, attacks on encryption systems, and the Vigenère cipher.

Homomorphic Encryption

Introduces homomorphic encryption, enabling computation on encrypted data without decryption, covering security, applications, and practical aspects.

Stream Ciphers: Buteforce Inversion Algorithms

Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Introduction to Cryptography: Basic Concepts