Efficient consistency proofs for generalized queries on a committed database
From MaRDI portal
Recommendations
Cited in
(14)- On the consistency of defeasible databases
- Mercurial commitments with applications to zero-knowledge sets
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Secure database commitments and universal arguments of quasi knowledge
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient Negative Databases from Cryptographic Hash Functions
- Statistically Hiding Sets
- Super-Efficient Verification of Dynamic Outsourced Databases
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Succinct arguments for RAM programs via projection codes
- Zero-knowledge functional elementary databases
- Zero-knowledge RAM: doubly efficient and black-box
- Identity-based trapdoor mercurial commitments and applications
This page was built for publication: Efficient consistency proofs for generalized queries on a committed database
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466536)