Publicly verifiable databases with efficient insertion/deletion operations

DOI10.1016/J.JCSS.2016.07.005zbMath1370.68072OpenAlexW2522033699MaRDI QIDQ2396817

Yanyan Li

Publication date: 26 May 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.07.005

zbMATH Keywords

bilinear pairingspublic verifiabilityvector commitmentverifiable databaseoutsourcing of storage

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Publicly verifiable database scheme with efficient keyword search

Cites Work

• Unnamed Item
• Verifiable Auditing for Outsourced Database in Cloud Computing
• Verifiable Computation over Large Database with Incremental Updates
• Secure Delegation of Elliptic-Curve Pairing
• Shadow Generation Protocol in Linguistic Threshold Schemes
• Vector Commitments and Their Applications
• Verifiable Delegation of Computation over Large Datasets
• Information and Communications Security
• Theory of Cryptography

This page was built for publication: Publicly verifiable databases with efficient insertion/deletion operations