Efficient and Secure Remote Data Storing and Processing

摘要

Storing and processing data remotely is becoming a popular trend for people to deal with their data in order to overcome storage spaces and computing resources limitation. However, moving private data to untrusted third parties like clouds with limited digital control by data owners raises security concerns. Primitive encryption schemes seem ineffective to be used as such techniques require encrypted data need to be decrypted first before data can be processed. Thus, homomorphic encryption is believed to be one of the potential solutions as it allows arbitrary computation on encrypted data without decryption process. The first fully homomorphic encryption (FHE) scheme was introduced by Gentry, then followed by other researchers that produced similar and complex schemes like Gentry's one. Such schemes are suffering from poor efficiency as too much noise is produced by the process on encrypted data. Thus, this research work will deeply look at efficiency issue and propose a new scheme which minimizes the use of noise at the processing stage. The scheme implements the Elliptic Curve (EC) group as the underlying group since EC promises efficiency and strong security. The use of n-multilinear map along with the construction of the scheme is to enable the achievement of a FHE scheme. The key contribution of this work is to propose a FHE scheme with improved efficiency. Furthermore, an improve security of a Secure Sockets Layer protocol will be the second contribution as the used of the proposed FHE scheme enables data to be transmitted and processed securely and efficiently.