Thanks for the nice description. Just wondering, if G changes then for each signature, the public key is changed. Is this true? Then for n numbers of signatures, how to store and share n numbers of public keys? and how to verify this is a valid public key, as this is not a fixed one of the signer (like a fixed mailing address)?
3:14 a*(b+c)=“a*b+b*c” should have been a*b+a*c
See that this was fixed on the website.
Thanks for the nice description. Just wondering, if G changes then for each signature, the public key is changed. Is this true? Then for n numbers of signatures, how to store and share n numbers of public keys? and how to verify this is a valid public key, as this is not a fixed one of the signer (like a fixed mailing address)?
I need to use the BLS signature scheme in my project using python3 , how can I implement it ? is there a library for it ?
I know chia has a c++ library with Python bindings.
Hi, how about if its the m -of-n signature?
can you explain how to create a deterministic BLS public key using IETF's Hash to Curve Algorithm in a video
please can you share code
The code is in the link provided: asecuritysite.com/encryption/js_bls and lots of examples here: asecuritysite.com/encryption/#pairing