Hyperledger Foundation Hyperledger Global Forum 2021, 14 Jun 2021

Previous Meeting Next Meeting

⏯

youtube image

►

From YouTube: Project Demo: Ursa - Mike Lodder, Independent

Description

Project Demo: Ursa - Mike Lodder, Independent

To learn more about Hyperledger, the open source community focused on developing a suite of stable frameworks, tools and libraries for enterprise-grade blockchain deployments. Which serves as a neutral home for various distributed ledger frameworks including Hyperledger Fabric, Sawtooth, Indy, as well as tools like Hyperledger Caliper and libraries like Hyperledger Ursa click here: https://www.hyperledger.org/

Session Details & Slides (if available)- https://sched.co/jE3R
Access All Sessions: https://events.linuxfoundation.org/hyperledger-global-forum/program/schedule/

----
Hyperledger – Open Source Blockchain Technologies

Hyperledger is an open source community focused on developing a suite of stable frameworks, tools and libraries for enterprise-grade blockchain deployments.
It serves as a neutral home for various distributed ledger frameworks including Hyperledger Besu, Fabric, Sawtooth, Indy, as well as tools like Hyperledger Avalon, Cactus and libraries like Hyperledger Aries, Ursa. Learn more about Hyperledger projects: https://www.hyperledger.org/use

Case Studies: https://www.hyperledger.org/learn/case-studies
Training & Certification: https://www.hyperledger.org/learn/training
Tutorials: https://www.hyperledger.org/use/tutorials
Webinars: https://www.hyperledger.org/learn/webinars
Events: https://www.hyperledger.org/events
Vendor Directory: https://www.hyperledger.org/use/vendor-directory

Subscribe to the Hyperledger Newsletter: https://www.hyperledger.org/newsletter

Follow-us on Twitter @Hyperledger

Learn about Hyperledger Membership: https://www.hyperledger.org/about/join

#Hyperledger #HyperledgerGlobalForum2021 #Blockchain

A

All righty, I don't know how many people can see my screen, but I wanted to show you some cool stuff going on in hyperledger ursa. So ursa is a cryptographic library. So it's not like. I have a ton to quote unquote demo, so I thought I'd walk you through it and then I did want to show you um it's issuing finding a credential of the cl signature, because that seems to be the number one feature that people love about ursa um right now. Ursa is in the middle of some reorganization.

A

So the old folder, which we call ursa, is in here there's some advanced cryptographic features in what we used to call z mix, that's going to go away, but it has like the bbs plus signature punch level, sanders signature. It's got verifiable encryption and uh delegatable signatures, but we're gonna reorganize, all that and but the main thing most people are interested in is the cl signatures which are found in here and here's all the classes so rather than walk you through.

A

All of that I wanted to just uh demo one thing: let's see here yeah here we go so if you're not familiar with how what a cl signature is cl signatures are a type of multi-message signature, meaning you can sign as many messages as you want with the into the signature and what it allows you to do is selectively disclose any number of those messages.

A

So I can choose to reveal some of them or I can choose to reveal all of them or anything in between the other cool thing about the cl signature is, I can do what's called a range proof, so I don't want to reveal the attribute entirely, but I encoded it as a number, and I want to prove it's over some number like 18 for my age or maybe it's uh the balance on my account when I was issued the credential now to prove it's greater than something without revealing the actual number.

A

So that's what you kind of see with this what's called predicates, so you can go greater than or equal less than or equal greater than or less than, um but most of the time you're not going to uh working directly with those too much, because usually this is wrapped for you in other libraries, but in case you ever did want to here's. Here's an example of multiple predicates, where the issuer creates, what's called a schema. This is what describes what that credential looks like.

A

So in our case, we're saying funds sold and securities purchased and a bunch of other kind of numeric terms right, something you might see on a stock option sheet or a balance sheet and we're going to issue a credential to it and we call it a master seeker but doesn't have to be called that could be called anything.

A

What this is saying is this is going to be tied to an identifier that only the that person knows and it's never disclosed to anyone, but they can prove that all of their credentials are linked to the same identity.

A

So that's what this is for and now that we have our schema, we're right here, we're just plugging in numbers. You can see I just put in raw digits they're, pretty simple and then I go through, and this is just kind of the multi-step phase to get the credential, because right now it depends on the two-phase system, where the approver does something.

A

First then sends that to the issuer saying yes, I accept the credential among other things and then, when he gets it back, the proverb finalizes it because it's what we call a blinded signature such that the issuer can't impersonate uh the prover in that in that way, because he never knew what the signature was in the first place now comes the cool stuff. So now we can create all sorts of these uh proofs see. I want to prove that this is less than or equal to a hundred.

A

Let's include this one and a whole bunch of others, and we can create a proof and then send that on to a verifier now you'll notice. This is all in one function. So when the prover is done here, he would send that on not you wouldn't just have this all-in-one function so.

A

So, by running a cargo test, you can actually see this because this is all in rust. So if you're not familiar with rust, that's okay, we uh are implementing a bunch of rappers and language wrappers like node and c-sharp or java, there's a bunch more in there that are on their way. Okay, so ursa is mostly implemented and wrapped in say lib aries or the aries project in indy. They both use it and uh there's some other hyperledger projects that do and then transact is one of them and I think sawtooth was going to.

A

But I don't, I think their adoption is on hold. There's lots of other things that you can do with ursa such as like, what's called a key exchange, that's what this is for. um You can do other types of signatures in here like 8519 bls, uh the bitcoin ecdsa curve.

A

This is so you can use just a common interface and you don't have to uh reformat or do things uh in your normal code if we happen to change an underlying dependency under the hood that might be more secure and which you might want to use so, but these are the three most common signatures used in blockchains and that's what libersa supports is blockchains.

A

So there's some stuff in here- that's not quite entirely blockchain based but um like there's symmetric crypto, it that's implemented in here. Here's kind of two nist approved signatures, and these two are um like, if you're a lib sodium person, then these are compatible with lipsodium.

A

All right cool thing about ursa is it's been, uh there's been a lot of eyes on this uh cryptography code, so uh it's underway to get audited.

A

But in the meantime, there's been lots of cryptographers and crypto engineers that have looked at this and made sure everything is accurate, and so you shouldn't have to worry about whether it's insecure back doors. If you want to look for back doors, this code's open source, so you can look at it yourself.

A

So um as far as running tests or anything else, this is rust, so anything that you can do from the command line will work. These are just running everything. Ffi stands for foreign function interface, so if you're going to wrap it and go to c, this is what you would use. um This is demoing what it looks like for, revocation or just a plain demo.

A

I will walk you through that code here now. So what that is doing with cl signatures is one one of the things is. If you want to do, um if you want to issue a verifiable credential, it's pretty important to be able to revoke a credential, let's say: there's just bad data in it or in the case, think of a driver's license, they've committed too many dui.

A

So now I want to make sure the credential is completely and utterly useless, but in the visual world that's a little hard because there's not a centralized database, necessarily that everybody checks and you may want to prevent correlation. So what I'm doing is I'm searching for the test.

A

So just give me a second while I find it, I think it's called demo yeah here we go so here's an example of a credential that just has kind of some basic attributes about someone that are going to get signed in there, but it also keeps track of what's called a revocation id now in zero knowledge.

A

We check that this credential has not been revoked in such a way that whoever is verifying it doesn't see um the exact id that was checked it just knows, is it in the set or not so think of it as a set membership check? Where you don't know which element out of say, 10 million was checked, but you do know whether the element was in one of those 10 million. So if it had been revoked, um it wouldn't be in the set that proof would fail.

A

So in that sense um we have a whole bunch of kind of proofs going on here and so how how this all works is remember. The cl signatures, we're selectively, disclosing some attributes to a verifier, we're, never revealing the exact signature. We're we're presenting, what's called a zero knowledge proof of a signature and we're presenting a zero knowledge, proof that it's in its uh revocation id is in a set that hasn't been revoked and some other numbers like age and height are greater than some thing.

A

So there's quite a bit of zero knowledge proofs going on here. So ursa has a lot of zero knowledge proof stuff, that's probably the one thing it has to offer over any other library.

A

This is, is what's actually replacing uh cl signatures called bbs, plus if you've uh been involved in this community for a while.

A

This is where the code has been written and maintained is in here, and it works very similar to cl signatures, except that it's much smaller and it's faster than cl signatures, so pretty cool here's the source code. If you want to use it, if you don't care, you can go to one of the other wrappers that say matter global has done, but then I wanted to leave the last five minutes for questions.

A

Are there any questions.

A

Them or chatted.

A

Let's see still load, can you go through how all the zkp's are aggregated into a single proof? Yes, because that, um let's start with uh the cl signature, because that's what most people care about.

A

So the cl signature um we have what's called an aggregated proof, and this is what's called a schnore proof, and so there's a bunch of other proofs say you know: you've got your zero knowledge proof of a signature. Your revocation check all your range proofs, your selectively disclosed attributes, there's a whole bunch of all those proofs.

A

So each one of those is a proof and then, when you say aggregated into a single proof, there is one what we call a schnoor proof that kind of combines them all together, and that is what you check in addition to the individual ones, because individual ones like you might have some pass and some fail, but then there's an overall proof that will fail if any one of those has been modified or tampered to make sure it stays accurate.

A

Which language wrapper do you plan to implement in the near future?

A

um It depends on demand, so the highest demand ones are node, uh a c wrapper which can then go to c sharp or java dot net, so those are probably the most the ones we want.

A

I'm not sharing my screen any yeah, not anymore.

A

A

A

Why do we check because the overall proof could still succeed, even if one of the other little individual proofs fails? So let me give you an example. I could do a range proof which the proof itself has not been tampered with, but um the the value I'm checking it against. Let's say I'm greater than 18.

A

if that might fail, but the overall proof still succeeds so meaning the the signature was still valid. Everything else about was valid, I'm just not over 18, for example, in that case, ending in one minute.

A

uh Dan sale, signature nurse surplus equals original cl, plus range proof, sale, signature support range proofs. So, as far as we know, we are the only cl signature, um that's open source. There is one in idmix, but it's not open source all right with that. That's the end of the session. Any other questions feel free to contact me outside this on rocket chat.

A