Advanced Homomorphic Encryption for Cloud Data Security
DOI: http://dx.doi.org/10.30630/joiv.1.1.11
Abstract
Keywords
Full Text:
PDFReferences
Faster RSA Algorithm for Decryption Using Chinese Remainder Theorem G.N. Shinde and H.S. Fadewar , ICCES, vol.5, no.4, pp.255-261.
C. Lamprecht “Investigating the efficiency of Cryptographic algorithm in Online Transaction”ISN 1473-804X online, 1473-8031 I.J. of Simulation Vol.7, No.2.
AlexanderMay, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent”, CRYPTO 2002, LNCS 2442, pp 242-256, 2002.
JohannnesBlomer,Martin Otto, “a newCRT-RSA Algorithm Secure Against Bellcore”, CC’03, October 27-30,Washington, DC, USA.
Craig Gentry, A Fully Homomorphic Encryption Scheme,2009.
http://crypto.stanford.edu/craig/craig-thesis.pdf.
Understanding Homomorphic Encryption http://en.wikipedia.org/wiki/Homomorphic_encryption.
Homomorphic Encryption Applied to the Cloud Computing Security Maha TEBAA, Saïd EL HAJJI, Abdellatif EL GHAZI.
Vic (J.R.) Winkler, ”Securing the Cloud, Cloud Computer Security, Techniques and Tactics”, Elsevier.
R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
A Fully Homomorphic Encryption Implementation on Cloud Computing Shashank Bajpai and Padmija Srivastava Cloud Computing Research Team, Center for Development of Advanced Computing [C-DAC], Hyderabad.
Refbacks
- There are currently no refbacks.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.