Exploring Cloud Cryptography for Secure Data Processing
Cloud cryptography is a vital aspect of data security in cloud computing, allowing data to be encrypted and processed securely. This presentation delves into the concepts of cloud cryptography, homomorphic encryption, and the two types of homomorphic encryption - hybrid and partial. It discusses the implementation of various partial homomorphic encryption algorithms like Paillier, RSA, and Elgamal, highlighting their compression of encryption and decryption times. The presentation aims to shed light on the theory, practice, and future research directions of cloud cryptography.
- Cloud Cryptography
- Data Security
- Homomorphic Encryption
- Encryption Algorithms
- Secure Data Processing
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
Lockheed research fellowship 2019-2020 University of District of Columbia Department of Computer Science and Information Technology Abdulsalam Bashire Final PPT presentation
PROJECT TITLE: Cloud Cryptography: Theory, Practice and Future Research Direction
Introduction What is cloud cryptography? What is homomorphic encryption? What are the two types of homomorphic encryption? How Homomorphic Encryption Schemes and their Properties implement? The Implementation of the three Partial Homomorphic Encryption Algorithms . 1. Paillier Algorithm 2. RSA Algorithm 3. Elgamal Algorithm Compression of Encryption time and Decryption time Between PAILLER, RSA AND ELGAMAL Algorithms. CONCLUSION
What is cloud cryptography? In the web, web cryptography utilizes encryption methods to protect data that is being accessed or processed in the system. It helps users to access public cloud resources easily and safely, as all data the cloud providers hold is secured by encryption.
What is homomorphic encryption? is an encryption method which enables any data to remain encrypted while being processed and manipulated. This helps you or a third party (such as a service provider) to add functions to encrypted data without the need to reveal data values. It can be used to strangely enough activities to encrypt cloud data. Data stored by using data confidentiality or privacy.
What are the two types of homomorphic encryption? Homomorphic encryption has two parts: 1. hybrid homomorphic encryption 2. partial homomorphic encryption.
1.Hybrid Homomorphic Encryption In this order of technology creates very fast data secure even when waiting in cloud. This form is interested because of secure outstanding fixing problem on encryption. Also, this methodology encrypts important single element of database. The advantages of using this form of encryption decrease communication cost by low level. For example, to find DNA sequences show progress cryptographic encryption in terms of their ability to give support in real world life data analysis in cloud.
2.Partial Homomorphic Encryption used for cryptosystems allow us to homomorphically evaluate any logical evaluation without description. The sounds of resulting ciphertext grows during time of homomorphic evaluations. slightly with addition, however substantially with multiplication. In particular, two method used for sound management. decrease noise by scaling factories.
Homomorphic Encryption Schemes and their Properties Researcher Flavor Algorithm Property Multiplication Partial RSA 1978, Riverest 1985, Taher El Gamal Multiplicative Partial 1999, Paillier Paillier Additive Partial
The Implementation of the three Partial Homomorphic Encryption Algorithms 1. Paillier Algorithm 2. RSA Algorithm 3. Elgamal Algorithm
Implementation and Protocol of Paillier algorithm Key Generation: p,q elements of p with equal length n = p * q G = 1 + n Mod (n) = (p-1). (q-1) Encryption Plaintext m < n ( m < Zn) Choose r < n gcd(r,n) = 1 randomly (r E Zn) Cipghrtext c = g^m, r^N mod n^2 Decryption: Cipher text C < n^2 Plaintext m = L (C^X mod n^2). U mod n
Implementation and Protocol of RSA algorithm Select p and q large prime numbers. n = p * q phi (n) = (p 1) * (q 1) select e where 1<e < phi(n) n,e are co-primes compute d=> (d * e) mod (phi(n)) = 1 public key (e,n), private key (d,n) encryption of Plaintext P => C=P mod(n) decryption of Cipher text C => P=C mod(n) RSA follows Homomorphic property as encrypt (P1) * encrypt (P2) =encrypt(P1 x P2) End
Implementation and Protocol of Elgamal algorithm Key Generation Pick a prime number q Alpha a < q and a primitive root of q Private key: xa < q-1 Calculate Ya Ya = a^XA mod q public key: (q,a,YA) Private key XA Encryption Decryption Plaintext: M < q ciphertext (C1,C2) Select random integers k k < q calculate k k = C1^XA mod q Calculate k k = YA mod q plaintext: Calculate C1 = C1 = a^k mod q M = C2K^-1 mod q Calculate C2 = C2 = km mod q Ciphertext = (C1,C2)
Compression of Encryption time Between PAILLER, RSA AND ELGAMAL
Compression of Decryption time Between PAILLER, RSA AND ELGAMAL
CONCLUSION In this research, I explored the technique of homomorphic encryption and various schemes. Homomorphic encryption is one of the most important part of my research and relevant techniques for ensuring data privacy in the cloud. I use a case to implement the a three partial homomorphic encryption algorithms. The research increase my interest in cloud computing technology and in cloud security. The data security, data integrity, and data sharing from a comprehensive standpoint. The cloud computing helps IT companies automate the cost-effective use of resources. The compression of Encryption and Decryption time Between PAILLER, RSA AND ELGAMAL.
