A New Distribution Version of Boneh-Goh-Nissim Cryptosystem: Security and performance analysis
This work addresses the need for secure and efficient distributed cryptosystems, but it is incremental as it builds upon existing Boneh-Goh-Nissim and ElGamal schemes.
The paper tackles the problem of distributing the Boneh-Goh-Nissim Cryptosystem by proposing two distributed versions, with the first proven semantically secure against active non-adaptive adversaries and the second shown to be computationally more efficient than the ElGamal distributed elliptic curve cryptosystem while secure under the Subgroup Decision problem assumption.
The aim of this paper is to provide two distributed versions of the Boneh-Goh-Nissim Cryptosystem (BGNC). We give a proof of the semantic security for the first one. This guaranties that our algorithm is semantically secure in the contest of active non-adaptive adversaries. Furthermore, we prove that the second version of our distributed scheme is computationally more efficient than the ElGamal destributed elliptic curve cryptosystem (EDECC) and secure under the Subgroup Decision problem (SDP) assumption.