/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
paragonie.com
|
|
| | | | | How to implement field-level data encryption while still allowing fast queries. | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | This article was written by my colleague, Cathie Yun. Cathie is an applied cryptographer and security engineer, currently working with me to make fully homomorphic encryption a reality at Google. She's also done a lot of cool stuff with zero knowledge proofs. In previous articles, we've discussed techniques used in Fully Homomorphic Encryption (FHE) schemes.... | |
| | | | |
www.daniellowengrub.com
|
|
| | | | | [AI summary] The text discusses the implementation of homomorphic operations in the context of RLWE (Ring Learning With Errors) and GSW (Gentry-Sahai-Waters) encryption schemes. Key concepts include the use of encryptions of zero to facilitate homomorphic multiplication, the structure of GSW ciphertexts as matrices of RLWE ciphertexts, and the role of scaling factors to manage error growth during multiplication. The main goal is to enable secure computation of polynomial products without revealing the underlying plaintexts. | |
| | | | |
www.jeremykun.com
|
|
| | | Last time we covered an operation in the LWE encryption scheme called modulus switching, which allows one to switch from one modulus to another, at the cost of introducing a small amount of extra noise, roughly $\sqrt{n}$, where $n$ is the dimension of the LWE ciphertext. This time we'll cover a more sophisticated operation called key switching, which allows one to switch an LWE ciphertext from being encrypted under one secret key to another, without ever knowing either secret key. | ||
