A Searchable Encryption Scheme Based on Elliptic Curves

Abstract

As in the present we live in the era of the digitalized data, we need to protect our data against malicious users. Cloud computing represents a key technology nowadays, due to its numerous advantages, but it raises some concerns about security. Along the years, many security techniques have been proposed. One important technique is searchable encryption, which allows an authorized user to submit encrypted search queries over encrypted data. The elliptic curves have attracted the researchers’ attention, because of many reasons. Elliptic curves cryptography (CC) provides a good security regarding a key size. In ECC, the cryptographic operations run faster on smaller chips or complex software, because of compact implementation provided by a small key size. The basis of ECC is the discrete logarithm problem, which can be extremely difficult in some conditions. In this paper we propose a searchable encryption scheme based on elliptic curves, where in the encryption process we will use a variation of complex quadratic polynomial.