A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle

Gong, Linming; Li, Shundong; Mao, Qing; Wang, Daoshun; Dou, Jun

doi:10.1016/j.tcs.2015.10.001

Cited by 5 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is a form of encryption in which mathematical operations are performed on encrypted text to achieve the encrypted result [11,12]. When this result is decrypted, it matches the result obtained by performing mathematical operations on plaintext.…”

Section: Homomorphic Encryptionmentioning

confidence: 99%

A Smart Card Oriented Secure Electronic Voting Machine Built on NTRU

Shaheen

Yousaf

Jalil

2019

IAJIT

View full text Add to dashboard Cite

Free and fair elections are indispensable to quantify the sentiments of the populace for forming the government of representatives in democratic countries. Due to its procedural variation from country to country and complexity, to maneuverer, it is a challenging task. Since the Orthodox paper-based electoral systems are slow and error-prone, therefore, a secure and efficient electoral system always remained a key area of research. Although a lot of literature is available on this topic. However, due to reported anomalies and weaknesses in American and France election in 2016, it once again has become a pivotal subject of research. In this article, we proposed a new secure and efficient electronic voting scheme based on public key cryptosystem dubbed as Number Theory Research Unit (NTRU). Furthermore, an efficient and robust three factors authentication protocol based on a personalized memorable password, a smartcard, and bioHash is proposed to validate the legitimacy of a voter for casting a legal vote. NTRU based blind signatures are used to preserve the anonymity and privacy of vote and voters, whereas the proficiency of secure and efficient counting of votes is achieved through NTRU based homomorphic tally. Non-coercibility and individual verifiability are attained through Mark Pledge scheme. The proposed applied electronic voting scheme is, secure, transparent and efficient for large scale elections.

show abstract

Section: Homomorphic Encryptionmentioning

confidence: 99%

A Smart Card Oriented Secure Electronic Voting Machine Built on NTRU

Shaheen

Yousaf

Jalil

2019

IAJIT

View full text Add to dashboard Cite

show abstract

“…On top of this, almost all of the existing FHE schemes are only proved to be secure under the CCA-1 model, and whether FHE can further achieve CCA-2 is still questionable. In 2016, Gong et al [142] attempted to construct a CCA-2 secure additive homomorphic encryption scheme, which was broken by Lee et al [143] recently. Therefore, how to achieve a CCA-2 secure FHE scheme is still an open question to be solved.…”

Section: Work With Access Control Mechanismmentioning

confidence: 99%

A Survey of Homomorphic Encryption for Outsourced Big Data Computation

Fun¹,

Samsudin²

2016

KSII TIIS

View full text Add to dashboard Cite

With traditional data storage solutions becoming too expensive and cumbersome to support Big Data processing, enterprises are now starting to outsource their data requirements to third parties, such as cloud service providers. However, this outsourced initiative introduces a number of security and privacy concerns. In this paper, homomorphic encryption is suggested as a mechanism to protect the confidentiality and privacy of outsourced data, while at the same time allowing third parties to perform computation on encrypted data. This paper also discusses the challenges of Big Data processing protection and highlights its differences from traditional data protection. Existing works on homomorphic encryption are technically reviewed and compared in terms of their encryption scheme, homomorphism classification, algorithm design, noise management, and security assumption. Finally, this paper discusses the current implementation, challenges, and future direction towards a practical homomorphic encryption scheme for securing outsourced Big Data computation.

show abstract

“…Based on Paillier's encryption scheme, Gong et al [5] proposed a construction asserted to be a CCA2-secure AHE scheme. The description of their construction is as follows:…”

Section: Gong Et Al's Schemementioning

confidence: 99%

“…In this section, we look into Gong et al's assertion of an additively homomorphic property for their scheme. In their original paper [5], the authors did not provide an addition algorithm on ciphertexts. Hence, we first present a typical candidate for an addition algorithm by considering existing AHE schemes defined over multiplicative groups and show that it does not preserve an additively homomorphic property.…”

Section: On the Additively Homomorphic Property Of Gong Et Al's Schemementioning

confidence: 99%

“…Very recently, Gong et al [5] presented quite a surprising result when they proposed a construction asserted to be an additively homomorphic encryption (AHE) scheme secure against CCA2. In seeking to achieve CCA2 security, they constructed an encryption scheme such that a message is located in the exponent to the base g ab , where g is a generator of the underlying group, a is a fixed integer chosen by the key generation algorithm, and b is a random integer chosen by the encryption algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation