How to win the clonewars: efficient periodic n-times anonymous authentication

@inproceedings{Camenisch2006HowTW,
  title={How to win the clonewars: efficient periodic n-times anonymous authentication},
  author={Jan Camenisch and Susan Hohenberger and Markulf Kohlweiss and Anna Lysyanskaya and Mira Meyerovich},
  booktitle={ACM Conference on Computer and Communications Security},
  year={2006}
}
We create a credential system that lets a user anonymously authenticate at most $n$ times in a single time period. A user withdraws a dispenser of n e-tokens. She shows an e-token to a verifier to authenticate herself; each e-token can be used only once, however, the dispenser automatically refreshes every time period. The only prior solution to this problem, due to Damgård et al. [29], uses protocols that are a factor of k slower for the user and verifier, where k is the security parameter… CONTINUE READING

Topics from this paper.

Citations

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

Identity and Anonymity in Ad Hoc Networks

VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Periodic $K$ -Times Anonymous Authentication With Efficient Revocation of Violator’s Credential

  • IEEE Transactions on Information Forensics and Security
  • 2015
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FARB: Fast Anonymous Reputation-Based Blacklisting without TTPs

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Anon-Pass: Practical Anonymous Subscriptions

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Decentralized Anonymous Credentials

  • IACR Cryptology ePrint Archive
  • 2013
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Road-to-Vehicle Communications With Time-Dependent Anonymity: A Lightweight Construction and Its Experimental Results

  • IEEE Transactions on Vehicular Technology
  • 2014
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2006
2019

CITATION STATISTICS

  • 16 Highly Influenced Citations

References

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

Compact E-Cash

  • IACR Cryptology ePrint Archive
  • 2005
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

Unclonable Group Identification

  • IACR Cryptology ePrint Archive
  • 2005
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

B

L. Ballard, M. Green
  • de Medeiros, and F. Monrose. Correlation-Resistant Storage. Johns Hopkins University, Technical Report # TR-SP-BGMM-050705
  • 2005
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A New Two-Party Identity-Based Authenticated Key Agreement

  • IACR Cryptology ePrint Archive
  • 2004
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A Verifiable Random Function With Short Proofs and Keys

  • IACR Cryptology ePrint Archive
  • 2004
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…