Cryptology ePrint Archive: Report 2005/172

Conjunctive Keyword Search on Encrypted Data with Completeness and Computational Privacy

Radu Sion and Bogdan Carbunar

Abstract: We introduce mechanisms for secure keyword searches on a document server. We propose protocols with computational privacy, query correctness assurances and minimal or no leaks: the server either correctly executes client queries or (if it behaves maliciously) is immediately detected. The client is then provided with strong assurances proving the authenticity and completeness of server replies. This is different from existing research efforts, where a cooperating, non-malicious server behavior is assumed.

We also strengthen the privacy guarantees. The oblivious search protocol not only hides (from the server) the outsourced data but also does not leak client access patterns, the queries themselves, the association between previously searched keywords and returned documents or between newly added documents and their corresponding keywords (not even in encrypted form). This comes naturally at the expense of additional computation costs which we analyze in the context of today's off the shelf hardware. In a reasonable scenario, a single CPU off-the-shelf PC can easily handle hundreds of such oblivious searches per minute.

Category / Keywords: cryptographic protocols /

Date: received 10 Jun 2005, withdrawn 21 Nov 2005

Contact author: sion at cs stonybrook edu

Available format(s): (-- withdrawn --)

Version: 20051121:151013 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]