Authenticated hash tables based on cryptographic accumulators
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256770 (Why is no real title available?)
- scientific article; zbMATH DE number 1941253 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 1759347 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- A New Dynamic Accumulator for Batch Updates
- A general model for authenticated data structures
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Authenticated hash tables based on cryptographic accumulators
- Automata, Languages and Programming
- Checking the correctness of memories
- Computational Complexity of Fourier Transforms Over Finite Fields
- Data and Applications Security XIX
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Efficient Content Authentication in Peer-to-Peer Networks
- Efficient authenticated data structures for graph connectivity and geometric search problems
- How Efficient Can Memory Checking Be?
- Introduction to algorithms.
- Maximum queue size and hashing with lazy deletion
- Optimal authenticated data structures with multilinear forms
- Optimal verification of operations on dynamic sets
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Streaming authenticated data structures
- Super-Efficient Verification of Dynamic Outsourced Databases
- The design of dynamic data structures
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Topics in Cryptology – CT-RSA 2005
- Universal Accumulators with Efficient Nonmembership Proofs
- Verifiable set operations over outsourced databases
Cited in
(15)- Authenticated hash tables based on cryptographic accumulators
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
- Integrity and consistency for untrusted services (extended abstract)
- Optimal authenticated data structures with multilinear forms
- Database outsourcing with hierarchical authenticated data structures
- Optimal verification of operations on dynamic sets
- Secure authenticated comparisons
- COMPASS: a compact PASS-lineage accumulator with succinct proofs
- Authenticated data structures, generically
- Balloon: a forward-secure append-only persistent authenticated data structure
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-Knowledge Accumulators and Set Algebra
This page was built for publication: Authenticated hash tables based on cryptographic accumulators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262258)
