Modern techniques in somewhat homomorphic encryption

The term “homomorphism” was introduced in cryptography by Rivest, Adleman, and Dertouzos in 1978 to address performing calculations on encrypted data without decryption. Since then, researchers have increasingly aimed to design schemes supporting numerous operations. This article aims to synthesize...

Full description

Saved in:
Bibliographic Details
Published inJournal of mathematical cryptology Vol. 19; no. 1; pp. 51 - 61
Main Authors Giulietti, Massimo, Martinelli, Paolo, Timpanella, Marco
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 14.04.2025
Walter de Gruyter GmbH
Subjects
94A60
Encryption
homomorphic encryption
Homomorphisms
learning with errors
somewhat homomorphic encryption
Online AccessGet full text

Cover

More Information
Summary:The term “homomorphism” was introduced in cryptography by Rivest, Adleman, and Dertouzos in 1978 to address performing calculations on encrypted data without decryption. Since then, researchers have increasingly aimed to design schemes supporting numerous operations. This article aims to synthesize the current state of the art in the so-called somewhat homomorphic encryption.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1862-2984
1862-2976
1862-2984
DOI:10.1515/jmc-2024-0041