English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Ranked keyword search over encrypted cloud data is a hot research topic with huge practical implications. A complex variant of this problem is to allow searching among ciphertexts belonging to multiple data owners. Unfortunately, there exist only a few papers in the literature which address this important setting. Recently, Zhang et al. proposed a solution to this problem and claimed that their scheme provides two fundamental security requirements: ciphertext and trapdoor indistinguishability. We prove, however, that in their scheme neither the ciphertexts nor the trapdoors achieve indistinguishability. Our result shows that their scheme is insecure to be used in practice.

On the Security of a Privacy-Preserving Ranked Multi-Keyword Search Scheme.