Performance analysis for fully and partially homomorphic encryption techniques

Other Title(s)

تحليل الأداء لتقنيات التشفير المتماثلة الكاملة و الجزئية

Dissertant

al-Shabib, Rayya Adil

Thesis advisor

Kayid, Ahmad

Comitee Members

al-Jarrah, Muzaffar Munir
Alya, Muhammad Ahmad

University

Middle East University

Faculty

Faculty of Information Technology

Department

Computer Science Department

University Country

Jordan

Degree

Master

Degree Date

2016

English Abstract

Recently, the use of cloud computing for the storage of business and personal data has shown a great increase, due to many factors such as ease of access anywhere anytime, reduced storage cost, hardware independence, and the availability of reliable network infrastructure.

However, the cloud computing approach faces serious security challenges and threats that need to be investigated and discussed.

One of the main methods to keep the data safe from attacks by adversaries is the encryption technique, which is considered a practical and an appropriate method for protecting data in the cloud.

This thesis investigates the main encryption techniques that deal with allowing mathematical operations to be performed on data in the cloud without the need for decryption.

It has investigated two types of Partial Homomorphic Encryption techniques (Paillier and RSA) and Fully Homomorphic Encryption (Nth Degree Truncated Polynomial Ring Unit) with two operations of NTRU technique (Additive NTRU and Multiplication NTRU, and the combination between them.

The research work studied several parameters that affect cloud security based on these techniques.

The selected parameters are investigated with the aim of distinguishing the impact of these parameters on the performance of the Homomorphic and NTRU techniques in terms of security and execution time.

This thesis has identified two parameters that have an effect on encryption security level and execution performance; these are key size and data size.

It has tested four key sizes (32 bits, 64 bits, 128 bits and 256 bits) and data sizes ranging from one to nine digits.

The research results show that the optimal key size is 256 bits for RSA and NTRU (additive, multiplication) which give a high security level and minimal performance loss.

Also, the research results show that the optimal key size is 128 bits for Paillier and NTRU (combined) which give a high security level and minimal performance loss.

For the optimal data size, the results show that for the RSA method, the optimal data size is five digits, which gives minimal performance-loss (4%).

Based on the execution time factor, the research finds out that the Additive PHE (Paillier) performs better than the Additive NTRU, the Multiplication PHE (RSA) performs better than the Multiplication NTRU, and finally the two PHEs together perform better than the two NTRUs

Main Subjects

Information Technology and Computer Science

No. of Pages

129

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-721124