Analytical study for the mutable order-preserving encoding with periodically encryption key changing

Other Title(s)

دراسة تحليلية لطريقة التشفير المتغيرة المحافظة على الترتيب مع تغيير مفتاح التشفير دوريا

Dissertant

Umar, Suha Wasif

Thesis advisor

al-Kayid, Ahmad
Viktorov, Oleg

Comitee Members

Abu Shurayhah, Ahmad
Abu Saymah, Hisham

University

Middle East University

Faculty

Faculty of Information Technology

Department

Computer Science Department

University Country

Jordan

Degree

Master

Degree Date

2016

English Abstract

The security of cloud database is the most challenge in the cloud paradigm.

Encryption is the solution for the data security problem but some encryption techniques do not preserve data order.

Order Preserving Encryption (OPE) is an encryption technique that used to preserve the order of data while executing range queries over encrypted data.

OPE suffers from leakage of information.

This research has used the order preserving encryption to preserve the order of data.

It found a balancing between performance and security level in Mutable Order Preserving Encoding (MOPE).

MOPE algorithm keeps its binary search tree balanced on each transaction applied by the system.

This research proposed to change the encryption key for a certain time or a certain number of transactions.

To enhance the security level without degrading the performance, the idea of this research is to utilize the time consumed to rebalance part of the tree in MOPE algorithm to change the encryption key.

Changing the encryption key caused disorder of data thus the whole tree should be restructured.

Changing encryption key from time to time enhances the security of the system while keeping the encryption key for a long time leads to leak of data.

Also, changing the encryption key more often decreased the performance.

Thus, this research found an optimal point to change the encryption key with an acceptable losing of performance.

It used two parameters to monitor the performance, time and transaction window.

It found the best time and best number of transactions to change the encryption key.

The proper time window for changing the encryption key that lead to an acceptable losing of performance was equal to 0.4 millisecond to insert 100 data records with 42% losing of performance.

The proper time window for changing the encryption key that lead to an acceptable losing of performance was equal to 0.4millisecond to delete 40 data records from 100 data records with 26% losing of performance.

The proper transaction window for changing the encryption key that lead to an acceptable losing of performance was equal to 5 transactions to insert 100 data records with 41% losing of performance.

The proper transaction window for changing the encryption key that lead to an acceptable losing of performance was equal to 6 transactions to delete 40 data records from 100 data records with 30% losing of performance.

Main Subjects

Information Technology and Computer Science

No. of Pages

122

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-721106