Books:
WINWomen in Numbers: Research Directions in Number Theory, Fields Institute Communications Series, Volume 60 (2011). Coedited with AlinaCarmen Cojocaru, Rachel Pries, Renate Scheidler.
Computational Arithmetic Geometry. AMS Contemporary Mathematics Series, volume 463 (2008). Coedited with Ken Ribet.
Topics in Algebraic and Noncommutative Geometry, Proceedings of the Conferences in memory of Ruth Michler. AMS Contemporary Mathematics Series, volume 324 (2003) . Coedited with Caroline Grant Melles, JeanPaul Brasselet, Gary Kennedy, Lee McEwan.
Articles by area:
Cryptography
 ML Confidential: Machine Learning on Encrypted Data Thore Graepel, Kristin Lauter, Michael Naehrig 2012/323 ( PDF )
 Can Homomorphic Encryption Be Practical? with Michael Naehrig, Vinod Vaikuntanathan, in CCSW 2011, ACM Cloud Computing Security Workshop 2011.

An Anonymous Health Care System, by Melissa Chase and Kristin Lauter, in HealthSec, 1st USENIX Workshop on Health Security and Privacy, 2010. 2011/016 (PDF)
 Cryptographic Cloud Storage, with Seny Kamara, in Proceedings of Financial Cryptography FC 2010: Workshop on RealLife Cryptographic Protocols and Standardization.
 Patient Controlled Encryption: patient privacy in electronic medical records, with Josh Benaloh, Melissa Chase, Eric Horvitz, in CCSW'09 ACM Cloud Computing Security Workshop.
 Full Cryptanalysis of LPS and Morgenstern Hash Function, by Christophe Petit, Kristin Lauter, JeanJacques Quisquater, in Security and Cryptography of Networks 2008
 The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences by Kristin E. Lauter and Katherine E. Stange, in Selected Areas in Cryptography 2008
 Stronger Security of Authenticated Key Exchange, by Brian LaMacchia, Kristin Lauter, Anton Mityagin, in ProvSec2007, submitted version, published version.
 Signatures for Network Coding, by Denis Charles, Kamal Jain, Kristin Lauter, Invited paper for CISS06, in Int. J. Information and Coding Theory (IJICoT)
 Security Analysis of KEA Authenticated Key Exchange, by Kristin Lauter and Anton Mityagin, In PKC2006
 Cryptographic hash functions from expander graphs, by Denis Charles, Eyal Goren, Kristin Lauter, Second NIST Hash Function Workshop, in Journal of Cryptology.
 The Advantages of Elliptic Curve Cryptography for Wireless Security, IEEE Wireless Comm. Magazine, February 2004
Arithmetic Geometry

An arithmetic intersection formula for denominators of Igusa class polynomials, by Kristin Lauter, Bianca Viray, arXiv:1210.7841, http://eprint.iacr.org/2012/614

On singular moduli for arbitrary discriminants, by Kristin Lauter, Bianca Viray, arXiv:1206.6942

Comparing arithmetic intersection formulas for denominators of Igusa class polynomials, arXiv:1211.0788. by J. Anderson, J. Balakrishnan, K. Lauter, J. Park, B. Viray.

A GrossZagier formula for quaternion algebras over totally real fields, by Eyal Z. Goren and Kristin E. Lauter, to appear in Algebra and Number Theory. 2011/666

Igusa class polynomials, embeddings of quartic CM fields, and arithmetic intersection theory, by Helen Grundman, Jennifer JohnsonLeung, Kristin Lauter, Adriana Salerno, Bianca Viray, Erika Wittenborn, in WINWomen in Numbers: Research Directions in Number Theory, Fields Institute Communications Series, Volume 60 (2011). arXiv:1006.0208 [pdf]
 Genus 2 Curves with Complex Multiplication, Eyal Z. Goren and Kristin E. Lauter, Int Math Res Notices, published online April 12, 2011 doi:10.1093/imrn/rnr052 2010/156

Abelian surfaces admitting an (l,l)endomorphism, by Reinier Broker, Kristin Lauter, Marco Streng, Preprint 2011. arXiv:1106.1884 [pdf]

The distance between superspecial abelian varieties with real multiplication, by Eyal Goren, Kristin Lauter, Journal of Number Theory, Volume 129, Issue 6, June 2009, Pages 15621578 doi:10.1016/j.jnt.2008.07.005

Explicit Heegner points: Kolyvagin's conjecture and nontrivial elements in the Shafarevich–Tate group by Dimitar Jetchev, Kristin Lauter, William Stein, Journal of Number Theory, Volume 129, Issue 2, February 2009, Pages 284302
 Families of Ramanujan graphs and quaternion algebras, by Denis Charles, Eyal Goren, Kristin Lauter, in Groups and Symmetries: From Neolithic Scots to John McKay, AMS/CRM, 2009.
 Computing the Cassels pairing on Kolyvagin classes in the ShafarevichTate group, by Kirsten Eisentraeger, Dimitar Jetchev, Kristin Lauter, in Pairing 2008.
 Evil Primes and Superspecial Moduli, by Eyal Goren, Kristin Lauter, International Mathematics Research Notices, volume 2006, Article ID 53864, pages 1–19. (http://arxiv.org/abs/math/0512472)
 Class invariants of quartic CM fields, by Eyal Goren, Kristin Lauter, Annales de l'Institut Fourier, Vol. 57 no. 2 (2007), p.457480. (http://www.arxiv.org/math.NT/0404378)
 Primes in the denominators of Igusa class polynomials, by Kristin Lauter. (http://www.arxiv.org/math.NT/0301240)
Cryptographic implementation improvements

Two is Greater than One, by Joppe W. Bos, Craig Costello, Huseyin Hisil, and Kristin Lauter. Eurocrypt 2013, MSRTR2012117, November 2012

Attractive Subfamilies of BLS Curves for Implementing HighSecurity Pairings, by Craig Costello, Kristin Lauter, and Michael Naehrig, Progress in Cryptology – INDOCRYPT 2011, Lecture Notes in Computer Science 7107, SpringerVerlag (2011), pp 320–342.
2011/465 (PDF) 
Group Law Computations on Jacobians of Hyperelliptic Curves, by Craig Costello and Kristin Lauter, in Selected Areas in Cryptography SAC 2011, Lecture Notes in Computer Science Volume 7118, SpringerVerlag (2012), pp 92117. 2011/306 (PDF)

Affine Pairings on ARM, Tolga Acar, Kristin Lauter, Michael Naehrig, Daniel Shumow, In PairingBased Cryptography – Pairing 2012. 2011/243

An Analysis of Affine Coordinates for Pairing Computation, by Kristin Lauter, Peter L. Montgomery, Michael Naehrig, PairingBased Cryptography – Pairing 2010, Lecture Notes in Computer Science 6487, SpringerVerlag (2010), pp 1–20.
 Improved Weil and Tate pairings for elliptic and hyperelliptic curves, by K. Eisentraeger, K. Lauter, P.L. Montgomery, In: Algorithmic Number Theory  ANTSVI, Buell (Ed.), LNCS 3076, 169183. Published version. http://www.arxiv.org/ math.NT/0311391
 Trading Inversions for Multiplications in Elliptic Curve Cryptography, by Mathieu Ciet, Marc Joye, Kristin Lauter and Peter L. Montgomery, In Designs, Codes, and Cryptography. Published version. http://eprint.iacr.org/2003/257/
 Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation, by K. Eisentraeger, K. Lauter, P.L. Montgomery, In: Topics in Cryptology  CTRSA 2003, M. Joye (Ed.): LNCS 2612, 343354, Springer, Berlin 2003.
 The equivalence of the geometric and algebraic group laws for Jacobians of genus 2 curves, by K. Lauter, Topics in Algebraic and Noncommutative Geometry, AMS Contemporary Mathematics Series 324 (2003) 165171.
Algorithmic number theory

Improved CRT Algorithm for Class Polynomials in Genus 2, by Kristin Lauter and Damien Robert, In ANTSX: Algorithmic Number Theory Symposium 2012, 2012/443

Explicit CMtheory for level 2structures on abelian surfaces, by Reinier Broker, David Gruenewald, Kristin Lauter, Algebra and Number Theory, Vol. 5 (2011), No. 4, 495528. DOI: 10.2140/ant.2011.5.495, arXiv:0910.1848

Computing genus 2 curves from invariants on the Hilbert moduli space, by Kristin Lauter and Tonghai Yang, Journal of Number Theory, Elliptic Curve Cryptography Volume 131, Issue 5 (2011) 2010/294 ( PDF )
 Modular polynomials via isogeny volcanoes Reinier Broker, Kristin Lauter, Andrew V. Sutherland, Mathematics of Computation 2011. DOI:http://dx.doi.org/10.1090/S002557182011025081 arXiv:1001.0402 [pdf, ps, other]

Evaluating Igusa functions Reinier Broker, Kristin Lauter Preprint, 2010. arXiv:1005.1234 [pdf]

Generating Pairingfriendly Parameters for the CM Construction of Genus 2 Curves over Prime Fields, by Kristin Lauter and Ning Shang, in Designs, Codes and Cryptography. 2010/529 (PDF)
 Evaluating large degree isogenies and applications to pairing based cryptography, by Reinier Broker, Denis Charles, Kristin Lauter, in Pairing 2008.
 Modular polynomials for genus 2, by Reinier Broker and Kristin Lauter, London Math Society Journal of Mathematics and Computation.
 Computing Hilbert class polynomials, by Juliana Belding, Reinier Broker, Andreas Enge, Kristin Lauter, in ANTS 2008, Selfridge Prize for best paper.
 Computing endomorphism rings of Jacobians of genus 2 curves over finite fields, by David Freeman, Kristin Lauter, in Proceedings of SAGA 2007, Number Theory and its applications, World Scientific. (http://www.arxiv.org/math.NT/0701305).
 Computing Modular Polynomials, by Denis Charles, Kristin Lauter, London Math Society Journal of Computation and Mathematics, The LMS JCM, (8) 195204.
 A CRT algorithm for constructing genus 2 curves over finite fields, by Kirsten Eisentraeger, Kristin Lauter, in Proceedings of AGCT 2005: Arithmetics, Geometry, and Coding Theory  Société Mathématique de France, 2011. http://www.arxiv.org/math.NT/0405305
 Constructing elliptic curves with a known number of points over a prime field, by A. Agashe, K. Lauter, R. Venkatesan, High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communications Series, Volume 42, pp. 117.
Number of points on curves over finite fields

New methods for bounding the number of points on curves over finite fields, by Everett W. Howe, Kristin E. Lauter, Preprint, 2012. (35 pages)
 Pointless curves of genus 3 and 4, by Everett W. Howe, Kristin E. Lauter, Jaap Top, in Arithmetic, geometry and coding theory, Yves Aubry  Gilles Lachaud (Éd.) Séminaires et Congrès 11 (2005), xviii+216 pages, pp. 125141.
 Improved upper bounds for the number of points on curves over finite fields, by Everett W. Howe, Kristin E. Lauter, Annales de l'Institut Fourier, volume 53, 6(2003), 16771737.
 The maximum number of points on a curve of genus 4 over F_{8} is 25, by David Savitt, with an Appendix by K. Lauter, Canad. J. Math., 55 (2003), 331352.
 The maximum or minimum number of rational points on genus three curves over finite fields, by Kristin Lauter with an Appendix by JP. Serre, Compositio Math. 134 (2002) 87111.
 Geometric methods for improving the upper bounds on the number of rational points on algebraic curves over finite fields. Lauter, Kristin, with an appendix in French by J.P. Serre. J. Algebraic Geom. 10 (2001), no. 1, 1936.

Zeta functions of curves over finite fields with many rational points. Kristin Lauter, Coding theory, cryptography and related areas (Guanajuato, 1998), 167174, Springer, Berlin, 2000.

Nonexistence of a curve over F3 of genus 5 with 14 rational points. Kristin Lauter, Proc. Amer. Math. Soc. 128 (2000), no. 2, 369374. MR 1664414.
Abstract, references, and article information View Article: PDF 
Improved upper bounds for the number of rational points on algebraic curves over finite fields. Kristin Lauter, C. R. Acad. Sci. Paris Sér. I Math. 328 (1999), no. 12, 11811185.

A Formula for Constructing Curves over Finite Fields with Many Rational Points Kristin Lauter, Journal of Number Theory, Volume 74, Issue 1, January 1999, Pages 5672.

DeligneLusztig curves as ray class fields. Kristin Lauter, Manuscripta Math. 98 (1999), no. 1, 8796.

Ray Class Field Constructions of Curves over Finite Fields with Many Rational Points, K. Lauter, Algorithmic Number Theory Symposium (ed. by H. Cohen), Lecture Notes in Computer Science 1122, 187195 Springer, Berlin 1996.