Prof. Nigel Smart | Fully Homomorphic Encryption

Prof. Nigel Smart | Fully Homomorphic Encryption

by Prof. Nigel Smart

Formal & Physical Sciences Computing & Cybersecurity URComputer securityURYData encryption
🎙 Prof. Nigel Smart 👥 8K 📅 December 15, 2025 ⏱ 31 min 👁 386 📄 expert opinion 🧭 2026-08-15
Available in: English (current) Français

Keywords

fully homomorphic encryptionring learning with errorsnoisebootstrappingSIMD

Summary

In this seminar, Professor Nigel Smart provides an overview of fully homomorphic encryption (FHE), a cryptographic technique that allows computation on encrypted data without decrypting it. He motivates the need for FHE with a medical database example, where a doctor needs to query encrypted patient records without exposing the data. He explains the historical context, noting that the concept was proposed in 1978 but only realized by Craig Gentry in 2009. Smart then introduces the mathematical framework, focusing on ring learning with errors (RLWE) and the use of cyclotomic polynomial rings. He describes the encryption scheme, the addition and multiplication operations, and the challenge of noise growth. He discusses key techniques like key switching, modulus switching, and bootstrapping, and mentions recent progress in implementing FHE with polylog overhead. He concludes by highlighting open problems, particularly efficient bootstrapping, and notes that current implementations are still impractical for many applications.

148 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides valuable insights into the state of FHE as of 2012, explaining both the theoretical foundations and practical challenges. Smart’s argumentation is clear and logical, building from the motivation to the technical details. He effectively communicates the significance of FHE and the obstacles to its practical deployment. The discussion of noise management and the need for bootstrapping is particularly illuminating.

Scientific Rigor, Source Quality, Title Accuracy

The presentation is scientifically rigorous, with accurate descriptions of the mathematical concepts and references to key works such as Gentry’s thesis and recent papers. The title accurately reflects the content. The speaker is a recognized expert, and the talk is part of a seminar series at the Isaac Newton Institute, adding to its credibility.

131 words

Title / Content Match

The title accurately reflects the content, which is a lecture on fully homomorphic encryption.

Quality & Reliability

8/10

Presentation by a recognized expert in cryptography, with a clear technical exposition of the mathematical foundations and current state of fully homomorphic encryption. The content is accurate and well-structured, though it is a high-level overview without detailed proofs.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

Contribution & Novelties

The talk provides a concise yet comprehensive overview of fully homomorphic encryption as of 2012, highlighting the mathematical foundations and recent advances. It emphasizes the practical challenges and open problems, particularly the efficiency of bootstrapping. The presentation is valuable for researchers and practitioners seeking an accessible introduction to FHE.

Pour aller plus loin :

92 words

Radar Profile

The radar profile shows high scores across all dimensions, indicating a well-balanced and informative presentation. The talk excels in information quality and reliability, with a strong technical depth, though the quantity of information is slightly lower due to the short duration.

Reliability 9/10

💬 No comments were provided for analysis.