Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3010089.3016026acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbdawConference Proceedingsconference-collections
research-article

Securely Adapt a Paillier Encryption Scheme to Protect the Data Confidentiality in the Cloud Environment

Published: 10 November 2016 Publication History

Abstract

Since the emergence of the cloud paradigm, the fear of losing the privacy of sensitive data has become a main barrier to cloud services adoption. Indeed, researchers have stressed a useful technique that can address this barrier. This technique called "homomorphic encryption", is an encryption form that supports operations on encrypted data. Unfortunately, many attacks make the homomorphic encryption schemes insecure. These attacks can efficiently achieve the results when adopting these encryption schemes to protect data confidentiality in the cloud environment, owing to the long time storage of the encrypted data by the same key. In this paper, we will mitigate these drawbacks by suggesting an enhanced version of a Paillier encryption scheme that supports the additive homomorphism and resists more confidentiality attacks.

References

[1]
Rivest, R., Shamir, A., Adleman, L. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (2), 120--126.
[2]
ElGamal, T. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 469-472.
[3]
Paillier, P. 1999. Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology EUROCRYPT'99, 223--238.
[4]
Gentry, C. 2009. Fully homomorphic encryption using ideal lattices. Proceedings of STOC'09, 169-178.
[5]
Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V. 2010. Fully homomorphic encryption over the integers. Proceedings of Advances in Cryptology, EUROCRYPT'10, 24--43.
[6]
Xun Yi, Russell Paulet and Elisa Bertino. 2014. Homomorphic Encryption and Applications. 1st edn. Springer Briefs in Computer Science, Springer International Publishing.
[7]
Marlow Anderson and Todd Feil. 2014. A First Course in Abstract Algebra: Rings, Groups, and Fields. 3rd edn. CRC Press.
[8]
Stinson, D. R. 2006. Cryptography: Theory and Practice, 3rd edn. Discrete Mathematics and Its Applications. Chapman Hall.
[9]
Carmichael, R. D. 1910. Note on a new number theory function. Bull. Amer. Math. Soc.16 (5), 232--238.
[10]
Lenstra, Arjen K., Lenstra, Hendrik W.Jr. (Eds.). 1993. The development of the number field sieve. 1st edn. Lecture Notes in Mathematics, Vol. 1554. Springer-Verlag Berlin Heidelberg.

Cited By

View all
  • (2023)Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic schemePLOS ONE10.1371/journal.pone.027462818:2(e0274628)Online publication date: 9-Feb-2023
  • (2022)A Diabetes Prediction System Based on Federated Learning2022 International Conference on Big Data, Information and Computer Network (BDICN)10.1109/BDICN55575.2022.00095(486-491)Online publication date: Jan-2022
  • (2020)Cloud-ElGamal and Fast Cloud-RSA Homomorphic Schemes for Protecting Data Confidentiality in Cloud ComputingInternational Journal of Digital Crime and Forensics10.4018/IJDCF.201907010511:3(90-102)Online publication date: 1-Oct-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
BDAW '16: Proceedings of the International Conference on Big Data and Advanced Wireless Technologies
November 2016
398 pages
ISBN:9781450347792
DOI:10.1145/3010089
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • ANR: Agence Nationale pour la Recherche
  • LABSTICC: Labsticc

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Additive Homomorphism
  2. Cloud Computing
  3. Confidentiality
  4. Homomorphic Encryption
  5. Paillier Scheme

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

BDAW '16

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)12
  • Downloads (Last 6 weeks)2
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic schemePLOS ONE10.1371/journal.pone.027462818:2(e0274628)Online publication date: 9-Feb-2023
  • (2022)A Diabetes Prediction System Based on Federated Learning2022 International Conference on Big Data, Information and Computer Network (BDICN)10.1109/BDICN55575.2022.00095(486-491)Online publication date: Jan-2022
  • (2020)Cloud-ElGamal and Fast Cloud-RSA Homomorphic Schemes for Protecting Data Confidentiality in Cloud ComputingInternational Journal of Digital Crime and Forensics10.4018/IJDCF.201907010511:3(90-102)Online publication date: 1-Oct-2020
  • (2020)Privacy Preservation of Data-Driven Models in Smart Grids Using Homomorphic EncryptionInformation10.3390/info1107035711:7(357)Online publication date: 8-Jul-2020
  • (2019)Fast Cloud–Paillier homomorphic schemes for protecting confidentiality of sensitive data in cloud computingJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-019-01366-3Online publication date: 19-Jun-2019
  • (2018)A swift Cloud-Paillier scheme to protect sensitive data confidentiality in cloud computingProcedia Computer Science10.1016/j.procs.2018.07.147134(83-90)Online publication date: 2018
  • (2018)Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computingJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-018-0844-xOnline publication date: 18-May-2018
  • (2018)MultiPrime Cloud-RSA Scheme to Promote Data Confidentiality in the Cloud EnvironmentInnovations in Smart Cities and Applications10.1007/978-3-319-74500-8_41(445-452)Online publication date: 21-Mar-2018
  • (2017)Fast Cloud-RSA Scheme for Promoting Data Confidentiality in the Cloud ComputingProcedia Computer Science10.1016/j.procs.2017.08.282113(33-40)Online publication date: 2017

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media