Cryptology ePrint Archive: Report 2015/915

A Generic Construction for Verifiable Attribute-based Keyword Search Schemes

Mohammmad Hassan Ameri, Maryam Rajabzadeh Assar, Javad Mohajeri, Mahmoud Salmasizadeh

Abstract: Cloud data owners encrypt their documents before outsourcing to provide their privacy. They could determine a search control policy and delegate the ability of search token generation to the users whose attributes satisfy the search control policy. Verifiable attribute-based keyword search (VABKS) where the users can also verify the accuracy of cloud functionality is one of such schemes. In this paper, the first generic construction for VABKS is proposed. To this end, the notion of hierarchical identity-based multi-designated verifier signature (HIB-MDVS) has been introduced and existential forgery under chosen message attack (EF-CMA) is formally defined for its unforgeability. Furthermore, anonymity against chosen identity vector set and chosen plaintext attack (Anon-CIVS-CPA) has been defined as the security definition of hierarchical identity-based broadcast encryption (HIBBE) in a formal way. The proposed construction is built in a modular structure by using HIBBE, HIB-MDVS, and Bloom filter as the building blocks. We prove that the security of proposed construction is based on the unforgeability of HIB-MDVS and the anonymity of HIBBE. Finally, the concept of verifiable ranked keyword search will be introduced and a construction of this primitive will be presented which is based on proposed VABKS.

Category / Keywords: public-key cryptography / Cloud computing, searchable encryption, keyword ranked search, attribute-based encryption, privacy preserving, hierarchical identity-based cryptography, provable security

Date: received 20 Sep 2015

Contact author: amerim70 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150922:205827 (All versions of this report)

Short URL: ia.cr/2015/915

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]