Explore >> Select a destination
|
You are here 
|
malb.io | ||
| | | | |
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. | |
| | | | |
martinralbrecht.wordpress.com
|
|
| | | | | Our paper (with Kamil Doruk Gur) "Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable" is now available on ePrint and will appear at Asiacrypt 2024. Doruk and I started working on this together when he did his residency at SandboxAQ. Here's the abstract: We revisit the lattice-based verifiable oblivious PRF construction from PKC'21 and... | |
| | | | |
thenumb.at
|
|
| | | | | ||
| | | | |
www.baturin.org
|
|
| | | |||
