A fully homomorphic encryption scheme with symmetric keys with application to private data processing in clouds

Gupta, C. P.; Sharma, Iti

doi:10.1109/nof.2013.6724526

Cited by 29 publications

(21 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cryptosystems with homomorphic and probabilistic properties are more secure than cryptosystems with only homomorphic property. One of the homomorphic and probabilistic cryptosystems is symmetrical matrix cryptosystem, which are proposed in [27][28]. The matrix homomorphic cryptosystem [28] is presented as follows:…”

Section: Homomorphic Encryption Based On Matrix Methodsmentioning

confidence: 99%

“…(26) and Eq. (27). The correlation coefficients of four types selected speeches are calculated and tabulated in Table 2.…”

Section: Correlation Of Two Adjacent Samplesmentioning

confidence: 99%

“…Due to the above reasons, it is not desirable for processing digital speeches in public cloud computing. The emphasis is on the fact that certain applications do not require public key cryptographic primitives and burden of long and multiple keys in public key cryptosystems can be reduced by using symmetrical encryption, as pointed out in [27].…”

Section: Introductionmentioning

confidence: 99%

“…To solve the above problems, an efficient speech symmetrical homomorphic encryption scheme for secure speech storing is proposed in this paper. The proposed homomorphic encryption scheme is constructed mainly based on matrix homomorphic encryption [27][28], which is a fully homomorphic encryption scheme. The rest of this paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Speech Homomorphic Encryption Scheme with Less Data Expansion in Cloud Computing

2019

KSII TIIS

View full text Add to dashboard Cite

Speech homomorphic encryption has become one of the key components in secure speech storing in the public cloud computing. The major problem of speech homomorphic encryption is the huge data expansion of speech cipher-text. To address the issue, this paper presents a speech homomorphic encryption scheme with less data expansion, which is a probabilistic statistics and addition homomorphic cryptosystem. In the proposed scheme, the original digital speech with some random numbers selected is firstly grouped to form a series of speech matrix. Then, a proposed matrix encryption method is employed to encrypt that speech matrix. After that, mutual information in sample speech cipher-texts is reduced to limit the data expansion. Performance analysis and experimental results show that the proposed scheme is addition homomorphic, and it not only resists statistical analysis attacks but also eliminates some signal characteristics of original speech. In addition, comparing with Paillier homomorphic cryptosystem, the proposed scheme has less data expansion and lower computational complexity. Furthermore, the time consumption of the proposed scheme is almost the same on the smartphone and the PC. Thus, the proposed scheme is extremely suitable for secure speech storing in public cloud computing.

show abstract

Section: Homomorphic Encryption Based On Matrix Methodsmentioning

confidence: 99%

“…(26) and Eq. (27). The correlation coefficients of four types selected speeches are calculated and tabulated in Table 2.…”

Section: Correlation Of Two Adjacent Samplesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Speech Homomorphic Encryption Scheme with Less Data Expansion in Cloud Computing

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Authors in [42,43] emphasized on the need of symmetric FHE schemes because certain applications inherently need secret keys and proposed Fully Homomorphic schemes with symmetric keys based on matrix operations. The time complexity has been claimed to be linear in the security parameter λ.…”

Section: Gupta Et Al (2013 2014 2015)mentioning

confidence: 99%

Achieving Fully Homomorphic Encryption in Security - A Survey

Soral¹,

Scholar²

2016

IJCSE

View full text Add to dashboard Cite

Many conventional cryptographic systems have homomorphic properties, yet there was no need of homomorphisms and little attention was paid to it. The ability to process encrypted data led to a renewed interest in Homomorphisms and a new cryptographic primitive, Fully Homomorphic Encryption (FHE) emerged. With time, question arose as to whether FHE is possible or not which has now modified as whether FHE is applicable or not. This paper provides a brief survey focusing on the development of HE to FHE and discussing all relevant research works in this direction in one section. The second section discusses the applications of FHE. The last section describes briefly some of the research works aiming at Searching/Sorting through FHE.

show abstract