Cryptography Research

Established: March 27, 2000

Cryptography is the ancient science of encoding messages so that only the sender and receiver can understand them. Cryptography is now available to everyone thanks to the development of modern computers, which can perform more mathematical operations in a second than a human being could do in a lifetime. An ordinary PC can produce codes of such complexity that the most powerful supercomputer using the best available attack algorithms would not break them in a million years. Cryptography is used to secure telephone, Internet, and email communication and to protect software and other digital property.

The Cryptography group within Microsoft Research serves multiple roles:

  • Researching new cryptographic methods and applications.
  • Working with standards bodies to develop security protocols.
  • Providing internal security consulting on Microsoft products.

Crypto Colloquium

The Crypto Colloquium is a venue for sharing our work with other local and visiting researchers.

Long-Term Visitors

Short-Term Visitors



Spring 2016

  • Sashank Agrawal, U. of Illinois at Urbana Champaign
  • Peter Rindal, Oregon State University

Summer/Fall 2015

  • Hao Chen, U. of Washington
  • Chaya Ganesh, Courant Institute
  • Kim Laine, UC Berkeley
  • Tarik Moataz, Colorado State U.

Spring 2015

  • Miran Kim, Seoul National University

Summer/Fall 2014

  • Sashank Agrawal, U. of Illinois at Urbana Champaign
  • Alina Dudeanu, EPFL
  • Tony Feng, Harvard
  • Xianrui Meng, Boston University
  • Muhammad Naveed, U. of Illinois at Urbana Champaign
  • Thomas Pöppelmann
  • Saeed Sadeghian, U. of Calgary
  • David Wu, Stanford

Summer/Fall 2013

  •  Foteini Baldimtsi, Brown
  • Alyson Deines-Schartz, U. of Washington
  • Kim Laine, UC Berkeley
  • Tancrede Lepoint, Ecole Normale Superieure
  • Sarah Meiklejohn, UCSD
  • Andrea Miele, EPFL
  • Joop Van de Pol, University of Bristol

Summer 2012

  • Craig Costello, Queensland U.
  • Feng-Hao Liu, Brown
  • Anurag Khandelwal, IIT Kharagpur
  • Jake Loftus, University of Bristol
  • Olya Ohrimenko, Brown
  • Vanishree Rao, UCLA

Summer/Fall 2011

  • Shweta Agrawal, UT Austin
  • Gaetan Bisson, LORIA/TU Eindhoven
  • Joppe Bos, EPFL
  • Craig Costello, Queensland U.
  • Simon Knellwolf, ETH Zurich
  • Sarah Meiklejohn, UC San Diego
  • Ben Riva, Tel Aviv U.
  • Lei Wei, UNC Chappel Hill

Summer 2010

  • Nishanth Chandran, UCLA
  • Beth Malmskog, Colorado State U.
  • Charalampos Papamanthou, Brown
  • Mariana Raykova, Columbia
  • Damien Robert, LORIA
  • Alexandra Savelieva, HSE
  • Emily Shen, MIT
  • Panagiotis Voulgaris, UC San Diego

Summer 2009

  • Michael Naehrig, TU Eindhoven
  • Adam O’Neill, Georgia Tech
  • Mariana Raykova, Columbia
  • Emily Shen, MIT
  • Bianca Viray, UC Berkeley
  • Marco Streng, Universiteit Leiden

Summer 2008

  • Sherman Chow, NYU
  • Ari Feldman, Princeton
  • Vipul Goyal, UCLA
  • David Gruenewald, U. of Sydney
  • Dan Shumow, U. of Washington

Interns with Kristin Lauter (2001-2007)

  • Kirsten Eisentraeger, UC Berkeley
  • Denis Charles, U Wisconsin
  • Anton Mityagin, UCSD
  • Dimitar Jetchev, UC Berkeley
  • David Mandell Freeman, UC Berkeley
  • Ning Shang, Purdue
  • Kate Stange, Brown




Singular Moduli Link description

Singular Moduli


December 15, 2008


Eyal Goren


McGill University

A variant of Lehmer’s conjecture Link description

A variant of Lehmer’s conjecture


February 27, 2007


Kumar Murty


Department of Mathematics, University of Toronto and GANITA Lab, University of Toronto at Mississauga


Cloud Cryptography

Microsoft Research, Redmond | August 2016

Cryptography is the ancient science of encoding messages so that only the sender and receiver can understand them. Cryptography is now available to everyone thanks to the development of modern computers, which can perform more mathematical operations in a second than a human being could do in a lifetime. An ordinary PC can produce codes […]

Applied Multi-Party Computation

Microsoft Research, Redmond | February 2014

Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation.


Elliptic Curve Cryptography (ECC)

Established: January 9, 2012

In the last 25 years, Elliptic Curve Cryptography (ECC) has become a mainstream primitive for cryptographic protocols and applications. ECC has been standardized for use in key exchange and digital signatures. This project focuses on efficient generation of parameters and…

Homomorphic Encryption

Established: March 27, 2016

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 decryption key. While traditional encryption schemes can be used to privately outsource data storage…

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…

Health and Genomic Privacy

Established: October 1, 2010

Electronic health records make patients' medical information more accessible and mobile, and have the potential to vastly improve health care; however, they also introduce new security and privacy concerns. Emerging technology for sequencing the human genome can help unlock secrets…

Lattice-based Cryptography

Established: July 3, 2010

Lattices are geometric objects that have recently emerged as a powerful tool in cryptography. Lattice-based schemes have also proven to be remarkably resistant to sub-exponential and quantum attacks (in sharp contrast to their number-theoretic friends). Our goal is to use…

Number Theory and Arithmetic Geometry

Established: August 27, 2009

Research on number theory and arithmetic geometry Related Links Cryptography group Events Computer Security and Cryptography (April 12-16, 2010)

Cloud Security & Cryptography

Established: August 27, 2009

Cloud computing provides clients with a virtual computing infrastructure on top of which they can store data and run applications.  While the benefits of cloud computing are clear, it introduces new security challenges since cloud operators are expected to manipulate client data without necessarily being fully…


Microsoft researchers enable secure data exchange in the cloud

By John Roach, Writer, Microsoft Research In the future, machine learning algorithms may examine our genomes to determine our susceptibility to maladies such as heart disease and cancer. Between now and then, computer scientists need to train the algorithms on…

August 2016

Microsoft Research Blog

Top Researchers Inspire Interns

By Janie Chang, Writer, Microsoft Research Each summer, Microsoft Research facilities from around the world welcome a fresh crop of interns. Microsoft Research considers the intern program a vital part of its interactions with the academic world, with some facilities…

August 2011

Microsoft Research Blog

Microsoft Research New England’s Focus: Research Relationships

By Rob Knies, Managing Editor, Microsoft Research On Feb. 4, Microsoft Research unveiled its latest lab, to be called Microsoft Research New England and to be based in Cambridge, Mass., in the midst of the Boston region’s bustling academic environment.…

February 2008

Microsoft Research Blog

MSR Cryptography News