Boolean symmetric searchable encryption

Moataz, Tarik; Shikfa, Abdullatif

doi:10.1145/2484313.2484347

Cited by 52 publications

(20 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme requires a linear search time and provides some false positive results. Many other schemes have been proposed to improve the efficiency of keyword search by implementing an inverted searchable index [4,6,13,23]. Chang et al [13] showed an index construction that enables keyword search without false positive results.…”

Section: Related Workmentioning

confidence: 99%

“…The score is calculated between the search query (that contains multiple keywords) and the set of encrypted documents. Moataz et al [4] developed the Boolean Symmetric Searchable Encryption (BSSE) scheme. The scheme is based on the orthogonalization of the keywords according to the Gram-Schmidt process.…”

Section: Related Workmentioning

confidence: 99%

“…. , Q t }, the adversary cannot learn any practical information about the content of the search query Q i or the original document collection D. However, these security guarantees are difficult to achieve, and most known searchable encryption schemes [3,4,6,12,13] reveal some information, namely the access pattern and the search pattern. In SSP-SSE, we follow a similar approach to [6] to weaken the security guarantees and allow some limited information to the adversary.…”

Section: Security Model Definitionsmentioning

confidence: 99%

“…In order to enable search over encrypted data, many Searchable Encryption (SE) schemes have been proposed in recent years [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. (Note, we use the term searchable encryption somewhat loosely to include schemes, such as private information retrieval, as well.)…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

2016

View full text Add to dashboard Cite

Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword queries, but cannot handle substring search queries over encrypted data that also involve identifying the position of the substring within the document. These types of queries are relevant in areas such as searching DNA data. In this paper, we propose a tree-based Substring Position Searchable Symmetric Encryption (SSP-SSE) to overcome the existing gap. Our solution efficiently finds occurrences of a given substring over encrypted cloud data. Specifically, our construction uses the position heap tree data structure and achieves asymptotic efficiency comparable to that of an unencrypted position heap tree. Our encryption takes O(kn) time, and the resulting ciphertext is of size O(kn), where k is a security parameter and n is the size of stored data. The search takes O(m 2 + occ) time and three rounds of communication, where m is the length of the queried substring and occ is the number of occurrences of the substring in the document collection. We prove that the proposed scheme is secure against chosen-query attacks that involve an adaptive adversary. Finally, we extend SSP-SSE to the multi-user setting where an arbitrary group of cloud users can submit substring queries to search the encrypted data.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Security Model Definitionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

2016

View full text Add to dashboard Cite

show abstract

“…Considerable amount of research has been done towards this problem that resulted in very efficient and expressive schemes [1][2][3][4][5][6]. However, in searchable encryption schemes, the data to be joined must be encrypted under the same key that has been shared among the owners.…”

Section: Related Workmentioning

confidence: 99%

Privacy Preserving Record Matching Using Automated Semi-trusted Broker

Lazrig

Moataz

Ray

et al. 2015

Data and Applications Security and Privacy XXIX

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we present a novel scheme that allows multiple data publishers that continuously generate new data and periodically update existing data, to share sensitive individual records with multiple data subscribers while protecting the privacy of their clients. An example of such sharing is that of health care providers sharing patients' records with clinical researchers. Traditionally, such sharing is performed by sanitizing personally identifying information from individual records. However, removing identifying information prevents any updates to the source information to be easily propagated to the sanitized records, or sanitized records belonging to the same client to be linked together. We solve this problem by utilizing the services of a third party, which is of very limited capabilities in terms of its abilities to keep a secret, secret, and by encrypting the identification part used to link individual records with different keys. The scheme is based on strong security primitives that do not require shared encryption keys.

show abstract

Graph encryption for all‐path queries

Zhou

Jin

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

SummarySince cloud computing and cloud storage have become a common practice in our daily life, people are paying more attention on protecting the privacy of their sensitive data. In this paper, we consider the problem of graph encryption in such a way that one can perform all‐path queries over an encrypted graph in a privacy‐preserving manner. A solution for such problem has many potential applications in network virtualization since graph data structures are commonly used to represent the topology of substrate and virtual networks. We propose a searchable symmetric encryption scheme for graph data that support all‐path queries. The scheme allows a client to encrypt a sensitive graph and outsource it to an untrusted server for storage. After that, the client can perform arbitrary all‐path queries between a source and a destination. For each query, the server computes and returns all the paths that satisfied the query. We prove that our scheme is secure against adaptive chosen‐query attacks in the semi‐honest setting.

show abstract

Boolean symmetric searchable encryption

Cited by 52 publications

References 25 publications

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Privacy Preserving Record Matching Using Automated Semi-trusted Broker

Graph encryption for all‐path queries

Contact Info

Product

Resources

About