LightDID-ZKP: Policy- and Resource-Aware Selection of BBS and AnonCreds Verifiable Presentations

Inside the System

Project overview

LightDID-ZKP is a research framework introducing CAPS-ZK, a policy- and resource-aware selector for BBS and AnonCreds privacy-preserving verifiable presentations.

Choose a project explanation mode

Result

Controlled Evaluation

2,405-byte VP BBS presentation size at 64 attributes

50 measured runs per configuration

How was this measured?
Evaluation
50 measured runs per configuration
Scope
Controlled Evaluation
Baseline
AnonCreds VP size at 64 attributes: 29,573 bytes.
Method
Five warmups preceded 50 measured BBS and AnonCreds runs at each attribute count from 4 through 64, with presentation latency, verification latency, size, memory, and variability recorded.
Review the evaluation source

Business Problem

Decentralized identity systems increasingly support privacy-preserving verifiable presentations. A holder wallet may support more than one presentation mechanism, but each mechanism is suitable for a different kind of verifier request.

For example, a verifier may ask for selected attributes such as name, degree, institution, or membership status. In such cases, a BBS-style selective-disclosure presentation can reveal only the required fields while hiding the rest.

Another verifier may ask for a predicate such as age greater than 18, income above a threshold, eligibility status, or another credential-backed condition. In that case, simple selective disclosure is not enough because the verifier needs proof that a hidden predicate is satisfied.

LightDID-ZKP addresses this decision problem. It introduces a selector that does not treat all proof systems as interchangeable. Instead, it checks the policy, privacy level, predicate requirement, issuer binding, freshness rule, status-policy requirement, and device constraints before selecting the presentation backend.


From: Why This Project Exists

Proposed Solution

LightDID-ZKP selects the right privacy-preserving presentation mechanism by checking verifier policy semantics, privacy requirements, credential-backed predicate needs, and device resource limits before applying cost scoring.

The core idea is simple:

Do not choose the cheapest proof first. Choose only from mechanisms that satisfy the verifier policy and privacy semantics, then optimize for cost.


From: One-Line Idea

Outcome

Documented in project article

The selector routes selective disclosure to BBS, predicate requirements to AnonCreds, and blocks unsafe cost-first substitution. At 64 attributes the published table reports BBS 377.45 ms presentation, 125.36 ms verification, 2,405-byte VP, and 143.00 MB RSS versus AnonCreds 190.44 ms, 186.45 ms, 29,573-byte VP, and 286.62 MB RSS.

Cost and Risk Reduction

Not quantified

Quantified financial impact has not yet been documented.

Deployment Context

Research Prototype

Reproducible research package and selector prototype with optional real-backend benchmarks; no public production deployment is claimed.

Key Capabilities

  • Security

Evidence and Project Links

Reactions

0 reactions

Comments