• Publications
  • Influence
CryptoNets: applying neural networks to encrypted data with high throughput and accuracy
TLDR
It is shown that the cloud service is capable of applying the neural network to the encrypted data to make encrypted predictions, and also return them in encrypted form, which allows high throughput, accurate, and private predictions.
Can homomorphic encryption be practical?
TLDR
A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.
Pairing-Friendly Elliptic Curves of Prime Order
TLDR
This paper describes a method to construct elliptic curves of prime order and embedding degree k = 12 and shows that the ability to handle log(D)/log(r) ~ (q–3)/(q–1) enables building curves with ρ ~ q/(q-1).
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
TLDR
Despite conventional wisdom that generic lattices might be too slow and unwieldy, it is demonstrated that LWE-based key exchange is quite practical: the authors' constant time implementation requires around 1.3ms computation time for each party; compared to the recent NewHope R-LWE scheme, communication sizes increase by a factor of 4.7x, but remain under 12 KiB in each direction.
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem
TLDR
This work demonstrates the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, and accompanies these cipher suites with a rigorous proof of security.
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
TLDR
This paper constructs a new fully homomorphic encryption scheme from the Stehle and Steinfeld version based on standard lattice assumptions and a circular security assumption, which is scale-invariant and therefore avoids modulus switching and the size of ciphertexts is one ring element.
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
We propose a new suite of algorithms that significantly improve the performance of supersingular isogeny Diffie-Hellman SIDH key exchange. Subsequently, we present a full-fledged implementation of
A Comparison of the Homomorphic Encryption Schemes FV and YASHE
We conduct a theoretical and practical comparison of two Ring-LWE-based, scale-invariant, leveled homomorphic encryption schemes – Fan and Vercauteren’s adaptation of BGV and the YASHE scheme
ML Confidential: Machine Learning on Encrypted Data
TLDR
A new class of machine learning algorithms in which the algorithm's predictions can be expressed as polynomials of bounded degree, and confidential algorithms for binary classification based on polynomial approximations to least-squares solutions obtained by a small number of gradient descent steps are proposed.
Privately Evaluating Decision Trees and Random Forests
TLDR
Two protocols for privately evaluating decision trees and random forests are developed and an extension of the semi-honest protocol is given that is robust against malicious adversaries and demonstrates a tenfold improvement in computation and bandwidth.
...
...