Portrait of Kim Laine

Kim Laine



I am a researcher in the Cryptography Research group at MSR Redmond. In 2015 I graduated from UC Berkeley with Ph.D. in mathematics.

My current research interests fall under the umbrella of computing on encrypted data. In particular, I am interested in practical applications of homomorphic encryption and secure multi-party computation (MPC) to machine learning, genomics, and medical data privacy.

I am currently the main developer and administrator of the Simple Encrypted Arithmetic Library – SEAL.


Simple Encrypted Arithmetic Library – SEAL

Simple Encrypted Arithmetic Library - SEAL is an easy-to-use homomorphic encryption library, developed by researchers in the Cryptography Research Group at Microsoft Research. SEAL is written in C++11, and contains .NET wrappers for the public API. It has no external dependencies. SEAL uses the Microsoft Research License Agreement, and is free for research use.

Homomorphic Encryption

Established: March 27, 2016

Homomorphic Encryption Homomorphic Encryption (HE) refers to a special type of encryption technique that allows for computations to be done on encrypted data, without requiring access to a secret (decryption) key. The results of the computations remain encrypted, and can be revealed only by the owner of the secret key.   Motivation While traditional encryption schemes can be used to privately outsource data storage to the cloud, the data cannot be used for computations without…

Secure Multi-Party Computation

Established: June 10, 2011

It is often the case that mutually distrustful parties need to perform a joint computation but cannot afford to reveal their inputs to each other. This can occur, for example, during auctions, data mining, voting, negotiations and business analytics. Secure multi-party computation (MPC) allows a set of parties, each with a private input, to securely and jointly perform any computation over their inputs.






Simple Encrypted Arithmetic Library – SEAL

November 2015


•Key Recovery for LWE in Polynomial Time (slides). Joint Mathematics Meetings, Special Session on Number Theory and Cryptography, Seattle, WA, January 2016.
•Time-Memory Trade-offs for Index Calculus in Genus 3 (slides). ECC 2015, Bordeaux, France, September 2015.
•Key Recovery for LWE in Polynomial Time. Center for Communications Research, La Jolla, CA, May 2015.
•Learning With Errors in Homomorphic Cryptography (slides). UC Berkeley (Number Theory Seminar), January 2015.
•Key recovery for LWE in polynomial time (slides). DIMACS Workshop on The Mathematics of Post-Quantum Cryptography, Rutgers University, January 2015.
•Attacks and defenses in genus 3 (slides). Center for Communications Research, La Jolla, CA, December 2014.
•Security in genus 3 (slides). UC San Diego (Number Theory Seminar), November 2014.
•Security of genus 3 curves in cryptograph. UC Berkeley (Number Theory Seminar), April 2014.