Multiuser Searchable Encryption with Token Freshness Verification

Title : Multiuser Searchable Encryption with Token Freshness Verification

Abstract : A Multiuser Searchable Encryption (MUSE) can be defined with the notion of Functional Encryption (FE) where a user constructs a search token from a search key issued by an Enterprise Trusted Authority (ETA). In such scheme, a user possessing search key constructs search token at any time and consequently requests the server to search over encrypted data. Thus, an FE based MUSE scheme is not suitable for the applications where a log of search activities is maintained at the enterprise site to identify dishonest search query from any user. In addition, none of the existing searchable schemes provides security against token replay attack to avoid reuse of the same token. In this paper, therefore we propose an FE based scheme, Multiuser Searchable Encryption with Token Freshness Verification (MUSE-TFV). In MUSE-TFV, a user prepares one-time usable search token in cooperation with ETA and thus every search activity is logged at the enterprise site. Additionally, by verifying the freshness of a token, the server prevents reuse of the token. With formal security analysis, we prove the security of MUSE-TFV against chosen keyword attack and token replay attack. With theoretical and empirical analysis, we justify the effectiveness of MUSE-TFV in practical applications.

Conference Details : Security and Communication Networks, hindawi publications

Date :26/11/2017 ,

Venue : It is a journal paper

Published At :Volume 2017 (2017), Article ID 6435138, 16 pages,

Link : Paper Link

View :
Submitted By : Dhruti Sharma and Devesh C. Jinwala

Style Switcher

Predefined Colors

Layout Style

Header Color

Footer Top Color

Footer Bottom Color