Cited by 1,321Cryptography and Data SecurityAdvanced Authentication Protocols SecurityInternet Traffic Analysis and Secure E-voting

An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

Camenisch, Jan, Lysyanskaya, Anna·2001·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/3-540-44987-6_7

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The European Certificate Policy defines an architecture based on commonly changing pseudonym certificates and PKI to ensure authenticity and integrity with a minimum impact on privacy.

    “Indeed, the'' European Certi cate Policy for Deployment and Operation of European Cooperative Intelligent Transport Systems (C-ITS)'' 12 de nes an architecture based on commonly changing pseudonym certi cates and PKI to ensure authenticity and integrity with a minimum impact on privacy.”

Cited by

Sorted by citations

Authors
Camenisch, J., & Lysyanskaya, A.
Affiliations
  • IBM Research - Zurich (CH)
  • Massachusetts Institute of Technology (US)
Venue
Lecture Notes in Computer Science
Published
2001
Pages
93-118
ISSN
0302-9743 (ISSN-L)
OpenAlex
W2165210192
Cited by
1,321
References
0
Citations by year
2026: 60 · 2025: 66 · 2024: 50 · 2023: 58 · 2022: 45 · 2021: 62 · 2020: 29 · 2019: 43 · 2018: 38 · 2017: 52 · 2016: 54 · 2015: 90 · 2014: 77 · 2013: 80 · 2012: 77
FWCI
12.26
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
anonymous credentials, unlinkability, anonymity revocation, strong RSA assumption, decisional Diffie-Hellman assumption, identity privacy, random oracle model

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review