Explore >> Select a destination
|
You are here 
|
awwalker.com | ||
| | | | |
www.vanimpe.eu
|
|
| | | | | Cryptography Introduction Cheatsheet, Private Communications in a Public World | |
| | | | |
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. | |
| | | | |
blog.openmined.org
|
|
| | | | | From the math and the hard problem behind most of today's homomorphic encryption scheme to implementing your own in python. | |
| | | | |
www.jeremykun.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. The basis for many FHE schemes, as well as other privacy-preserving protocols, is the Learning With Errors (LWE) problem. | ||
