A

Homomorphic
Result Portal

Aim:
We

aim to implement a multiparty

computational system using fully
homomorphic encryption with the means
of a result portal.

Homomorphic Encryption

A type of asymmetric or paired keys

encryption
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.
In mathematics, homomorphic describes the
transformation of one data set into another
while preserving relationships between
elements in both sets.

 Homomorphic

encryptions allow complex

mathematical operations to be
performed on encrypted data without
compromising the encryption.

Fully Homomorphic Encryption

It

is defined in terms of addition and

multiplication operations.
Additive/Multiplicative operations mean
that the ciphertexts of two encrypted
operands can be added/multiplied to
give a ciphertext that when decrypted
gives the actual result of the addition.
If a system displays both these properties,
it is said to be fully homomorphic.

Reseach work:
First

demonstrated mathematically by
Craig Gentry in his thesis at Stanford
University.
Gentry used the concept of ideal lattices
to propose an algorithm that could
display fully homomorphic encryption.
Currently the most advanced algorithm is
the Brakursky-vaikuntnathan-Gentry
algorithm.

The BGV algorithm

Proposed

after Gentrys pioneering work.

Uses integers in place of lattices and
hence is more conducive to computing
optimizations.
Still very massive and unwieldy.
Exists in the form of an open project on
github that can be added and modified.

Our Work:
The

drawbacks of the current algorithms

in place are immense.
For example, in the BGV algorithm stated
before,
It takes 0.2 and 3 seconds to encrypt and
decrypt a bit at toy settings.
At a normal setting, it takes over 3 minutes
and 31 minutes for the same task.

 Also,

the size of the public key goes up

and above 2.3 gb in most real world
settings.
The large numbers available cannot be
handled by most programming
languages hence limiting their
applicability.

Paillier cryptosystem