Opens profile photo
Follow
Evervault
@evervault
Encrypting the web.
Dublin, Irelandevervault.comJoined April 2018

Evervault’s Tweets

"As a decentralized identity service, privacy is at our core. We need to ensure that our users’ plaintext data is never exposed, including to us. Evervault enables us to do this simply and quickly." —
Image
17
17/18) This scheme works for strings too! As strings are stored as binary, we can convert the binary representation of the string to decimal and use that representation as our secret.
1
6
Show this thread
16/18) We can still interpolate to find our secret when we have the threshold number of shares. But now, having less than the threshold does not give us more information about the secret than if we had no shares.
Embedded video
0:12
14 views
1
4
Show this thread
15/18) The larger the prime chosen, the lower the probability of finding the secret. In this case, we'll select a relatively small one, 1613, as it works well with our visualisation. Notice how unrelated the shares (points) look now:
Embedded video
0:05
19 views
1
7
Show this thread
13/18) Applying a modulus makes a function cyclic, as it can only ever reach the number of the modulus, and then it will go back to zero again. Here’s what our function looks like when we apply a modulus of 1613.
Embedded video
0:09
11 views
1
5
Show this thread
12/18) However, we can make a simple change to our polynomial to eliminate the above exploit: we turn it into a cyclic polynomial by applying a modulus. Another for the rusty: a modulus is basically just getting the remainder, e.g.
Embedded video
0:04
9 views
1
6
Show this thread
11/18) In an effective secret sharing protocol, having less than the threshold number of shares should not give you any information about the secret. Therefore, using regular polynomials will not fit the bill.
1
6
Show this thread
10/18) In the example below, two points are stolen, and the attacker can try each possible polynomial (149 in this case) until they find the secret.
Embedded video
0:13
12 views
1
6
Show this thread
9/18) However, using regular polynomials has a security flaw. If you have some points but haven't enough to satisfy the threshold, you can use algebra to reduce the number of possible polynomials. This makes it easier to perform a brute-force attack to find the secret.
1
6
Show this thread
8/18) If we have 3 of these shares, we can interpolate them to find the polynomial and thus find our secret. Interpolation is essentially just finding the curve that passes through our points.
Embedded video
0:06
10 views
1
6
Show this thread
7/18) To get our shares, we need to find points on the polynomial. Although our threshold is 3, we can create any number of shares. You can share with as many people as you like, but someone needs 3 to reveal our secret. Let's, for example, create 6 shares by picking 6 points.
Embedded video
0:03
10 views
1
6
Show this thread
6/18) We need to pick two random numbers to be our coefficients. Let’s choose 94 and 166, which gives us the polynomial: 94x^2 + 166x + 1234. Here's what it looks like:
Embedded video
0:05
11 views
1
6
Show this thread
5/18) As a demonstration, let's share the secret 1234. We’ll set the threshold as 3, i.e. you need at least three of the shares to find out the secret. Thus, we require the polynomial to be of degree 2.
1
8
Show this thread
4/18) This means you can share points, but someone can only find the polynomial if they have enough points. You need N+1 points to uncover a polynomial of degree N. These points are the 'shares' of our secret.
1
8
Show this thread
3/18) For the rusty among us, this first video clip depicts a polynomial. It is a degree 3 polynomial, as the largest power of x is 3. Polynomials work for secret sharing because you can give people some of the points on the curve without revealing to them what the polynomial is.
Embedded video
0:04
28 views
1
8
Show this thread
2/18) Cryptography schemes are often difficult to understand, but they are intuitive when explained in a suitable medium. In 1979, famed cryptographer Adi Shamir proposed a new method for sharing secrets.
1
7
Show this thread
Our mission is to encrypt the web. The only way to do this is to make encryption easy to integrate and hard to get wrong. That's why you can encrypt your first string with Evervault in less than five minutes. In this video, shows you how.
2
23
Show this thread
And because we store your encryption keys, you don’t have to worry about key management on your infrastructure or implementing complicated encryption schemes.
1
6
Show this thread
Even if you do manage to implement encryption yourself, you can’t always trust yourself or your developers. Proper key management is particularly difficult to implement and can quickly become a nightmare if done incorrectly.
1
5
Show this thread
To implement encryption properly yourself, you need an experienced security engineer with knowledge of today’s state-of-the-art encryption schemes, working tirelessly to keep up with the latest trends and advisories from the broader security community.
1
6
Show this thread