CRAGOct 15, 2020

Fully Homomorphic Encryption via Affine Automorphisms

arXiv:2010.08002v11 citations
Originality Synthesis-oriented
AI Analysis

This work addresses cybersecurity needs by providing a potentially powerful encryption method for secure data processing, though it appears incremental as it builds on existing multivariate encryption techniques.

The paper tackled the problem of enabling computations on encrypted data by proposing a homomorphic encryption method using automorphisms of affine space for straight-line programs, resulting in a new approach based on multivariate encryption and algebraic geometry techniques.

Homomorphic encryption is a method used in cryptopgraphy to create programs that can interact with encrypted data without ever leaving the data in the clear. This has many potential applications in cybersecurity. This paper uses automorphisms of affine space to create a form of homomorphic encryption for straight line programs. The encryption method used for the data is known as multivariate encryption. This gives a potentially powerful new method in cyber security based on techniques from algebraic geometry.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes