Universal Accumulators with Efficient Nonmembership Proofs

DOI10.1007/978-3-540-72738-5_17zbMath1214.94049MaRDI 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

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Vector Commitments and Their Applications, Zero-knowledge proofs for set membership: efficient, succinct, modular, Lattice-based accumulator with constant time list update and constant time verification, 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?, Authenticated hash tables based on cryptographic accumulators, Efficient authenticated data structures for graph connectivity and geometric search problems, Cryptanalysis of a dynamic universal accumulator over bilinear groups, New code-based cryptographic accumulator and fully dynamic group signature, Zero-knowledge proofs for set membership: efficient, succinct, modular, Dynamic universal accumulator with batch update over bilinear groups, Attribute-based signatures from RSA, Merkle trees optimized for stateless clients in bitcoin, KVaC: key-value commitments for blockchains and beyond, Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives, Efficient Asynchronous Accumulators for Distributed PKI, Zero-Knowledge Accumulators and Set Algebra, A General, Flexible and Efficient Proof of Inclusion and Exclusion, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials, Statistically Hiding Sets, Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems