notes: research/papers/papers-alice-attempts-to-abuse-a-verifiable-credential

This data as json

path title type status classification words body
research/papers/papers-alice-attempts-to-abuse-a-verifiable-credential Alice Attempts to Abuse a Verifiable Credential summary v0.1 — 2026-10-15: drafted by Claude from the PDF in the Papers repository; unread by Mark; marked partner on Mark's word 2026-10-21, paraphrase only partner 463 # Alice Attempts to Abuse a Verifiable Credential **Abstract.** A Rebooting the Web of Trust (RWOT) IX white paper (Prague, 2019) by P. Dingle, S. Hammann (lead author), D. Hardman, C. Winczewski and S. Smith that uses a fictional prescription scenario to examine fraud by a malicious credential holder against verifiable credentials (VCs), comparing traditionally signed and zero-knowledge proof (ZKP) credentials. It closes with best practices for verifiers and a survivability perspective. For designers and verifiers of credential systems. ## Summary The paper frames a subset of the fraud problem: attacks by a malicious holder. Alice receives a prescription as a verifiable credential for a fictional drug (melange, from Dune), set in a future where VCs are common. Issuers and verifiers are assumed honest; only the holder is malicious. Alice then tries a series of attacks, each examined for a traditionally signed credential and a ZKP-enabled one. She tampers with the dosage, forges a prescription from a non-existent doctor, uses the prescription after expiration, sells it, rents it, attempts a visual hack, double-spends it, attacks the pharmacy's systems, blocks the pharmacy's connectivity to defeat checks, and finally uses a revoked credential. Countermeasures discussed include signature and proof verification, checks against trusted issuers, embedded biometrics checked by the verifier, link secrets protected by a bond that can be confiscated, requiring a single coherent presentation, and revocation lists or privacy-preserving revocation registries. A best-practices section lists rules for verifiers in roughly the order they apply: do not let others decide parts of the verification process; verification by the holder gives no guarantee; be explicit about acceptable issuers and schemas; beware third-party verifiers; treat holder data as untrusted input; and others. A survivability section borrows the military view of susceptibility, vulnerability and recoverability, noting that biometric and bonded link-secret measures reduce susceptibility by undermining incentives. The summary says Alice's attempts were detected or undone in each case, and that implementers should do their own threat analysis. ## Key terms verifiable credential, malicious holder, traditionally signed credential, ZKP-enabled credential, link secret, link secret bond, biometric, revocation registry, trust framework, survivability ## Claims and their evidence - A tampered traditionally signed credential fails verification because the recomputed hash differs from the signed one. [informative] - A link secret bond makes selling a ZKP credential unattractive because the bond can be confiscated publicly. [informative] - Verification performed by the holder provides no guarantees to the verifier. [informative] - Biometric and bonded-link-secret measures reduce susceptibility to attack rather than vulnerability. [informative] ## Related W3C Verifiable Credentials Data Model; other RWOT papers by Samuel M. Smith in the Papers repository. ## Provenance Drafted by Claude on 2026-10-15 from the PDF `whitepapers/alice-attempts-abuse-verifiable-credential.pdf` (RWOT IX, dated 2019-11-19, version 1.0, CC BY 4.0), text extracted and read in full. Not yet read by Mark.

Links from other tables