Forward and Backward Private Conjunctive Searchable Symmetric Encryption

Patranabis, Sikhar; Mukhopadhyay, Debdeep

doi:10.14722/ndss.2021.23116

Cited by 40 publications

(29 citation statements)

References 27 publications

(108 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, Sun et al [10] proposed a symmetric puncturable encryption scheme in 2018, which makes the server lose the ability to search for deleted documents containing certain keywords and provides a new form of encryption for the field of SE. In 2021, Patranabis and Mukhopadhyay [11] proposed a dynamic SE scheme that satisfies forward and backward privacies and supports conjunctive keyword searches. In addition, to adapt to more advanced functions, more researchers have performed a series of works on other aspects, such as query function [12,13] and performance optimization [14][15][16] .…”

Section: Related Workmentioning

confidence: 99%

“…If no adversary can obtain any information of the previous search query through the update, then this situation satisfies forward privacy [11] .…”

Section: Forward Privacymentioning

confidence: 99%

“…Then, the PPSE solution is backward privacy. Backward privacy is divided into three different levels, and the PPSE scheme achieves Type II backward privacy [11] .…”

Section: Backward Privacymentioning

confidence: 99%

See 2 more Smart Citations

Privacy-Preserving Searchable Encryption Scheme Based on Public and Private Blockchains

2023

Tsinghua Sci. Technol.

View full text Add to dashboard Cite

While users enjoy the convenience of data outsourcing in the cloud, they also face the risks of data modification and private information leakage. Searchable encryption technology can perform keyword searches over encrypted data while protecting their privacy and guaranteeing the integrity of the data by verifying the search results. However, some associated problems are still encountered, such as the low efficiency of verification and uncontrollable query results. Accordingly, this paper proposes a Privacy-Preserving Searchable Encryption (PPSE) scheme based on public and private blockchains. First, we store an encrypted index in a private blockchain while outsourcing corresponding encrypted documents to a public blockchain. The encrypted documents are located through the encrypted index. This method can reduce the storage overhead on the blockchains, and improve the efficiency of transaction execution and the security of stored data. Moreover, we adopt a smart contract to introduce a secondary verification access control mechanism and restrict data users' access to the private blockchain through authorization for the purpose of guaranteeing data privacy and the correctness of access control verification. Finally, the security analysis and experimental results indicate that compared with existing schemes, the proposed scheme can not only improve the security of encrypted data but also guarantee the efficiency of the query.

show abstract

Section: Related Workmentioning

confidence: 99%

“…If no adversary can obtain any information of the previous search query through the update, then this situation satisfies forward privacy [11] .…”

Section: Forward Privacymentioning

confidence: 99%

See 1 more Smart Citation

Privacy-Preserving Searchable Encryption Scheme Based on Public and Private Blockchains

2023

Tsinghua Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…A series of SE schemes with forward privacy (FPSE) have been proposed. These schemes achieve the single keyword search 16,17 or conjunctive keyword search, 18 but not multikeyword search. Compared with the conjunctive keyword search which achieve the AND logic search, multikeyword search is a OR logic search.…”

Section: Introductionmentioning

confidence: 99%

Forward privacy multikeyword ranked search over encrypted database

Zhao

Zhang

et al. 2022

Int J of Intelligent Sys

View full text Add to dashboard Cite

show abstract

“…A naive but straightforward implementation of searchable encryption consists in issuing functional keys for circuits searching a specific keywords. In the recent years several schemes of SSE have been proposed [17,19] based on different assumptions and targeting advance properties. Our construction addresses a completely different flavour and unlike the existing schemes has been built using the Bloom filters.…”

Section: Introductionmentioning

confidence: 99%

Partitioned Searchable Encryption

Barthel

Beunardeau²,

Roşie³

et al. 2021

Provable and Practical Security

View full text Add to dashboard Cite

Symmetric searchable encryption (SSE) allows to outsource encrypted data to an untrusted server and retain searching capabilities. This is done without impacting the privacy of both the data and the search/update queries. In this work we put forth a new flavour of symmetric searchable encryption (SSE):Partitioned SSE is meant to capture the cases where the search rights must be partitioned among multiple individuals. We motivate through compelling examples the practical need for such a notion and discuss instantiations based on functional encryption and trapdoor permutations.-First we leverage the power of functional encryption (FE). Our construction follows the general technique of encrypting the set of keywords and the presumably larger datafiles separately, a keyword acting as a "pointer" to datafiles it belongs to. To improve on the constraint factors (large ciphertext, slow encryption/decryption procedures) that are inherent in FE schemes, the keyword check is done with the help of a Bloom filter -one per datafile: the crux idea is to split the filter into buckets, and encrypt each bucket separately under an FE scheme. Functional keys are given for binary masks checking if relevant positions are set to 1 inside the underlying bit-vector of the Bloom filter.-The second construction we present achieves forward security and stems from the scheme by Bost in CCS'16. We show that a simple tweak of the original construction gives rise to a scheme supporting updates in the partitioned setting. Moreover, the constructions take into account the possibility that some specific users are malicious while declaring their search results.

show abstract

Forward and Backward Private Conjunctive Searchable Symmetric Encryption

Cited by 40 publications

References 27 publications

Privacy-Preserving Searchable Encryption Scheme Based on Public and Private Blockchains

Privacy-Preserving Searchable Encryption Scheme Based on Public and Private Blockchains

Forward privacy multikeyword ranked search over encrypted database

Partitioned Searchable Encryption

Contact Info

Product

Resources

About