On the Correctness of Inverted Index Based Public-Key Searchable Encryption Scheme for Multi-time Search
Shiyu Ji

TL;DR
This paper critiques a recent public-key searchable encryption scheme, demonstrating through a counterexample that it may not be entirely correct, highlighting potential issues in its security or functionality.
Contribution
It provides a critical analysis of an existing inverted index based encryption scheme, revealing possible correctness flaws with a concrete counterexample.
Findings
The scheme may have correctness issues as shown by the counterexample.
The critique questions the reliability of the scheme for multi-time searches.
Highlights the need for further verification of such encryption schemes.
Abstract
In this short note we argue that the state-of-art inverted index based public key searchable encryption scheme proposed by Wang et al may not be completely correct by giving a counterexample.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Coding theory and cryptography
