Scribd
Upload
75 views

Homomorphic Encryption: Aarushi Gupta 1RV18EC001

Homomorphic encryption allows computations to be performed on encrypted data without decrypting it first. It has two main properties: [1] h(x * y) = h(x) * h(y), and [2] h(x + y) = h(x) + h(y). This allows a user to encrypt data and send it to an untrusted third party for processing, while only the user can decrypt the output. Early schemes like RSA only allowed homomorphic multiplication, but recent advances allow fully homomorphic encryption through bootstrapping. Applications include private searches, encrypted databases, and outsourcing computation to the cloud. However, homomorphic encryption also has drawbacks like lower performance compared to plain

Uploaded by

crayon
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
75 views

Homomorphic Encryption: Aarushi Gupta 1RV18EC001

Homomorphic encryption allows computations to be performed on encrypted data without decrypting it first. It has two main properties: [1] h(x * y) = h(x) * h(y), and [2] h(x + y) = h(x) + h(y). This allows a user to encrypt data and send it to an untrusted third party for processing, while only the user can decrypt the output. Early schemes like RSA only allowed homomorphic multiplication, but recent advances allow fully homomorphic encryption through bootstrapping. Applications include private searches, encrypted databases, and outsourcing computation to the cloud. However, homomorphic encryption also has drawbacks like lower performance compared to plain

Uploaded by

crayon
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Homomorphic

Encryption
Aarushi Gupta
1RV18EC001
• Introduction
• Alice’s Jewelry Store Analogy
• Core Principle
• Brief History
• Partially homomorphic algorithms
Contents o RSA
o ElGamal
o Paillier
• Applications
• Drawbacks and limitations
• References
Is it possible to delegate processing of your
data without giving away access to it?

Introduction
This question, which tests the tension
between convenience and privacy, has
always been important, but seems
especially so now that we are headed
toward widespread use of cloud computing.
Alice’s Jewelry
Store Analogy
Core Principle
• h(x * y) = h(x) * h(y)
• h(x + y) = h(x) + h(y)

• The user encrypts her data x using e, and sends e(x) to an


untrusted third party.
• The third party performs computations f on the
encrypted e(x). Because e is an homomorphism, we have
that f(e(x)) = e(f(x)). Then the third party sends the data back to
the user.
• Finally, the user decrypts the output, obtaining then d(e(f(x))) =
f(x), without exposing her data directly to the untrusted third
party.
• HE schemes first started with RSA, which provided
an homomorphic scheme, but only with
homomorphic multiplication. This was the first
Brief History Partially Homomorphic Encryption (PHE)
• Gentry’s breakthrough was done by introducing
bootstrapping to SWHE. The idea is that a SWHE
encrypts a plaintext into a ciphertext by adding noise
Partially
Homomorphic
Algorithms
RSA
ElGamal
Paillier Can perform addition of ciphertexts as
well as multiplication of a ciphertext
with a plaintext
• Private Search
• Encrypted Databases
Applications • Outsourcing Computation on the Cloud
• Other Applications
Drawbacks and
Limitations
References

• Computing Arbitrary Functions of Encrypted Data – Craig Gentry


• On data banks and privacy homomorphisms. Foundations of secure computation
- Rivest, R. L., Adleman, L., & Dertouzos, M. L.
• (Leveled) fully homomorphic encryption without bootstrapping. - Brakerski, Zvika,
Craig Gentry, and Vinod Vaikuntanathan
• Homomorphic Encryption Technology for Cloud Computing - MinZhao E, YangGeng
• Practical homomorphic encryption: A survey - Ciara Moore, Máire O'Neill
• Homomorphic Encryption and Data Security in the Cloud - Timothy Oladunni,
Sharad Sharma
Thank You!

You might also like