Allison Bishop


450 Computer Science Building
Mail Code 0401

Tel(212) 939-7000
Fax(212) 666-0140

Allison Bishop studies adversarial behaviors in complex systems, and is motivated by the challenge of designing systems to be resilient against a wide range of failures and attacks. She has worked extensively in cryptography, developing new techniques for building and reasoning about cryptographic algorithms. She has also worked in distributed computing, particularly on illuminating the fundamental limitations of natural classes of algorithms for achieving consensus in distributed computing systems. 

Bishop is also currently working for The Investor’s Exchange (IEX) to design and evaluate systemic defenses against predatory high frequency trading strategies. The common philosophy underlying all of her current research projects is that a rigorous theoretical framework can be applied and adapted to better understand and design real-world systems, where practical motivations and constraints intrude upon the cleanliness of purely theoretical models. She views mathematics and computer science theory as key tools for achieving high performance and security, but feels that theory will only fulfill its true potential for impact if theoreticians are willing to engage with the messy realities of how people deploy and interact with computational systems.

Bishop received a BA in mathematics from Princeton University in 2006, a certificate of advanced study in mathematics from the University of Cambridge in 2007, and a PhD in computer science from the University of Texas at Austin in 2012.  


  • Postdoctoral Researcher, Microsoft Research New England, 2012-2013


  • Assistant Professor of computer science, Columbia University, 2013 -
  • Quantitative Researcher, The Investors Exchange, 2015 - 


  • NSF Career Award, 2016
  • Forbes 30 under 30 List for Science and Healthcare, 2014
  • Microsoft Research PhD Fellow, 2011
  • National Defense Science and Engineering Graduate Fellow, 2008
  • Marshall Scholar, 2006


  • A. Bishop, V. Pastro, R. Rajaraman, and D. Wichs, “Essentially Optimal Robust Secret Sharing with Maximal Corruptions,” EUROCRYPT 2016.
  • A. Bishop and Y. Dodis, “Interactive Coding for Interactive Proofs,” TCC 2016.
  • A. Bishop, A. Jain, and L. Kowalczyk, “Function-Hiding Inner Product Encryption,” ASIACRYPT 2015.
  • C. Gentry, A. Lewko, A. Sahai, and B. Waters, “Indistinguishability Obfuscation from the Multilinear Sugroup Elimination Assumption,” FOCS 2015.
  • C. Gentry, A. Lewko, and B. Waters, “Witness Encryption from Instance Independent Assumptions,” CRYPTO 2014.
  • Y. Kalai, A. Lewko, and A. Rao, “Formulas Resilient to Short-Circuit Errors,” FOCS 2012.
  • A. Lewko and B. Waters, “New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques,” CRYPTO 2012.
  • A. Lewko, “Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting,” EUROCRYPT 2012.
  • A. Lewko, “The Contest Between Simplicity and Efficiency in Asynchronous Byzantine Agreement,” DISC 2011.