Simple index based symmetric searchable encryption with result verifiability
- PDF / 234,589 Bytes
- 3 Pages / 612.284 x 802.205 pts Page_size
- 20 Downloads / 196 Views
Simple index based symmetric searchable encryption with result verifiability Dhruti SHARMA
, Devesh JINWALA
Department of Computer Engineering, S. V. National Institute of Technology, Surat-395007, Gujarat, India c Higher Education Press 2020
1
we offer support to dynamic data collection whereby insertion of a new data item, or deletion or modification of the existing data item. • Variable values for keywords Considering each keyword of SI as “KeywordName=Value”, we define a scheme that supports variable values for the same keyword in different data items.
Introduction and main contributions
Searchable encryption (SE) allows client (data user) to outsource searchable ciphertexts onto server in a way that the data can further be searched by server. For semi-honest-but-curios server (that follows the protocol but curious to learn the plaintext of client’s data), data privacy while performing search is of primary concern. However, in case of malicious server (that follows the protocol but may alter the result), besides data privacy, the other design rational, i.e., verifiable searchability is required. In verifiable searchability, server has to prove client that the returned search result is correct and complete. To do so, server returns a proof component along with the search result and client verifies the correctness of result using available proof component. In literature, there exist numerous verification enabled symmetric searchable encryption (SSE) schemes. However, in majority of such schemes, a ciphertext is computed using inverted index (II) search structure (refer Online Resource 1 for further details). Practically, II has several limitations viz. support to static data collection, support to prefixed set of keywords, inefficient multi-keyword search. Such limitations could be overcome by means of an alternative, i.e., Simple Index (SI) search structure. From literature, we observe a few SSE schemes with SI search structure. Motivated by this research gap, we propose a simple index based symmetric searchable encryption with result verifiability (SI-SSE-RV). The objective behind this work is to demonstrate the advantage of SI search structure over II search structure and additionally showcase the significance of result verification in SI-based SSE scheme. To attain such objective, we discuss the difference between SI and II in tabular format in the Online Resource 2. The characteristics of SI-SSE-RV are as follows: • Result verification We offer Verify() algorithm that identifies alteration of result if any, in terms of search result modification or search document tampering. • Conjunctive search We offer Search() algorithm for conjunctive keyword search across ciphertexts. • Dynamic data collection Utilizing SI search structure, Received April 11, 2019; accepted September 19, 2019 E-mail: [email protected]
2
Proposed SI-SSE-RV
2.1 System model A system model of SI-SSE-RV consists of three entities: (i) data owner (DO), (ii) data user (DU), (iii) storage server (SS) (Fig. 1). Practically, DU is eit
Data Loading...
