Kristin E. Lauter

Affiliations:
  • Microsoft Research, Redmond


According to our database1, Kristin E. Lauter authored at least 98 papers between 1996 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Editor's Preface for the Second Annual MathCrypt Proceedings Volume.
J. Math. Cryptol., 2021

Private AI: Machine Learning on Encrypted Data.
IACR Cryptol. ePrint Arch., 2021

A Cryptographic Hash Function from Markoff Triples.
IACR Cryptol. ePrint Arch., 2021

Explicit connections between supersingular isogeny graphs and Bruhat - Tits trees.
IACR Cryptol. ePrint Arch., 2021

HEAR: Human Action Recognition via Neural Networks on Homomorphically Encrypted Data.
CoRR, 2021

2020
Preface to the First Annual MathCrypt Proceedings Volume.
J. Math. Cryptol., 2020

On the Concrete Security of LWE with Small Secret.
IACR Cryptol. ePrint Arch., 2020

Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: An Extended Survey.
IACR Cryptol. ePrint Arch., 2020

Transparency Tools for Fairness in AI (Luskin).
CoRR, 2020

2019
XONN: XNOR-based Oblivious Deep Neural Network Inference.
IACR Cryptol. ePrint Arch., 2019

Adventures in Supersingularland.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.
IACR Cryptol. ePrint Arch., 2019

Toward Scalable Fully Homomorphic Encryption Through Light Trusted Computing Assistance.
CoRR, 2019

CHET: an optimizing compiler for fully-homomorphic neural-network inferencing.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
ReDCrypt: Real-Time Privacy-Preserving Deep Learning Inference in Clouds Using FPGAs.
ACM Trans. Reconfigurable Technol. Syst., 2018

Postquantum Cryptography, Part 2.
IEEE Secur. Priv., 2018

Secure Outsourced Matrix Computation and Application to Neural Networks.
IACR Cryptol. ePrint Arch., 2018

Supersingular isogeny graphs and endomorphism rings: reductions and solutions.
IACR Cryptol. ePrint Arch., 2018

Ramanujan graphs in cryptography.
IACR Cryptol. ePrint Arch., 2018

Logistic regression over encrypted data from fully homomorphic encryption.
IACR Cryptol. ePrint Arch., 2018

Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves.
IACR Cryptol. ePrint Arch., 2018

CHET: Compiler and Runtime for Homomorphic Evaluation of Tensor Programs.
CoRR, 2018

2017
Attacks on the Search RLWE Problem with Small Errors.
SIAM J. Appl. Algebra Geom., 2017

Manual for Using Homomorphic Encryption for Bioinformatics.
Proc. IEEE, 2017

Postquantum Opportunities: Lattices, Homomorphic Encryption, and Supersingular Isogeny Graphs.
IEEE Secur. Priv., 2017

Postquantum Cryptography - State of the Art.
IEEE Secur. Priv., 2017

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2017

Hard and Easy Problems for Supersingular Isogeny Graphs.
IACR Cryptol. ePrint Arch., 2017

Cryptographic Pairings.
IACR Cryptol. ePrint Arch., 2017

Private Collaborative Neural Network Learning.
IACR Cryptol. ePrint Arch., 2017

Private Queries on Encrypted Genomic Data.
IACR Cryptol. ePrint Arch., 2017

PRINCESS: Privacy-protecting Rare disease International Network Collaboration via Encryption through Software guard extensionS.
Bioinform., 2017

2016
Privately Evaluating Decision Trees and Random Forests.
Proc. Priv. Enhancing Technol., 2016

Fast Cryptography in Genus 2.
J. Cryptol., 2016

Secure Data Exchange: A Marketplace in the Cloud.
IACR Cryptol. ePrint Arch., 2016

Vulnerable Galois RLWE Families and Improved Attacks.
IACR Cryptol. ePrint Arch., 2016

Constructing genus 3 hyperelliptic Jacobians with CM.
IACR Cryptol. ePrint Arch., 2016

Modern Cryptography and Security: An Inter-Community Dialogue (Dagstuhl Seminar 16051).
Dagstuhl Reports, 2016

Variations of the McEliece Cryptosystem.
CoRR, 2016

HEALER: homomorphic computation of ExAct Logistic rEgRession for secure rare disease variants analysis in GWAS.
Bioinform., 2016

Security Considerations for Galois Non-dual RLWE Families.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Private Computation on Encrypted Genomic Data.
IACR Cryptol. ePrint Arch., 2015

Key Recovery for LWE in Polynomial Time.
IACR Cryptol. ePrint Arch., 2015

Private Genome Analysis through Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2015

Ring-LWE Cryptography for the Number Theorist.
IACR Cryptol. ePrint Arch., 2015

Provably weak instances of Ring-LWE.
IACR Cryptol. ePrint Arch., 2015

Homomorphic Computation of Edit Distance.
IACR Cryptol. ePrint Arch., 2015

Attacks on Search RLWE.
IACR Cryptol. ePrint Arch., 2015

2014
Evaluating Igusa functions.
Math. Comput., 2014

Time-Memory Trade-offs for Index Calculus in Genus 3.
IACR Cryptol. ePrint Arch., 2014

On the quaternion ℓ-isogeny path problem.
IACR Cryptol. ePrint Arch., 2014

Weak Instances of PLWE.
IACR Cryptol. ePrint Arch., 2014

Constructing Abelian Surfaces for Cryptography via Rosenhain Invariants.
IACR Cryptol. ePrint Arch., 2014

Private Predictive Analysis on Encrypted Medical Data.
IACR Cryptol. ePrint Arch., 2014

Crypto-Nets: Neural Networks over Encrypted Data.
CoRR, 2014

2013
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme.
IACR Cryptol. ePrint Arch., 2013

High-Performance Scalar Multiplication using 8-Dimensional GLV/GLS Decomposition.
IACR Cryptol. ePrint Arch., 2013

Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields.
Des. Codes Cryptogr., 2013

2012
Modular polynomials via isogeny volcanoes.
Math. Comput., 2012

An arithmetic intersection formula for denominators of Igusa class polynomials.
IACR Cryptol. ePrint Arch., 2012

Improved CRT Algorithm for Class Polynomials in Genus 2.
IACR Cryptol. ePrint Arch., 2012

ML Confidential: Machine Learning on Encrypted Data.
IACR Cryptol. ePrint Arch., 2012

Two is Greater than One.
IACR Cryptol. ePrint Arch., 2012

Practical applications of homomorphic encryption.
Proceedings of the 2012 ACM Workshop on Cloud computing security, 2012

2011
Can Homomorphic Encryption be Practical?
IACR Cryptol. ePrint Arch., 2011

A Gross-Zagier formula for quaternion algebras over totally real fields.
IACR Cryptol. ePrint Arch., 2011

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings.
IACR Cryptol. ePrint Arch., 2011

Group Law Computations on Jacobians of Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2011

An Anonymous Health Care System.
IACR Cryptol. ePrint Arch., 2011

Affine Pairings on ARM.
IACR Cryptol. ePrint Arch., 2011

Igusa Class Polynomials, Embedding of Quartic CM Fields, and Arithmetic Intersection Theory.
Proceedings of the WIN - Women in Numbers - Research Directions in Number Theory., 2011

2010
Computing genus 2 curves from invariants on the Hilbert moduli space.
IACR Cryptol. ePrint Arch., 2010

An Analysis of Affine Coordinates for Pairing Computation.
IACR Cryptol. ePrint Arch., 2010

Genus 2 Curves with Complex Multiplication.
IACR Cryptol. ePrint Arch., 2010

Cryptographic Cloud Storage.
Proceedings of the Financial Cryptography and Data Security, 2010

2009
Cryptographic Hash Functions from Expander Graphs.
J. Cryptol., 2009

Signatures for network coding.
Int. J. Inf. Coding Theory, 2009

Patient controlled encryption: ensuring privacy of electronic medical records.
Proceedings of the first ACM Cloud Computing Security Workshop, 2009

2008
Elliptic Curve Cryptography (ECC) Support for Public Key Cryptography for Initial Authentication in Kerberos (PKINIT).
RFC, September, 2008

Full Cryptanalysis of LPS and Morgenstern Hash Function.
IACR Cryptol. ePrint Arch., 2008

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences.
IACR Cryptol. ePrint Arch., 2008

Modular polynomials for genus 2.
IACR Cryptol. ePrint Arch., 2008

Computing Hilbert Class Polynomials.
IACR Cryptol. ePrint Arch., 2008

Full Cryptanalysis of LPS and Morgenstern Hash Functions.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.
Proceedings of the Pairing-Based Cryptography, 2008

Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography.
Proceedings of the Pairing-Based Cryptography, 2008

2007
Computing endomorphism rings of Jacobians of genus 2 curves over finite fields.
IACR Cryptol. ePrint Arch., 2007

2006
Stronger Security of Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2006

Trading Inversions for Multiplications in Elliptic Curve Cryptography.
Des. Codes Cryptogr., 2006

2005
Security Analysis of KEA Authenticated Key Exchange Protocol.
IACR Cryptol. ePrint Arch., 2005

2004
The advantages of elliptic curve cryptography for wireless security.
IEEE Wirel. Commun., 2004

Computing Modular Polynomials.
IACR Cryptol. ePrint Arch., 2004

2003
Improved Weil and Tate pairings for elliptic and hyperelliptic curves.
IACR Cryptol. ePrint Arch., 2003

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.
Proceedings of the Topics in Cryptology, 2003

2002
An Efficient Procedure to Double and Add Points on an Elliptic Curve.
IACR Cryptol. ePrint Arch., 2002

2001
Constructing elliptic curves with a given number of points over a finite field.
IACR Cryptol. ePrint Arch., 2001

1996
Ray Class Field Constructions of Curves over Finite Fields with Many Rational Points.
Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996


  Loading...