Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers

Chai, Qi; Gong, Guang

doi:10.1109/icc.2012.6364125

Cited by 216 publications

(115 citation statements)

References 11 publications

Supporting

Mentioning

114

Contrasting

Unclassified

Order By: Relevance

“…Since access pattern hiding requirement includes weak privacy requirements such as keyword privacy and trapdoor unlinkability in [18], we only address access pattern hiding. The efficiency requirement is somewhat stronger than those in the previous works [11], [18], [19] in the sense that the communication and computation of the server caused by searching is independent of the number of data stored. To our knowledge, no methods support both the third and fourth properties [1]- [6], [11], [18], [19].…”

Section: Problem Definitionmentioning

confidence: 54%

“…Some searchable encryption researches do not provide access pattern hiding [1]- [6], [11]. As far as we know, the scheme in [6] is the first approach dealing with searching encrypted data in a symmetric key setting.…”

Section: Searchable Encryptionmentioning

confidence: 99%

“…Recently, [11] was suggested to support the verifiability of search result using trie and keyed-hash function. Unfortunately, it does not support the access pattern hiding either.…”

Section: Searchable Encryptionmentioning

confidence: 99%

See 2 more Smart Citations

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Choi¹

2012

ETRI J

View full text Add to dashboard Cite

This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting

show abstract

Section: Problem Definitionmentioning

confidence: 54%

Section: Searchable Encryptionmentioning

confidence: 99%

See 1 more Smart Citation

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Choi¹

2012

ETRI J

View full text Add to dashboard Cite

show abstract

“…Publications that followed tended to focus on keyword search [6,7,9,18,22]. These early works quickly converged on an inverted index approach.…”

Section: Introductionmentioning

confidence: 99%

Generic Adaptively Secure Searchable Phrase Encryption

Kissel

Wang

2016

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Abstract:In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement, and is proven secure under adaptively chosen query attacks (CQA2) in the random oracle model with an honest-but-curious adversary. To our knowledge, this is the first encrypted phrase search system that achieves CQA2 security. Moreover, we demonstrate that our document collection preprocessing algorithm allows us to extend a dynamic SSE construction so that it supports phrase queries. We also provide a compiler theorem which transforms any CQA2-secure SSE construction for keyword queries into a CQA2-secure SSE construction that supports phrase queries.

show abstract

“…Usage of symmetric searchable encryption and the absence of a user verifiability feature in the schemes proposed by Chai et al (2012) and Kissel et al (2013) make the schemes unsuitable for a successful search. The verifiable conjunctive keyword search scheme proposed by Cheng et al (2015) also makes use of symmetric searchable encryption.…”

Section: Related Workmentioning

confidence: 99%

User Verifiable Multiple Keyword Search Scheme using the Merkle Tree for Outsourced Data in the Cloud

Devi¹,

Ganesan²

2017

IJTech

View full text Add to dashboard Cite

Cloud computing has revolutionized the IT industry by offering huge storage for data outsourcing and also for computation. Various security issues concerned with security and privacy of data arise in the context of data outsourcing. The framework enables clients to outsource encrypted data to the cloud, enables users to retrieve preferred documents using multiple keywords and allows the user to verify the response from the server. The strength of the proposed model relies on the discrete logarithmic problem of Hyper Elliptic Curve Cryptography (HECC) and the security of Merkle trees. The paper proposes a user verifiable multi-keyword search scheme, which focuses on: (i) construction of inverted index for the documents with keywords; (ii) index and document encryption by HECC; (iii) index and document authentication by the Merkle tree; and (iv) verification of the accuracy of response from server by top hash or root hash value of the Merkle tree. Security analysis and results demonstrate the correctness of proposed multiple keyword search (MKS) scheme. The search algorithm combined with the hash value verification process by the Merkle tree is strong enough to provide data security, privacy, and integrity. The proposed model reduces the storage overhead on both the client's and user's side. As the number of documents increases, the retrieval time is less, which reduces the storage overhead on both sides.

show abstract

Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers

Cited by 216 publications

References 11 publications

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Generic Adaptively Secure Searchable Phrase Encryption

User Verifiable Multiple Keyword Search Scheme using the Merkle Tree for Outsourced Data in the Cloud

Contact Info

Product

Resources

About