Verifiable computation over large database with incremental updates
From MaRDI portal
Publication:5264265
DOI10.1007/978-3-319-11203-9_9zbMATH Open1477.68089OpenAlexW39278537MaRDI QIDQ5264265FDOQ5264265
Authors: Xiaofeng Chen, Jin Li, Jian Weng, W. J. Lou, Jian-Feng Ma 
Publication date: 24 July 2015
Published in: Computer Security - ESORICS 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11203-9_9
Recommendations
Cited In (16)
- Publicly verifiable databases with efficient insertion/deletion operations
- Tell me the truth: practically public authentication for outsourced databases with multi-user modification
- New unbounded verifiable data streaming for batch query with almost optimal overhead
- Verifiable Computation over Large Database with Incremental Updates
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Secure data deduplication with reliable data deletion in cloud
- Verifiable delegation of computation over large datasets
- Towards efficient fully randomized message-locked encryption
- Verifiable set operations over outsourced databases
- Updatable Zero-Knowledge Databases
- Towards efficient verifiable conjunctive keyword search for large encrypted database
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Nearly optimal verifiable data streaming
- Incrementally verifiable computation via incremental PCPs
- A position-aware Merkle tree for dynamic cloud data integrity verification
- Publicly verifiable database scheme with efficient keyword search
This page was built for publication: Verifiable computation over large database with incremental updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264265)
