Corpus ID: 28551002

An Efficient Symmetric Based Algorithm for Data Security in Cloud Computing Through Homomorphic Encryption Scheme

@inproceedings{Biksham2017AnES,
  title={An Efficient Symmetric Based Algorithm for Data Security in Cloud Computing Through Homomorphic Encryption Scheme},
  author={V. Biksham},
  year={2017}
}
The outstanding research topic on cryptography is called Fully Homomorphic Encryption (FHE), which allows computations to be carried out on encrypted data to the untrusted server of the security and privacy concerned related to emerging technologies like cloud computing. Various FHE schemes were developed after the first invention of Craig Gentry in 2009 which security is relying on bootstrapping and squashing. It is based on ideal lattices and it is more complex and huge computational cost and… Expand

Figures from this paper

A Comparative Study on Homomorphic Encryption Schemes in Cloud Computing
  • A. Kavya, Shreenath Acharva
  • Computer Science
  • 2018 3rd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)
  • 2018
TLDR
A security system using fully homomorphic encryption to secure medical data in the cloud is proposed, which will try to ensure security to the data even while processing it with better performance. Expand

References

SHOWING 1-10 OF 30 REFERENCES
Design of a polynomial ring based symmetric homomorphic encryption scheme
Summary Security of data, especially in clouds, has become immensely essential for present-day applications. Fully homomorphic encryption (FHE) is a great way to secure data which is used andExpand
Efficient public key Homomorphic Encryption over integer plaintexts
  • Y. Ramaiah, G. Kumari
  • Computer Science
  • 2012 International Conference on Information Security and Intelligent Control
  • 2012
TLDR
The proposed Somewhat Homomorphic public key encryption scheme is compact, semantically secure with significantly smaller public key, and is capable of encrypting integer plaintexts rather than single bits, with comparatively lower message expansion and computational complexities. Expand
Complete Privacy Preserving Auditing for Data Integrity in Cloud Computing
  • Y. Ramaiah, G. Kumari
  • Computer Science
  • 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications
  • 2013
TLDR
This paper proposes a new protocol for verifying the integrity of the data stored at the remote cloud server, based on a practical version of integers based homomorphic encryption, which is the first attempt in combining the data integrity and confidentiality in new ways to provide an impending solution. Expand
Query based computations on encrypted data through homomorphic encryption in cloud computing security
  • V. Biksham, D. Vasumathi
  • Computer Science
  • 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)
  • 2016
TLDR
A secure encryption method called homomorphic encryption is proposed which provides calculations on encrypted data without decrypting the cipher text and enhance the performance of the cloud services. Expand
Advanced e-voting system using Paillier homomorphic encryption algorithm
TLDR
The purpose of this research is to prove the effectiveness of the Paillier algorithm and its homomorphic property that implemented in an e-voting system that can calculate the sum of votes in ciphertext form without revealing the choice of the voters. Expand
Fully homomorphic encryption using ideal lattices
TLDR
This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable. Expand
Secure Cloud Computing through Homomorphic Encryption
TLDR
This work states that recent advances in current technology (through virtualization) paved the way for Cloud Computing to emerge as an important paradigm that has attracted considerable attention in both industry and academia. Expand
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
TLDR
This work proposes and examines the approximate polynomial common divisor problem, and constructs a simple somewhat homomorphic encryption scheme, which is more efficient than the recent RLWE-based scheme, YASHE, by Bos et?al. Expand
A Guide to Fully Homomorphic Encryption
Fully homomorphic encryption (FHE) has been dubbed the holy grail of cryptography, an elusive goal which could solve the IT world’s problems of security and trust. Research in the area exploded afterExpand
Probabilistic encryption & how to play mental poker keeping secret all partial information
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about theExpand
...
1
2
3
...