At EUROCRYPT 2012 Pandey and Rouselakis introduced the notion of property preserving symmetric encryption which enables checking for a property on plaintexts by running a public test on the corresponding ciphertexts. Their primary contributions are: (i) a separation between ‘find-then-guess’ and ‘left-or-right’ security notions; (ii) a concrete construction for left-or-right secure orthogonalit...

We present a new, but simple, randomised order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This scheme requires only O(1) arithmetic operations for encryption and decryption. We show that the scheme has optimal information leakage under the assumption of uniformly distributed plaintexts, and we indicate that this property extends to some n...

Order-preserving encryption (OPE) produces ciphertexts that preserve the relative order of the underlying plaintexts. Thus, it is very suitable for range queries over encrypted outsourced data, as it is a popular case in cloud database scenarios. Unfortunately, most schemes suffer from infeasibility in practice due to requirements like hardly maintainable data structures or additional architect...

Order-preserving encryption (OPE) is a deterministic encryption scheme whose encryption function preserves numerical ordering of the plaintexts. While the concept of OPE was introduced in 2004, the first provably-secure OPE scheme was constructed by Boldyreva, Chenette, Lee, and O’Neill at Eurocrypt 2009. The BCLO scheme uses a sampling algorithm for the hypergeometric distribution as a subrout...

The development of third-party hosting, IT outsourcing, service clouds, etc. raises important security concerns. It would be safer to encrypt critical data hosted by a third-parity, but meanwhile, the database should be able to process queries on encrypted data. Many research works have been developed to support search query processing on encrypted data, including the order preserving encryptio...

We propose a novel prescription to take off the square root of NambuGoto action for a p-brane, which generalizes the Brink-Di VecchiaHowe-Tucker or also known as Polyakov method. With an arbitrary decomposition as d + n = p + 1, our resulting action is a modified d-dimensional Polyakov action which is gauged and possesses a Nambu n-bracket squared potential. We first spell out how the (p+1)dime...

Several order preserving encryption (OPE) algorithms have been developed in the literature to support search on encrypted data. However, existing OPE schemes only consider a single encryption key, which is infeasible for a practical system with multiple users (implying that all users should have the single encryption key in order to encrypt or decrypt confidential data). In this paper, we devel...

We show how to encrypt a relational database in such a way that it can efficiently support alarge class of SQL queries. Our construction is based solely on structured encryption (STE) anddoes not make use of any property-preserving encryption (PPE) schemes such as deterministicand order-preserving encryption. As such, our approach leaks considerably less than PPE-basedsoluti...

In the recent time, privacy preserving has been studied extensively, because of the extensive explosion of sensitive information. Privacy preserving is one of the important areas that aim to provide security for secret information from unsolicited or unsanctioned disclosure. This has triggered the development of much privacy preserving technique using encryption algorithm. This work will presen...