6 citations · 11 across the 4 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2003★ 4 cited
Homomorphic public-key cryptosystems over groups and rings
Dima Grigoriev, Ilia Ponomarenko
We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membership problem for groups of integer matrices. Besid…
cs.CR2003★ 1 cited
Homomorphic public-key cryptosystems and encrypting boolean circuits
Dima Grigoriev, Ilia Ponomarenko
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 logarith…
cs.CR2002★ 6 cited
On non-abelian homomorphic public-key cryptosystems
D. Grigoriev, I. Ponomarenko
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G…