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

Camenisch, J., & Lysyanskaya, A. (2001). An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. EUROCRYPT 2001.

Type

Book chapter

Intellectual base

Review or monograph

Year

2001

DOI

10.1007/3-540-44987-6_7

ISBN

9783540420705

Link

https://doi.org/10.1007/3-540-44987-6_7

Cited from

communication_media_studies, computer_science

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Vouched Anonymity
  • A predicate standing in for a name. What crosses is a claim about a property — held this role, saw this event, meets this threshold — and the arrangement's usefulness is bounded by what that property licenses.
• Zero Knowledge Proof
  • The zero-knowledge design decouples them: a verifiable credential lets the holder (prover) present a proof that the signed birth-date attribute satisfies the \(\ge 21\) predicate, which the bartender or website (verifier) checks against the issuer's signature, while the date itself never crosses the channel. Completeness: a genuinely-of-age holder always passes. Soundness: the issuer's signature prevents forging the underlying attribute.

    This sourceAnonymous/selective-disclosure credentials in which a signed attribute (e.g., age) is proven to satisfy a predicate without revealing the attribute, with issuer signatures preventing forgery.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:38d5e191ff16 · see in the full table