Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

By Jan Camenisch, Anna Lysyanskaya. Annual International Cryptology Conference, 2002

984 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/54526178a9d3f860072b78717eab01e49209a4ba

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Anonymous Identification in Ad Hoc Groups (2004, methodology): “Recently, work by Tsudik and Xu [35], building on the work by Camenisch and Lysyanskaya [15], investigated techniques to obtain more flexible dynamic accumulators, on which to base group signature schemes (which is one of our applications).”
Efficient Protocols for Set Membership and Range Proofs (2008, background): “protocol that a committed value is indeed contained in the accumulator based on the strong RSA assumption[6].”
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, methodology): “It is hard to design group signatures and most schemes [17,16,3,14,2,13,31,15,10,26,32] use the random oracle model in the security proof.”
Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021, background): “Whereas accumulator-based solutions [20, 21] and algebraic Schnorr proofs exist in the area, they are quite involving and thus error-prone, require a trusted setup, are limited in statement language, and are often slow.”
Verifiable Delegation of Computation over Large Datasets (2011, background): “This issue has been addressed in the line of works on cryptographic accumulators [16,47,53], and, using different techniques, in the authenticated datastructures literature [48,41,52,59].”
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks (2010, background): “The access group owner maintains the following information: the AUTHlog, the accumulated valueD [31] for automatically revoking access rights of the group members, and a public archive ARC of the form (a; b;D), where b 1⁄4 1; 0 indicates the grant, revocation of an”
Secret handshakes from pairing-based key agreements (2003, background): “A group of users who wish to recognize each other without the use of membership lists or a central authority may choose to form an object called an accumulator and witnesses for each user in the accumulator [5, 2, 19, 10].”
Direct anonymous attestation (2004, methodology): “As our scheme employs the Camenisch-Lysyanskaya signature scheme [8, 31] and the respective discrete logarithms based proofs to prove possession of a certificate, unforgeability of certificates holds under the strong RSA assumption and privacy and anonymity is guaranteed under the decisional Diffie-”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “Such proofs can be realized with practical efficiency [16,17] and incur only cost to the user and the verifier that are independent of the number of revoked or currently valid credentials.”
On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “to the schemes’ efficiency [37], [38], [39], however, largel y focus on dynamic or incremental changes to the elements being hashed/authenticated, e.”
Vector Commitments and Their Applications (2013, background): “Solutions to this problem have been addressed by works on accumulators [27, 7, 8], authenticated data structures [26, 22, 28, 32], and the recent work on verifiable computation [4].”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “The mechanisms introduced in [15] can be used for revoking CL signatures.”
Attribute-based signature and its applications (2010, background): “In the traditional credential systems [5, 7, 6, 8], commonly known as CL credential systems, users are not allowed to demonstrate multiple credentials at the same time.”
A Survey of COVID-19 Contact Tracing Apps (2020, background): “…apps from the centralised and hybrid categories have introduced additional measures (such as random, independent uploads of contact identiﬁers/EphIDs, maintaining separate upload and query identiﬁers, using zero knowledge proofs [37] to store anonymized social graph at the server [38] etc.).”