Homomorphic public-key cryptosystems and encrypting Boolean circuits

DOI10.1007/s00200-006-0005-xzbMath1104.94022arXivcs/0301022OpenAlexW1984008208WikidataQ122999308 ScholiaQ122999308MaRDI QIDQ2432559

Ilya Nikolaevich Ponomarenko, Dima Yu. Grigoriev

Publication date: 25 October 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0301022

zbMATH Keywords

Encrypting boolean circuitsFree product of groupsHomomorphic cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Automorphisms, homomorphisms, endomorphisms, etc. for abelian groups (20K30)

Related Items

Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem ⋮ Using Decision Problems in Public Key Cryptography ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer

Cites Work

• Non-uniform automata over groups
• Probabilistic encryption
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Public-key cryptography and invariant theory
• Probabilistic Algorithms in Finite Fields
• A Fast Monte-Carlo Test for Primality
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item