Articles in Press

Accepted articles here

Latest Issues

Volume 17 Issue 3
Volume 17 Issue 2
Volume 17 Issue 1

Volume 16 Issue 3
Volume 16 Issue 2
Volume 16 Issue 1

Volume 15 Issue 3
Volume 15 Issue 2
Volume 15 Issue 1

Volume 14 Issue 3
Volume 14 Issue 2
Volume 14 Issue 1

Volume 13 Issue 3
Volume 13 Issue 2
Volume 13 Issue 1

Volume 12 Issue 3
Volume 12 Issue 2
Volume 12 Issue 1

Volume 11 Issue 3
Volume 11 Issue 2
Volume 11 Issue 1

Volume 10 Issue 3
Volume 10 Issue 2
Volume 10 Issue 1

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1

Volume 12 Issue 2

Inference Attacks on Fuzzy Searchable Encryption Schemes

Daniel Homann^(a),(*), Lena Wiese^(a)

Transactions on Data Privacy 12:2 (2019) 91 - 115

Abstract, PDF

(a) Universität Göttingen, Institut für Informatik, Goldschmidtstraße 7, 37077 Göttingen, Germany.

e-mail:homann @cs.uni-goettingen.de; wiese @cs.uni-goettingen.de

Abstract

Searchable Encryption allows to securely store and search data on remote servers. Fuzzy searchable encryption is an extension of this technique which can find results matching approximately the search term. Low information leakage is a very important property of searchable encryption schemes. We show that the fuzzy searchable encryption schemes of Chuah and Hu, Wang et al., and Hu and Han do not have the claimed security properties. We describe several attacks on these schemes. For these attacks we use techniques as the reconstruction of information from Bloom filters, and the algebraic analysis of encryption schemes. These attacks show the difficulty of constructing secure and efficient fuzzy searchable encryption schemes.

^* Corresponding author.

Follow us

Supports