Sergey Gorbunov Profile picture
building @axelarcore. crypto(graphy), algorithms, dist systems. prof @uwaterloo, host @rwcpodcast1, @MIT PhD. pr: @algorand, @IBM.
27 Oct
Prediction: Users and developers will care even more about decentralized systems, but not for the reasons you think. Here’s the gist:
Blockchains are inherently open systems. Anyone can deploy an app, become a user, or build on other people’s work.
In contrast, traditional web apps are all about collecting data. Facebook, Google, and Amazon are examples of data companies that created massive proprietary databases and fed off users’ data to profit.
Read 8 tweets
12 Oct
Almost "everything" you need to know about fully homomorphic encryption and how it can solve (at least some) of our data privacy problems.
The problem was first introduced by Rivest, Adleman, and Dertouzos all the way back in 1978. luca-giuzzi.unibs.it/corsi/Support/…
On a high level, an encryption scheme is homomorphic if one can perform field operations over the encrypted messages, E(a) and E(b), that result in simple base operations over the underlying encrypted values.
Read 23 tweets
6 Oct
Have you ever wondered why Threshold ECDSA is painful, Threshold Schnorr is straightforward, and Threshold BLS is trivial? Here's an informal explanation:
Everything comes down to the complexity of the signing equation for each scheme.

All secrets in all schemes are typically distributed across users using Shamir's secret sharing techniques. en.wikipedia.org/wiki/Shamir%27…
Threshold ECDSA sign equation involves multiplication of two secrets (k^{-1} and x, where x is the secret).
s = k^{-1} * (Hash(v) + r * x)

This is not straightforward!
Read 10 tweets