Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries

DOI10.1007/978-3-319-72359-4_20MaRDI QIDQ5056028zbMATH OpenOpenAlexFDO

Authors Yanjun Shen, Peng Zhang

Publication date 9 December 2022

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72359-4_20

zbMATH Keywords

conjunctive queriesorder-preserving encryptionranked searchsearchable symmetric encryption

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Data encryption (aspects in computer science) (68P25)

Recommendations

• Generic multi-keyword ranked search on encrypted cloud data
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Toward practical searchable symmetric encryption
• Dynamic multi-client searchable symmetric encryption with support for Boolean queries
• Enabling efficient and verifiable multi-keyword ranked search over encrypted cloud data

Cites work

• Applied Cryptography and Network Security
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Information and Communications Security
• Order-preserving encryption revisited: improved security analysis and alternative solutions
• Order-Preserving Symmetric Encryption
• Privacy Preserving Keyword Searches on Remote Encrypted Data

Cited in

(5)

• Generic multi-keyword ranked search on encrypted cloud data
• Dynamic multi-client searchable symmetric encryption with support for Boolean queries
• Toward practical searchable symmetric encryption
• Efficient searchable symmetric encryption for join queries
• Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption

This page was built for publication: Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056028)