Cybersecurity Magic! (t,n) Threshold Signatures with BLS
Over the past year or so, I’ve been working on BLS (Bonheh-Lynn-Sacham) cryptography. The core advantage of BLS is that it is aggregatable, including for secret keys, public keys and signatures. For this we could take three symmetric keys and then aggregate them together, and still end up with a valid key. We can do the same with signatures, and where we might have 10 signers of a Bitcoin transaction, but where we can merge all of their signatures into a single signature, and where we could also merge their public keys together into a single public key for all the signers. With signatures, we can take a number of signatures and merge them together, and then end up with a unique signature. It is basically cybersecurity magic!
If you want to find out about the maths behind BLS, try here:
And here is how we can use it to verify votes in an election:
