Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

@inproceedings{Camenisch2002DynamicAA,
  title={Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials},
  author={Jan Camenisch and Anna Lysyanskaya},
  booktitle={CRYPTO},
  year={2002}
}
We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one to dynamically add and delete a value, such that the cost of an add or delete is independent of the number of accumulated values. We provide a construction of a dynamic accumulator and an efficient zero-knowledge proof of knowledge of an… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 505 CITATIONS

Dynamic reversed accumulator

  • International Journal of Information Security
  • 2017
VIEW 16 EXCERPTS
HIGHLY INFLUENCED

BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs

  • ACM Trans. Inf. Syst. Secur.
  • 2010
VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users

  • ACM Trans. Inf. Syst. Secur.
  • 2008
VIEW 9 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation

  • IACR Cryptology ePrint Archive
  • 2005
VIEW 17 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Anonymity for Decentralized Electronic Cash Systems

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Efficient Public-Key Revocation Management for Secure Smart Meter Communications Using One-Way Cryptographic Accumulators

  • 2018 IEEE International Conference on Communications (ICC)
  • 2018
VIEW 12 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Accumulators with Applications to Anonymity-Preserving Revocation

  • 2017 IEEE European Symposium on Security and Privacy (EuroS&P)
  • 2017
VIEW 15 EXCERPTS
CITES METHODS & BACKGROUND

An Expressive (Zero-Knowledge) Set Accumulator

  • 2017 IEEE European Symposium on Security and Privacy (EuroS&P)
  • 2017
VIEW 5 EXCERPTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2002
2019

CITATION STATISTICS

  • 82 Highly Influenced Citations

  • Averaged 27 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

On the generation of cryptographically strong pseudorandom sequences

A. Shamir
  • In ACM Transaction on Computer Systems,
  • 1983
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Dynamic accumulators and application to efficient revocation of anonymous credentials

J. Camenisch, A. Lysyanskaya
  • 2001
VIEW 2 EXCERPTS

Practical forward secure group signature schemes

  • ACM Conference on Computer and Communications Security
  • 2001
VIEW 1 EXCERPT