...
Excerpt |
---|
|
Recording of Call: 20230320 AnonCreds V2.0 Working Group Community Meeting.mp4
Segment – Awesome Presentation by Mike Lodder: 20230320 AnonCreds V2.0 Working Group Community Meeting - Presentation Data Models.mp4
Notices:
This specification creating group operates under the Linux Foundation Community Specification License v1.0.
...
- Mike Lodder will continue a discussion of the Data Models he is proposing for AnonCreds v2.0, this time talking about Presentations
- Data Models HackMD document: https://hackmd.io/ZlsnLoclSveePJOZljgMfA
- Notes from Meeting:
- Contents of the Issued Credential – easily mapped into other formats, such as the W3C VC Data Model.
- Open question on where encoding occurs – within AnonCreds (better interoperability, less data to store, more computation) or by the Issuer.
- PresentationSchema
- A possibly published data structure used by the Verifier to ask for data from the Holder.
- Atomic – when requested, a Proof based on a PresentationSchema is either proven or not.
- Can use something like DIF Presentation exchange to AND/OR a set of PresentationSchemas in to a Presentation Request – plus adding an ID and a nonce.
- Different types of proofs were covered – from plain signatures to range-proofs.
- Different crypto can be used.
- From Chat:
- Is bulletproof more efficient than schnorr proofs?
- Different purposes – Schnorr: Prove you know the hidden value, Bullet: Proof hidden value is in range.
- Discussion of revocation scalability – details to be covered in a future meeting.
- Is bulletproof more efficient than schnorr proofs?
- Contents of the Issued Credential – easily mapped into other formats, such as the W3C VC Data Model.
- Plans for IIW?
- Next Meeting (two weeks):
- Suspension vs./as well as revocation?
- Collect some use case specific examples and continue the discussions:
- Applying the data structures to a real use case or two
- What concrete uses other than link-secret is there for blinded data in a credential?
- ALLOSAUR Revocation
...