An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
From MaRDI portal
Publication:3615634
DOI10.1007/978-3-642-00468-1_27zbMath1227.94074MaRDI QIDQ3615634
Claudio Soriente, Jan Camenisch, Markulf Kohlweiss
Publication date: 24 March 2009
Published in: Public Key Cryptography – PKC 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00468-1_27
94A62: Authentication, digital signatures and secret sharing
Related Items
Vector Commitments and Their Applications, UC Updatable Databases and Applications, Zero-knowledge proofs for set membership: efficient, succinct, modular, Anonymous tokens with public metadata and applications to private contact tracing, Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors, Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials, Authenticated hash tables based on cryptographic accumulators, Structure-preserving signatures and commitments to group elements, Cryptanalysis of a dynamic universal accumulator over bilinear groups, New constructions of hinting PRGs, OWFs with encryption, and more, New code-based cryptographic accumulator and fully dynamic group signature, Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages, Zero-knowledge proofs for set membership: efficient, succinct, modular, Stronger notions and a more efficient construction of threshold ring signatures, Dynamic universal accumulator with batch update over bilinear groups, An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users, MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system, Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives, Zero-Knowledge Authenticated Order Queries and Order Statistics on a List, Towards Lightweight Anonymous Entity Authentication for IoT Applications, Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources, Short Transitive Signatures for Directed Trees, Zero-Knowledge Accumulators and Set Algebra, Traceable Identity-Based Group Signature, Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials
