Zero-Knowledge Verification

Prove what's true —
reveal only what's needed

Selective disclosure with BBS+ signatures and ZK proofs. Let a verifier confirm 'this person is over 21' or 'this graduate holds a B.Tech from an accredited institution' — without exposing name, date of birth, or anything else.

BBS+ SignaturesDPDP CompliantGDPR-ReadyW3C VC 2.0
Key Benefits

Why teams choose this solution

Selective Disclosure

Share only the claims that matter for a given transaction — university name without grades, or degree level without university.

Holder Consent Recorded

Every disclosure is cryptographically signed by the holder — irrefutable consent trail for compliance.

No Personal Data On-Chain

The chain stores only proofs and hashes — personal identifiers live in the holder's wallet, encrypted.

Verifier-Side Privacy

Even Gradify can't see what's being verified — proofs are checked locally in the verifier's app.

Anonymous Credentials

Prove membership in a set (e.g. 'enrolled student of an IIT') without revealing which one.

Predicate Proofs

Prove conditional facts ('CGPA > 8.5') without revealing the exact value.

Integrations

Slots into your existing stack

DigiLocker Holder WalletIndia-first

BBS+ credentials issued via Gradify land in DigiLocker for citizen-controlled disclosure.

W3C VC Verifier Libraries

Standards-compliant — works with any VC 2.0-aware verifier worldwide.

Browser SDK

Drop a verification widget into any web app — proof-checking happens client-side.

Mobile SDK (iOS / Android)

Native wallet apps for issuance, storage, and proof generation on-device.

OpenID4VPStandards

Standards-aligned with OpenID for Verifiable Presentations.

DIDComm Messaging

Encrypted, peer-to-peer credential exchange channel.

Underlying Technology

Deep-tech, built in India

Production-grade primitives composed into a single coherent platform.

BBS+ Signatures

RFC-track signature scheme designed for selective disclosure with linkability control.

ZK-SNARKs (Groth16 / PLONK)

Succinct, non-interactive proofs for arbitrary predicates over credential attributes.

Hardware Security Modules

HSM-backed issuer keys with quarterly rotation and split-knowledge custody.

Pairing-Friendly Curves

BLS12-381 for BBS+ operations — battle-tested in Zcash, Filecoin, Ethereum 2.

Reduced Cost

Avoid the ₹250 cr DPDP penalty exposure

India's DPDP Act 2023 penalises personal-data breaches up to ₹250 crore. ZK verification eliminates the data you'd otherwise need to expose, audit, and protect.

Item
Today
With Gradify
You Save
Maximum DPDP Act penalty
₹250,00,00,000
Minimised exposure
Up to ₹250cr
PII data-retention infrastructure
₹40,00,000/yr
Not needed
₹40,00,000
Annual privacy audit cost
₹15,00,000/yr
Reduced 70%
₹10,50,000
Average data-breach response cost
₹17,50,00,000 per incident
Eliminated risk class
Per IBM 2024 India report
Strategic Year-One Value
Risk + ₹55,00,000
Standard subscription
Substantial

Penalty maxima per Section 33 of the DPDP Act 2023 — actual exposure depends on volume + categorisation of personal data.

Why Gradify

The competitive edge

DPDP-Native

Privacy by design, not by patch — built around India's Digital Personal Data Protection Act.

Combinable Proofs

Stack multiple credentials into a single ZK proof — 'over 21 AND graduate of an IIT AND resident of Karnataka'.

Quantum-Aware Roadmap

Active research on post-quantum BBS+ alternatives — your verification stays valid as cryptography evolves.

Audit-Friendly

Every proof generation logged with the holder's signed consent — defensible under regulatory scrutiny.

Frequently asked

Questions teams ask before adopting

Is BBS+ production-ready?+
Yes. BBS+ is on the W3C VC 2.0 standards track and deployed in production by IBM, Microsoft, Dock, and Trinsic. Gradify's implementation uses the Hyperledger Aries reference libraries.
How fast is proof generation?+
On-device proof generation typically takes 150–400ms on modern smartphones for credentials with up to 32 attributes. Verification is sub-50ms.
Can we use ZK proofs without BBS+?+
Yes. For predicate proofs over Ed25519-signed credentials we use Groth16 / PLONK SNARKs. The choice depends on your verifier's capabilities.
Are these proofs reusable?+
By default no — each proof is bound to a specific verifier challenge to prevent replay. Linkability can be opted into for use cases needing recurring verification.
How does this map to DPDP / GDPR?+
ZK verification implements 'data minimisation' (DPDP §5, GDPR Art. 5.1.c) directly in cryptography — you literally cannot expose data you haven't disclosed.

Ready to deploy this solution?

Talk to our team — we'll walk through your specific workflow and share a tailored implementation plan.

Get in Touch