Sesos: A Verifiable Searchable Outsourcing Scheme For Ordered Structured Data in Cloud Computing

While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. one way to diminish privacy concerns is to store data on the cloud in encrypted form. however, encryption often hinders useful computation cloud services. a theoretical approach is to employ the socalled fully homomorphic encryption, yet the overhead is so high that it is not considered a viable solution for practical purposes. the next best thing is to craft specialpurpose cryptosystems which support the set of operations required to be addressed by cloud services. in this paper, we put forward one such cryptosystem, which supports efficient search over structured data types, such as timestamps or network addresses, which are comprised of several segments with wellknown values. the new cryptosystem, called sesos, provides the ability to execute like queries, along with the search for exact matches, as well as comparison. in addition, the extended version, called xsesos, allows for verifying the integrity of ciphertexts. at its heart, sesos combines any orderpreserving encryption (ope) scheme with a novel encryption scheme called multimap perfectly secure cryptosystem(mups). we prove that mups is perfectly secure, and hence sesos enjoys the same security properties of the underlying ope scheme. the overhead of executing equality and comparison operations is negligible. the performance of like queries is significantly improved by up to 1370x and the performance of result decryption improved by 520x compared to existing solutions on a database with merely 100k records