...
- Specification for Privacy Preserving, Scalable Revocation – https://hackmd.io/LGlyexsRSBqrm7TIKzzZ_A?view – Mike Lodder
- How is binding done to between the credential and the revocation?
- How are keys managed when there are multiple revocation managers (multi-party computation configuration)?
- VC-DI-BBS Specification and AnonCreds V2 – getting to collaboration?
- BBS Signatures specification is moving through IETF – https://datatracker.ietf.org/doc/draft-irtf-cfrg-bbs-signatures/
- Incubation happening at DIF
- DHS has announced support for using BBS Signatures for selective disclosure and unlinkability
- Intended approach is to use Parallel Signatures, and to sign VCs with a NIST approved signature and BBS Signatures
- W3C Working Group has a release candidate spec – vc-di-bbs
- Selective disclosure, unlinkability, holder binding, pseudonyms (issuer and holder defined) (directed identifiers)
- Left off – revocation (!!), blinded secret, claim equality, set membership, range proof, signed integer
- RDF Canonicalization is used – JSON-LD-based, and same as other VC-DI cryprosuites
- BBS Signatures specification is moving through IETF – https://datatracker.ietf.org/doc/draft-irtf-cfrg-bbs-signatures/
- Getting BBS Support into AnonCreds v2
- Reminder of new meeting times
- Second Monday of each month – 7:00 Pacific / 16:00 Central Europe
- Fourth Monday of each month – 15:00 Pacific / 16:00 Mountain / Super Late Central Europe (Midnight...) / 10:00 Auckland
- Open Discussion
- Using an accumulator as a space-efficient way to enable set membership of hashes? For example:
- Up to a million high-entropy hashes
- Only needed query: "is hash XYZ in the set (Y/N)?" – e.g., given hash XYZ and the accumulator, can I answer that question?
- Using an accumulator as a space-efficient way to enable set membership of hashes? For example:
To Dos:
Action items
- Links to be referenced in the spec and used where needed:
...