Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.


Time: 7:00 Pacific / 16:00 Central Europe
Call Link:

Widget Connector


This specification creating group operates under the Linux Foundation Community Specification License v1.0.



  • Survey about the various privacy preserving verifiable credential efforts taking place.
    • Dock response
    • Other responses
      • Digital Bazaar - W3C VC-DI-BBS
      • Academic/Research
        • Internet Initiative Japan Inc.
      • Portage (Canada)
      • Oracle Labs
      • Hyperledger AnonCreds v2
  • VC-DI-BBS Specification and AnonCreds V2 – getting to collaboration?
    • BBS Signatures specification is moving through IETF –
      • 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
  • Getting BBS Support into AnonCreds v2
    • Started, but not complete
  • Audit: 
    • blsful - audit complete and published in Agora
    • Focus: Key Share Proofs
    • Audit complete: Genaro to be contributed
    • Verifiable secret sharing – under audit
  • 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 
      • Except this month – May, because of the US Memorial Day Holiday – replacement meeting May 20, 2024 (this meeting).
  • Open Discussion
    • Using an accumulator or a bloom filter 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 database (accumulator, bloom filter), can I answer that question?
      • XOR filter

To Dos:

Action items