A Note on ``Privacy-Preserving Multi-Keyword Searchable Encryption for Distributed Systems''

Zhengjun Cao; Lihua Liu

Paper 2023/814

A Note on ``Privacy-Preserving Multi-Keyword Searchable Encryption for Distributed Systems''

Zhengjun Cao

Lihua Liu

Abstract

We show that the searchable encryption scheme [IEEE Trans. Parallel Distrib. Syst., 32 (3), 2021, 561--574] cannot work because the Data Provider's secret key $sk_{DP}$ and the Request User's secret key $sk_{RU}$ are not available to the Cloud Platform (CP) or the Internal Server (IS). The CP and IS cannot finish the secure bit-decomposition protocol, which requires CP or IS to decrypt the blinded integer so as to securely handle the least significant bit of the target integer.

Metadata

Available format(s): PDF
Category: Attacks and cryptanalysis
Publication info: Preprint.
Keywords: Encryption of least-significant bit Paillier cryptosystem Searchable Encryption Secure bit-decomposition.
Contact author(s): caozhj @ shu edu cn
liulh @ shmtu edu cn
History: 2023-06-06: approved; 2023-06-02: received; See all versions
Short URL: https://ia.cr/2023/814
License: CC0

BibTeX

@misc{cryptoeprint:2023/814,
      author = {Zhengjun Cao and Lihua Liu},
      title = {A Note on ``Privacy-Preserving Multi-Keyword Searchable Encryption for Distributed Systems''},
      howpublished = {Cryptology ePrint Archive, Paper 2023/814},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/814}},
      url = {https://eprint.iacr.org/2023/814}
}