Efficient verifiable searchable encryption with search and access pattern privacy

Security and Safety of Data in Cloud Computing

Open Access

Table 2.

Table of notations

Notations	Descriptions
λ	The system security parameter
id	The document identifier
W_i	The keyword set of id_i
$W = \cup_{i = 1}^{d} W_{i}$ $W=\cup_{i=1}^{d}W_{i}$	The keyword dictionary in the system
w_i	The i-th keyword in a keyword set W
DB(w_i)	The document identifier set containing w_i
$L = max_{w_{i} \in W} {\| D B (w_{i})}$ $L=\max \limits_{w_{i}\in W}\{\|DB(w_{i})\}$	The upper bound of cardinalities of the
		document identifier set containing w_i
	m = \|W\|	The total number of keywords in W
+_h	The addition of two ciphertexts
*_h	The multiplication of ciphertext and random number
P_{w_i}(x)	The L-degree polynomial corresponding to DB(w_i)
X_i	The coefficients of polynomial P_{w_i}(x)
I	The index matrix
Tr	The keyword trapdoor
φ_i, ψ_i	The random L-degree polynomial
P(x),𝒫(x)	The encrypted search result

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.