Zero-knowledge functional elementary databases
From MaRDI portal
Recommendations
Cites work
- A statistically-hiding integer commitment scheme based on groups with hidden order
- A survey on IQ cryptography
- Automata, Languages and Programming
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- Efficient group signature schemes for large groups. (Extended abstract)
- Generic lower bounds for root extraction and signature schemes in general groups
- Independent Zero-Knowledge Sets
- KVaC: key-value commitments for blockchains and beyond
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- One-way accumulators: A decentralized alternative to digital signatures
- Optimal verification of operations on dynamic sets
- Primary-secondary-resolver membership proof systems
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Secure database commitments and universal arguments of quasi knowledge
- Statistical zero knowledge protocols to prove modular polynomial relations
- Statistically Hiding Sets
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Updatable Zero-Knowledge Databases
- Vector commitments and their applications
- Zero-Knowledge Accumulators and Set Algebra
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Zero-knowledge elementary databases with more expressive queries
- Zero-Knowledge Sets with Short Proofs
This page was built for publication: Zero-knowledge functional elementary databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604931)
