ricksunscreen

13 ms·

1.
by ricksunscreen 4y ago
You get this for free with FHE. In the event of a dispute, you can reveal the randomness and message that produce the public ciphertext given the user's public key.
2.
by ricksunscreen 4y ago
Binary TFHE (the scheme the Google compiler uses) is fairly slow and has very large public keys (like 100MB). However the advantage is that binary computation is very flexible and well understood. Additionally, TFHE supports fast (~10ms) bo
3.
by ricksunscreen 4y ago
We're building an FHE compiler[1] and an accompanying zero-knowlege proof (ZKP) library for proving things about encrypted quantities. As with much of today's cutting-edge crypto, we're targeting Web3 applications, as this is
4.
by ricksunscreen 4y ago
I don't know anything about Cornami's products or where they are in the manufacturing stage. However, I do work in FHE. To give you sense of performance, today you can multiply 2 encrypted 8192-bit values in BFV with typical (not
5.
by ricksunscreen 4y ago
By search, I assume you mean how would you do a database search with FHE referred to in the article. A simple example of private information retrieval is as follows: Suppose Bob has an array of data he arranges into an mxn matrix, A. This d
6.
by ricksunscreen 4y ago
In particular, most FHE schemes inherently add randomness to encryptions as an artifact of using Ring Learning with Errors (RLWE) for hardness. This means that Enc(pk, m) != Enc(pk, m) if you run the algorithm twice; each key and message pa