A New Distribution Version of Boneh-Goh-Nissim Cryptosystem: Security and performance analysis

07/16/2019
by   Oualid Benamara, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2018

A Secure Multiple Elliptic Curves Digital Signature Algorithm for Blockchain

Most cryptocurrency systems or systems based on blockchain technology ar...
research
01/16/2020

Semantic Security for Quantum Wiretap Channels

We determine the semantic security capacity for quantum wiretap channels...
research
02/25/2023

A One-way Secret Key Agreement with Security Against Active Adversaries

In a one-way secret key agreement (OW-SKA) protocol in source model, Ali...
research
12/21/2021

A Survey on Perfectly-Secure Verifiable Secret-Sharing

Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure dis...
research
02/27/2019

Efficient and Secure ECDSA Algorithm and its Applications: A Survey

Public-key cryptography algorithms, especially elliptic curve cryptograp...
research
03/21/2019

Semantic Security on Wiretap Channels using Universal Hashing with Fading Applications

We furnish a procedure based on universal hash families (UHFs) that can ...
research
11/23/2020

On InstaHide, Phase Retrieval, and Sparse Matrix Factorization

In this work, we examine the security of InstaHide, a scheme recently pr...

Please sign up or login with your details

Forgot password? Click here to reset