Searchable symmetric encryption: Difference between revisions

Revision as of 05:21, 7 March 2022

Revision as of 19:55, 11 May 2022

Line 14:

=== Dynamic SSE ===

A dynamic SSE scheme supports, in addition to search, the insertion and deletion of documents. A dynamic SSE scheme consists of seven algorithms <math>\mathsf{SSE = (Setup, Token, Search, InertTokenInsertToken, Insert, DeleteToken, Delete)}</math> where <math>\mathsf{Setup}</math>, <math>\mathsf{Token}</math> and <math>\mathsf{Search}</math> are as in the static case and the remaining algorithms work as follows:

* <math>\mathsf{InsertToken}</math> takes as input the secret key <math>K</math> and a new document <math>\mathrm{D_{n+1}}</math> and outputs an insert token <math>itk</math>

* <math>\mathsf{Insert}</math> takes as input the encrypted document collection EDC and an insert token <math>itk</math> and outputs an updated encrypted document collection <math>\mathbf{ED'}</math>

Line 22:

To add a new document <math>\mathrm{D_{n+1}}</math> the client runs <math>\mathsf{InsertToken}</math> on <math>K</math> and <math>\mathrm{D_{n+1}}</math>to generate an insert token <math>itk</math> which it sends to the server. The server runs <math>\mathsf{Insert}</math> with <math>\mathbf{ED}</math> and <math>itk</math> and stores the updated encrypted document collection. To delete a document with identifier <math>id</math>, the client runs the <math>\mathsf{DeleteToken}</math> algorithm with <math>K</math> and <math>id</math> to generate a delete token <math>dtk</math> which it sends to the server. The server runs <math>\mathsf{Delete}</math> with <math>\mathbf{ED}</math> and <math>dtk</math> and stores the updated encrypted document collection.

An SSE scheme that does not support <math>\mathsf{DeleteToken}</math> and <math>\mathsf{Delete}</math> is called semi-dynamic.

== History of Searchable Symmetric Encryption ==