Publicly verifiable database scheme with efficient keyword search
From MaRDI portal
Publication:2201628
Recommendations
- Publicly verifiable databases with efficient insertion/deletion operations
- Towards efficient verifiable conjunctive keyword search for large encrypted database
- Verifiable dictionary-based searchable encryption scheme
- Verifiable computation over large database with incremental updates
- Extended functionality in verifiable searchable encryption
Cites work
- An efficient non-interactive multi-client searchable encryption with support for Boolean queries
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Low-leakage secure search for Boolean expressions
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Publicly verifiable databases with efficient insertion/deletion operations
- Vector commitments and their applications
- Verifiable Auditing for Outsourced Database in Cloud Computing
- Verifiable Computation over Large Database with Incremental Updates
- Verifiable delegation of computation over large datasets
Cited in
(5)- Publicly verifiable databases with efficient insertion/deletion operations
- VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
- Towards efficient verifiable conjunctive keyword search for large encrypted database
- Verifiable dictionary-based searchable encryption scheme
- Verifiable computation over large database with incremental updates
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)