A new lightweight symmetric searchable encryption scheme for string identification
In this paper, we provide an efficient and easy-to-implement symmetric searchable encryption scheme (SSE) for string search, which takes one round of communication, O(n) times of computations over n documents. Unlike previous schemes, we use hash-chaining instead of chain of encryption operations fo...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Article |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/32618 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|