Towards efficient verifiable conjunctive keyword search for large encrypted database

DOI10.1007/978-3-319-98989-1_5zbMath1496.68130OpenAlexW2885251908MaRDI QIDQ2167746

Yanyan Li

Publication date: 25 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-98989-1_5

zbMATH Keywords

accumulatorsearchable encryptionconjunctive keyword searchverifiable search

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Related Items (3)

Dynamic multi-client searchable symmetric encryption with support for Boolean queries ⋮ Updatable searchable symmetric encryption: definitions and constructions ⋮ Structured encryption for knowledge graphs

Cites Work

• Towards multi-user searchable encryption supporting Boolean query and fast decryption
• An efficient non-interactive multi-client searchable encryption with support for Boolean queries
• Multi-user cloud-based secure keyword search
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Verifiable Auditing for Outsourced Database in Cloud Computing
• Two-Factor Data Security Protection Mechanism for Cloud Storage System
• Applied Cryptography and Network Security
• Verifiable Computation over Large Database with Incremental Updates
• Information and Communications Security
• Efficient No-dictionary Verifiable Searchable Symmetric Encryption

This page was built for publication: Towards efficient verifiable conjunctive keyword search for large encrypted database