Homomorphic public-key cryptosystems and encrypting boolean circuits

2003/01/22 by Dima Grigoriev, Grigoriev, Dima, Ilia Ponomarenko +1
Computer Science · #Cryptography and Data Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #E.3.3 #FOS: Computer and information sciences #Polynomial and algebraic computation #cs.CR

paper · pdf · doi:10.48550/arxiv.cs/0301022

openalex publication_date 2003/01/22 · arxiv created 2003/02/28 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over an appropriate finitely generated group.

Citations

• On non-abelian homomorphic public-key cryptosystems

Related

• Homomorphic public-key cryptosystems over groups and rings
• On non-abelian homomorphic public-key cryptosystems
• Practical Homomorphic Encryption Over the Integers
• A New Symmetric Homomorphic Functional Encryption over a Hidden Ring for Polynomial Public Key Encapsulations
• Homomorphic Encryption of Intuitionistic Logic Proofs and Functional Programs: A Categorical Approach Inspired by Composite-Order Bilinear Groups