-
Notifications
You must be signed in to change notification settings - Fork 0
Policy Model
Anubha Parashar edited this page Jun 22, 2026
·
1 revision
The policy model captures the verifier request and holder-side constraints.
The implementation represents a verifier policy as:
P = (A_R, A_H, Φ, L, R, τ, d, κ, λ)
Where:
| Symbol | Meaning |
|---|---|
A_R |
revealed attributes |
A_H |
hidden attributes |
Φ |
predicate set |
L |
unlinkability requirement |
R |
resource budget |
τ |
nonce / freshness token |
d |
verifier domain |
κ |
issuer or public-material binding |
λ |
privacy-level requirement |
Policy examples are stored in:
configs/policies/
Device profiles are stored in:
configs/devices/
- P1: simple selective disclosure.
- P2: unlinkable selective disclosure.
- P3: credential-backed predicate.
- P4: predicate with hidden attributes.
- P5: unsupported or resource-exceeding request.
Maintained by Dr. Anubha Parashar / @dranubhaparashar. This wiki documents the reproducibility package and claim-safe project boundary for LightDID-ZKP.