Users are inclined to share sensitive data in a remote server if no strong security mechanism is in place. Searchable encryption satisfies the need of users to execute a search on encrypted data. Previous searchable encryption method such as “public key encryption with keyword search (PEKS)” restricted the data access to certain users, because only the assigned users were able to search on the ...

We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do...

Predicate encryption is an important cryptographic primitive that has been recently studied [BDOP04, BW07, GPSW06, KSW08] and that has found wide applications. Roughly speaking, in a predicate encryption scheme the owner of the master secret key K can derive secret key K̃, for any pattern vector ~k. In encrypting a message M , the sender can specify an attribute vector ~x and the resulting ciphe...

An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-topeer network. In this paper, we propose a large scale key-value store realized on RKSG, which is possible to scale-out a database with range query. Moreover, applications that utilize the store are implemented and will be demonstrated through private PlanetLab on JGN2plus.