Information about Homomorphic Encryption

CONTENTS • Introduction. • An Analogy. • Algorithm. • A Homomorphic symmetric encryption. • Problems. • Revolutions. • Implementation. • References.

INTRODUCTION • Homomorphic encryption is a form of encryption which allows specific types of computations to be carried out on ciphertext and obtain an encrypted result which decrypted matches the result of operations performed on the plaintext. • For instance, one person could add two encrypted numbers and then another person could decrypt the result, without either of them being able to find the value of the individual numbers.

• Earlier there was Somewhat Homomorphic Encryption technique. This encryption used low polynomial degree, which was its big drawback. • In June 2009, “Gentry” proposed the first efficient Fully Homomorphic Encryption technique. It is efficient in the sense that all algorithms run in polynomial time.

An Analogy: Alice’s Jewellery Store • Alice’s workers need to assemble raw materials into jewellery • But Alice is worried about theft How can the workers process the raw materials without having access to them?

• Alice puts materials in locked glove box • For which only she has the key • Workers assemble jewellery in the box • Alice unlocks box to get “results

ALGORITHM • Three procedures: KeyGen, Enc, Dec • (sk,pk) KeyGen($) • Generate random public/secret key-pair • c Encpk(m) • Encrypt a message with the public key • m Decsk(c) • Decrypt a ciphertext with the secret key • E.g., RSA: cme mod N, mcd mod N • (N,e) public key, d secret key • Works for MULT gates (mod N) • C*=C1 x C2 x…… XCn=(m1 X m2 X…..X mn)(mod N)

THE ANALOGY • Enc: putting things inside the box • Anyone can do this (imagine a mail-drop) • ci Encpk(mi) • Dec: Taking things out of the box • Only Alice can do it, requires the key • m* Decsk(c*) • Eval: Assembling the jewelry • Anyone can do it, computing on ciphertext • c* Evalpk( , c1,…,cn) • m* = (m1,…,mn) is “the ring”, made from “raw materials” m1,…,mn

A HOMOMORPHIC SYMMETRIC ENCRYPTION • Shared secret key: odd number p • To encrypt a bit m: • Choose at random large q, small r 5 • We choose r ~ 2n, p ~ 22n (and q ~ 2n ) • Output c = pq + 2r + m • Ciphertext is close to a multiple of p • To decrypt c: • Output m = (c mod p) mod 2 2r+m much smaller than p

FROM “SOMEWHAT” TO “FULLY” • Theorem [Gentry’09]: Convert “bootstrappable” → FHE. FHE = Can eval all fns. Augmented Decryption ckt. “Bootstrappable” NAND Dec c1 sk Dec c2 sk

PROBLEMS • Ciphertext grows with each operation • Noise grows with each operation • Threat for increasing cybercrimes through encrypted malwares

REVOLUTIONS …. • Wireless Sensor/Mesh Network. • Obfuscation Technology. • IBM HELib.

IMPLEMENTATION…… • Example 1: Private Search • You: Encrypt the query, send to Google (Google does not know the key, cannot “see” the query) • Private search: Encrypted query------- Encrypted Result • You: Decrypt Query , Recover the search result

IMPLEMENTATION…… • Private Cloud Computing Encrypt x input: x program: P Enc(x), P → Enc(P(x))

REFERENCES…. • IEEE XPLORE • Wikipedia.org • Securityexplore.com • Handbook of applied cryptography by Alfred j. Menezes • Webcrawler.com • www.scmagazineuk.com

Presentación que realice en el Evento Nacional de Gobierno Abierto, realizado los ...

In this presentation we will describe our experience developing with a highly dyna...

Presentation to the LITA Forum 7th November 2014 Albuquerque, NM

Un recorrido por los cambios que nos generará el wearabletech en el futuro

Um paralelo entre as novidades & mercado em Wearable Computing e Tecnologias Assis...

Microsoft finally joins the smartwatch and fitness tracker game by introducing the...

Homomorphic encryption is a form of encryption that allows computations to be carried out on ciphertext, thus generating an encrypted result which, when ...

Read more

Ciphering: Gentry’s system allows encrypted data to be analyzed in the cloud. In this example, we wish to add 1 and 2. The data is encrypted so that 1 ...

Read more

derp • September 25, 2012 8:33 AM. cryptDB prototype by MIT works pretty well doing homomorphic encryption only problem is it can't do square roots

Read more

Homomorphic encryption is the conversion of data into ciphertext that can be analyzed and worked with as if it were still in its original form. By ...

Read more

Homomorphic encryption is a form of encryption where a specific algebraic operation is performed on the plaintext and another (possibly different ...

Read more

Abstract We propose the ﬂrst fully homomorphic encryption scheme, solving a central open problem in cryptography. Such a scheme allows one to compute ...

Read more

C Gentry, S Halevi, Implementing Gentry’s Fully-Homomorphic Encryption Scheme , Advances in Cryptology--EUROCRYPT 2011, Springer. C Gentry, S Halevi, V ...

Read more

Homomorphic encryption is one of the most exciting new research topics in cryptography, which promises to make cloud computing perfectly secure.

Read more

My turn. Homomorphic encryption is a process by which complex calculations can be performed on data, and it does not matter that the data is encrypted.

Read more

Plain English? I came to this page while searching for an explanation of "fully homomorphic encryption." While the explanation on this page may be rigorous ...

Read more

## Add a comment