Dynamic Searchable Symmetric Encryption with Full Forward Privacy
| Autor: | Ken Barker, Khosro Salmani |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Scheme (programming language)
020203 distributed computing 021110 strategic defence & security studies Information privacy Parallelizable manifold Computer science business.industry 0211 other engineering and technologies Cloud computing Plaintext 02 engineering and technology Encryption Computer security computer.software_genre Symmetric-key algorithm Information leakage 0202 electrical engineering electronic engineering information engineering business computer computer.programming_language |
| Zdroj: | 2020 IEEE 5th International Conference on Signal and Image Processing (ICSIP). |
| DOI: | 10.1109/icsip49896.2020.9339338 |
| Popis: | Many approaches address the problem of Searchable Symmetric Encryption (SSE), and in the last few years scholars introduced Dynamic SSE (DSSE) schemes in which a client is able to add, delete, and update documents along with performing searches over encrypted documents. The concept of forward privacy was introduced to guarantee a higher level of data privacy and to prevent crucial information leakage. In a forward private scheme, the cloud/attacker cannot link a newly added document to previous searches. However, forward private schemes still leak search pattern which can be employed to collapse the whole security system and an adaptive attacker can reveal plaintext data. To address this challenge, in this paper, we introduce the notion of Full Forward Privacy (FFP). We also propose a parallelizable DSSE scheme that achieves FFP by employing non-deterministic and one-time use search tokens to obfuscate the search pattern. Our cost-efficient scheme supports both updates and searches. Provided security proof and performance analysis demonstrate practicality, efficiency, and security of our approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|