Publicly verifiable database scheme with efficient keyword search

DOI10.1016/J.INS.2018.09.067zbMATH Open1442.68047OpenAlexW2895056122WikidataQ129139043 ScholiaQ129139043MaRDI QIDQ2201628FDOQ2201628

Yanyan Li

Publication date: 29 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.09.067

zbMATH Keywords

cloud computingsearchable encryptionvector commitmentverifiable database

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Database theory (68P15) Internet topics (68M11)

Cites Work

• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Verifiable Delegation of Computation over Large Datasets
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Verifiable Computation over Large Database with Incremental Updates
• An efficient non-interactive multi-client searchable encryption with support for Boolean queries
• Vector Commitments and Their Applications
• Verifiable Auditing for Outsourced Database in Cloud Computing
• Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
• Low-Leakage Secure Search for Boolean Expressions
• Publicly verifiable databases with efficient insertion/deletion operations

Cited In (2)

• Publicly verifiable databases with efficient insertion/deletion operations
• VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM

This page was built for publication: Publicly verifiable database scheme with efficient keyword search

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