Universal Accumulators with Efficient Nonmembership Proofs
From MaRDI portal
Publication:3612386
DOI10.1007/978-3-540-72738-5_17zbMath1214.94049OpenAlexW1562394980MaRDI QIDQ3612386
Jiangtao Li, Ninghui Li, Rui Xue
Publication date: 10 March 2009
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72738-5_17
Related Items (21)
Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Merkle trees optimized for stateless clients in bitcoin ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Attribute-based signatures from RSA ⋮ Vector Commitments and Their Applications ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Statistically Hiding Sets ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Efficient Asynchronous Accumulators for Distributed PKI ⋮ New code-based cryptographic accumulator and fully dynamic group signature ⋮ Authenticated hash tables based on cryptographic accumulators
This page was built for publication: Universal Accumulators with Efficient Nonmembership Proofs