Efficient accumulators without trapdoor. (Extended abstract)
From MaRDI portal
(Redirected from Efficient accumulators without trapdoor. (Extended abstract))
Recommendations
- One-way accumulators: A decentralized alternative to digital signatures
- An efficient dynamic and distributed cryptographic accumulator
- Universal Accumulators with Efficient Nonmembership Proofs
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- Fast accumulated hashing
Cited in
(15)- Dynamic universal accumulator with batch update over bilinear groups
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Authenticated hash tables based on cryptographic accumulators
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Efficient Asynchronous Accumulators for Distributed PKI
- Zero-Knowledge Accumulators and Set Algebra
- Universal Accumulators with Efficient Nonmembership Proofs
- An efficient dynamic and distributed cryptographic accumulator
- Fast accumulated hashing
- One-way accumulators: A decentralized alternative to digital signatures
- Optimally sound sigma protocols under DCRA
- Efficient verifiable delay functions
- Trustless unknown-order groups
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- Multi-party revocation in sovrin: performance through distributed trust
This page was built for publication: Efficient accumulators without trapdoor. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945394)