TÜ arvutiteaduse instituudi lõputööde teemade register

Organisatsiooni nimi

Cryptography Research Group

Kokkuvõte

Secure Multiparty Computation is a technique that allows a set of parties to evaluate a function while not learning anything about the inputs. There are various techniques to achieve this. One technique is Fully Homomorphic Encryption where the inputs are encrypted, and the evaluating party manipulates the ciphertexts to obtain the encrypted end result which they then send back to the parties who want to know the answer and who have the key to open it. This requires little communication but is computationally quite heavy. On the other hand, we have various types of Secret-shared based techniques where a number of parties compute the function by using secret-shared computation techniques that still hide the message from the parties (unless they all collaborate). This requires much less computation but it tends to require a lot more communication.

A middle ground solution was proposed some years ago, the so-called homomorphic secret sharing. This requires less computation than fully homomorphic encryption, and does not require communication, but it allows to evaluate only a specific type of circuits.

The masters thesis project aims to look whether we could expand the class of circuits we can evaluate by using a primitive called pairings between elliptic groups. Pairings between elliptic groups are very widely used in cryptography, and could possibly allow to evaluate a larger class of circuits.

Lõputöö kaitsmise aasta

2024-2025

Juhendaja

Toomas Krips

Suhtlemiskeel(ed)

eesti keel, inglise keel

Nõuded kandideerijale

It's a topic for an MSc thesis. Students will need to have some background in cryptography

Tase

Magister

Märksõnad

#cryptography #secure_computation #secret_sharing #elliptic_curves

 

Nimi

Toomas Krips

Tel

E-mail