Kristin E. Lauter

Yongsoo Song

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Attacks on the Search RLWE Problem with Small Errors.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2017

Manual for Using Homomorphic Encryption for Bioinformatics.

[BibT_eX]

[DOI]

Proc. IEEE, 2017

Postquantum Opportunities: Lattices, Homomorphic Encryption, and Supersingular Isogeny Graphs.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2017

Postquantum Cryptography - State of the Art.

[BibT_eX]

[DOI]

Johannes Buchmann

Michele Mosca

IEEE Secur. Priv., 2017

Hard and Easy Problems for Supersingular Isogeny Graphs.

[BibT_eX]

[DOI]

Christophe Petit

IACR Cryptol. ePrint Arch., 2017

Cryptographic Pairings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Private Collaborative Neural Network Learning.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Private Queries on Encrypted Genomic Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

Süleyman Cenk Sahinalp

Bioinform., 2017

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Constructing genus-3 hyperelliptic Jacobians with CM.

[BibT_eX]

[DOI]

Jennifer S. Balakrishnan

Sorina Ionica

Christelle Vincent

LMS J. Comput. Math., 2016

Vulnerable Galois RLWE Families and Improved Attacks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

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

[BibT_eX]

[DOI]

Radu Sion

Nigel P. Smart

Dagstuhl Reports, 2016

Variations of the McEliece Cryptosystem.

[BibT_eX]

[DOI]

Jessalyn Bolkema

Heide Gluesing-Luerssen

CoRR, 2016

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

[BibT_eX]

[DOI]

Bioinform., 2016

Security Considerations for Galois Non-dual RLWE Families.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Private genome analysis through homomorphic encryption.

[BibT_eX]

[DOI]

Miran Kim

BMC Medical Informatics Decis. Mak., December, 2015

Genus-2 curves and Jacobians with a given number of points.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2015

Privately Evaluating Decision Trees and Random Forests.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Key Recovery for LWE in Polynomial Time.

[BibT_eX]

[DOI]

Kim Laine

IACR Cryptol. ePrint Arch., 2015

Ring-LWE Cryptography for the Number Theorist.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Attacks on Search RLWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Homomorphic Computation of Edit Distance.

[BibT_eX]

[DOI]

Jung Hee Cheon

Miran Kim

Proceedings of the Financial Cryptography and Data Security, 2015

Provably Weak Instances of Ring-LWE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Evaluating Igusa functions.

[BibT_eX]

[DOI]

Math. Comput., 2014

On the quaternion -isogeny path problem.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2014

Constructing abelian surfaces for cryptography via Rosenhain invariants.

[BibT_eX]

[DOI]

Craig Costello

Alyson Deines-Schartz

Tonghai Yang

LMS J. Comput. Math., 2014

Private predictive analysis on encrypted medical data.

[BibT_eX]

[DOI]

Joppe W. Bos

J. Biomed. Informatics, 2014

Time-Memory Trade-offs for Index Calculus in Genus 3.

[BibT_eX]

[DOI]

Kim Laine

IACR Cryptol. ePrint Arch., 2014

On the quaternion ℓ-isogeny path problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Crypto-Nets: Neural Networks over Encrypted Data.

[BibT_eX]

[DOI]

CoRR, 2014

Weak Instances of PLWE.

[BibT_eX]

[DOI]

Sean Hallgren

Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

Private Computation on Encrypted Genomic Data.

[BibT_eX]

[DOI]

Adriana López-Alt

Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Fast Cryptography in Genus 2.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

High-Performance Scalar Multiplication Using 8-Dimensional GLV/GLS Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2013, 2013

2012

Modular polynomials via isogeny volcanoes.

[BibT_eX]

[DOI]

Andrew V. Sutherland

Math. Comput., 2012

An arithmetic intersection formula for denominators of Igusa class polynomials.

[BibT_eX]

[DOI]

Bianca Viray

IACR Cryptol. ePrint Arch., 2012

Improved CRT Algorithm for Class Polynomials in Genus 2.

[BibT_eX]

[DOI]

Damien Robert

IACR Cryptol. ePrint Arch., 2012

Two is Greater than One.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Affine Pairings on ARM.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012

ML Confidential: Machine Learning on Encrypted Data.

[BibT_eX]

[DOI]

Thore Graepel

Proceedings of the Information Security and Cryptology - ICISC 2012, 2012

Practical applications of homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the 2012 ACM Workshop on Cloud computing security, 2012

2011

A Gross-Zagier formula for quaternion algebras over totally real fields.

[BibT_eX]

[DOI]

Eyal Z. Goren

IACR Cryptol. ePrint Arch., 2011

Group Law Computations on Jacobians of Hyperelliptic Curves.

[BibT_eX]

[DOI]

Craig Costello

Proceedings of the Selected Areas in Cryptography - 18th International Workshop, 2011

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings.

[BibT_eX]

[DOI]

Craig Costello

Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

Can homomorphic encryption be practical?

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

Igusa Class Polynomials, Embedding of Quartic CM Fields, and Arithmetic Intersection Theory.

[BibT_eX]

Helen G. Grundman

Jennifer Johnson-Leung

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.

[BibT_eX]

[DOI]

Tonghai Yang

IACR Cryptol. ePrint Arch., 2010

Generating Pairing-friendly Parameters for the CM Construction of Genus 2 Curves over Prime Fields.

[BibT_eX]

[DOI]

Ning Shang

IACR Cryptol. ePrint Arch., 2010

Genus 2 Curves with Complex Multiplication.

[BibT_eX]

[DOI]

Eyal Z. Goren

IACR Cryptol. ePrint Arch., 2010

An Anonymous Health Care System.

[BibT_eX]

[DOI]

Melissa Chase

Proceedings of the 1st USENIX Workshop on Health Security and Privacy, 2010

An Analysis of Affine Coordinates for Pairing Computation.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Cryptographic Cloud Storage.

[BibT_eX]

[DOI]

Seny Kamara

Proceedings of the Financial Cryptography and Data Security, 2010

2009

Modular Polynomials for Genus 2.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2009

Patient controlled encryption: ensuring privacy of electronic medical records.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Larry Zhu

Karthik Jaganathan

RFC, September, 2008

Full Cryptanalysis of LPS and Morgenstern Hash Function.

[BibT_eX]

[DOI]

Christophe Petit

Jean-Jacques Quisquater

IACR Cryptol. ePrint Arch., 2008

Full Cryptanalysis of LPS and Morgenstern Hash Functions.

[BibT_eX]

[DOI]

Christophe Petit

Jean-Jacques Quisquater

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.

[BibT_eX]

[DOI]

Dimitar Jetchev

Proceedings of the Pairing-Based Cryptography, 2008

Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography, 2008

Computing Hilbert Class Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

Computing endomorphism rings of Jacobians of genus 2 curves over finite fields.

[BibT_eX]

[DOI]

David Freeman

IACR Cryptol. ePrint Arch., 2007

Stronger Security of Authenticated Key Exchange.

[BibT_eX]

[DOI]

Brian A. LaMacchia

Anton Mityagin

Proceedings of the Provable Security, 2007

2006

Cryptographic hash functions from expander graphs.

[BibT_eX]

[DOI]

Eyal Z. Goren

IACR Cryptol. ePrint Arch., 2006

Security Analysis of KEA Authenticated Key Exchange Protocol.

[BibT_eX]

[DOI]

Anton Mityagin

Proceedings of the Public Key Cryptography, 2006

Signatures for Network Coding.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005

Computing Modular Polynomials.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2005

2004

The advantages of elliptic curve cryptography for wireless security.

[BibT_eX]

[DOI]

IEEE Wirel. Commun., 2004

Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Trading Inversions for Multiplications in Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2003

2002

An Efficient Procedure to Double and Add Points on an Elliptic Curve.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

2001

Constructing elliptic curves with a given number of points over a finite field.

[BibT_eX]

[DOI]

Amod Agashe

Ramarathnam Venkatesan

IACR Cryptol. ePrint Arch., 2001

1996

Ray Class Field Constructions of Curves over Finite Fields with Many Rational Points.

[BibT_eX]

[DOI]