Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives

DOI10.1007/978-3-319-16715-2_7zbMath1382.94088OpenAlexW2169008587MaRDI QIDQ2790034

David Derler, Daniel Slamanig, Christian Hanser

Publication date: 2 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_7

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Incentive-driven attacker for corrupting two-party protocols ⋮ UC Updatable Databases and Applications ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Merkle trees optimized for stateless clients in bitcoin ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Efficient Asynchronous Accumulators for Distributed PKI ⋮ Post-quantum ID-based ring signatures from symmetric-key primitives ⋮ New code-based cryptographic accumulator and fully dynamic group signature

Cites Work

• Mercurial commitments with applications to zero-knowledge sets
• Computing on Authenticated Data
• Bivariate Polynomials Modulo Composites and Their Applications
• Constant-Size Commitments to Polynomials and Their Applications
• Revocation for Delegatable Anonymous Credentials
• On the Impossibility of Batch Update for Cryptographic Accumulators
• Universal Accumulators with Efficient Nonmembership Proofs
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
• Fast accumulated hashing
• Vector Commitments and Their Applications
• On Updatable Redactable Signatures
• On Extended Sanitizable Signature Schemes
• A New Dynamic Accumulator for Batch Updates

This page was built for publication: Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives