Secure database commitments and universal arguments of quasi knowledge
From MaRDI portal
Recommendations
- Updatable Zero-Knowledge Databases
- Sublinear zero-knowledge arguments for RAM programs
- Somewhere statistically binding commitment schemes with applications
- Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
- Efficient consistency proofs for generalized queries on a committed database
Cited in
(8)- Somewhere statistically binding commitment schemes with applications
- Zero-knowledge elementary databases with more expressive queries
- Private set intersection: new generic constructions and feasibility results
- Size-Hiding Computation for Multiple Parties
- Efficient consistency proofs for generalized queries on a committed database
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
- Zero-knowledge functional elementary databases
- Computationally secure pattern matching in the presence of malicious adversaries
This page was built for publication: Secure database commitments and universal arguments of quasi knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914263)