How to Update Documents Verifiably in Searchable Symmetric Encryption

@inproceedings{Kurosawa2013HowTU,
  title={How to Update Documents Verifiably in Searchable Symmetric Encryption},
  author={Kaoru Kurosawa and Yasuhiro Ohtaki},
  booktitle={CANS},
  year={2013}
}
Outline (1) Introduction (2) Our (previous) verifiable SSE scheme (3) Extend it to a dynamic SSE scheme (but not yet fully verifiable) (4) Verifiable dynamic SSE scheme (5) Summary A Searchable Symmetric Encryption (SSE) scheme • Consists of a store phase and a search phase • Suppose that we have 5 documents and 3 keywords. In the store phase, • A client stores encrypted files (or documents) and an index I (in a encrypted form) on a server. 
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

Topics

Statistics

051015201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.