I am a Professor at the Khoury College of Computer Sciences at Northeastern. My research area is computer security and cryptography and I aim to develop systems that incorporate novel cryptographic techniques in order to achieve interesting security properties.
My work currently focuses on secure computation protocols, zero-knowledge protocols and verifiable computation, and cryptocurrencies and blockchains. My email is abhi at neu.edu.
I am co-chair of the ACM AFT'20 conference which has free registration this year and will be held online. I was co-chair of the 3rd ZKProofs workshop 2020 which was also held online and will also help organize the 4th ZKProofs workshop to be held in 2021.
I am an associate editor of the journal Information Processing Letters which invites submission of short, original research articles that focus on fundamental aspects of information processing and computing.
Our group’s project page at neucrypt.org hosts source code for all of our recent projects.
I am the lead PI of the ACHILLES project, which aims to construct a new programming language to assist development of secure computation applications.
See anonize.org for our implementation of the ANONIZE scheme. The implementation was used to run course reviews at CornellTech and class surveys at U of Virginia. Here is a Wired story about the scheme. Contact me if you are interested in using it.
My group is accepting PhD students for 2020, please contact me if you are interested. I also welcome undergraduates to find research projects in my group (before covid, there
are currently were 5 undergraduates who contribute on weekly basis to our projects).
Current members in my group are:
- Jack Doerner (started 2016)
- Eysa Lee (started 2017)
- Yash Kondi (started 2017)
- Ran Cohen (postdoc 2017–2019, now research scientist)
- Schuyler Rosefield (started F'18)
My former PhD students include Mona Sergi (2013, now at Google), Chih-hao Shen (2014, now at Google), Ben Kreuter (2018, now at Google), Ben Terner (Masters 2015, going to UCSD to complete PhD).
My research is supported by the National Science Foundation, IARPA Hector project, the Microsoft Faculty Fellowship Award, the FEST fellowship award, an Amazon Research award, an SAIC research award, a Jacobs Future of Money Workshop research prize, a Google Faculty Research Award, and a Brave Faculty Research Award.
Guaranteed Output Delivery in O(sqrt(n)) rounds for Round Robin Sampling Protocols
Ran Cohen, Jack Doerner, Yash Kondi, abhi shelat To appear in Eurocrypt'22
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority
Carmit Hazay, Megan Chen, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, abhi shelat, Ruihan Wang, Muthu Venkitasubramaniam Oakland'2021 and eprint 2020/374
Multiparty Generation of an RSA Modulus
Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, abhi shelat CRYPTO'2020 and eprint 2020/370
Going Beyond Dual Execution: MPC for Functions with Efficient Verification
Carmit Hazay and abhi shelat and Muthu Venkitasubramaniam PKC'2020 and eprint 2020/139
Securely Sampling Biased Coins with Applications to Differential Privacy
Jeffrey Champion and abhi shelat and Jonathan Ullman CCS'2019 and eprint 2019/823
Adaptively Secure MPC with Sublinear Communication Complexity
Ran Cohen and abhi shelat and Daniel Wichs CRYPTO'2019 and eprint 2018/1161
Minimizing Trust in Hardware Wallets with Two Factor Signatures
Antonio Marcedone and Rafael Pass and abhi shelat Financial Crypto'2019
Threshold ECDSA from ECDSA Assumptions The Multiparty Case
Jack Doerner and Yashvanth Kondi and Eysa Lee and abhi shelat Oakland S&P'2019
A better method to analyze blockchain consistency
Lucianna Kiffer, Rajmohan Rajaraman, abhi shelat ACM CCS 2018
Blind Certificate Authorities
Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, abhi shelat Oakland S&P'2019
Secure Multi-party Threshold ECDSA from ECDSA Assumptions
Jack Doerner and Yashvanth Kondi and Eysa Lee and abhi shelat Oakland S&P'2018
Multi-Key Searchable Encryption, Revisited
Ariel Hamlin and abhi shelat and Mor Weiss and Daniel Wichs PKC'2018
Doubly-efficient zkSNARKs without trusted setup
Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish Oakland S&P'2018 and eprint/2017/1132
Socially Optimal Mining Pools
Ben A. Fisch and Rafael Pass and abhi shelat WINE 2017 and arXiv
Scaling ORAM for Secure Computation
Jack Doerner and abhi shelat CCS'2017 *Best paper award*, eprint/2017/827
Full accounting for verifiable outsourcing
Riad S. Wahby and Ye Ji and Andrew J. Blumberg and abhi shelat and Justin Thaler and Michael Walfish and Thomas Wies CCS'2017 and eprint 2017/242
Analysis of the Blockchain Protocol in Asynchronous Networks
Rafael Pass and Lior Seeman and abhi shelat Eurocrypt 2017 and eprint.iacr.org/2016/454
Secure Stable Matching at Scale
Jack Doerner and Dave Evans and abhi shelat CCS'16
Bounded KDM Security from iO and OWF
Antonio Marcedone and Rafael Pass and abhi shelat SCN'16
The Cut-and-Choose Game and its Application to Cryptographic Protocols
Ruiyu Zhu, Yan Huang, Jonathan Katz, abhi shelat USENIX Security 2016
Riad S. Wahby and Max Howald and Siddharth Garg and abhi shelat and Michael Walfish Oakland S&P 2016 *Best student paper award*
How to Use SNARKs in Universally Composable Protocols
Ahmed Kosba, Zhichao Zhao,rew Miller, Hubert Chan, Charalampos Papamanthou, Rafael Pass, abhi shelat and Elaine Shi eprint/2015/1093
Lower Bounds on Assumptions behind Indistinguishability Obfuscation
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass and abhi shelat TCC 2016
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
Rafael Pass and abhi shelat TCC 2016
Secure Computation from Millionaire
abhi shelat and Muthu Venkitasubramaniam Asiacrypt 2015
Micropayments for Peer-to-peer currencies
Rafael Pass and abhi shelat ACM Conf on Computer Security (CCS) 2015
An Overview of ANONIZE: A Large scale anonymous survey system
S. Hohenberger, S. Myers, R. Pass, and a. shelat IEEE Security & Privacy Journal, Vol 13, No 2, Mar 2015.
Oblivious RAM for Secure Computation
Xiao Wang, Hubert Chen, Yan Huang, abhi shelat, Elaine Shi ACM Conf on Computer Security (CCS) 2014
ANONIZE: A Large-Scale Anonymous Survey System
Susan Hohenberger, Steven Myers, Rafael Pass, abhi shelat IEEE Security & Privacy (Oakland) 2014
GPU and CPU Parallelization of Secure Two-Party Computation
Nathaniel Husted, Steven Myers, and abhi shelat Annual Computer Security Applications Conf (ACSAC) 2013
Fast Two-Party Secure Computation with Minimal Assumptions
Chih-hao Shen, abhi shelat ACM Conf on Computer Security (CCS) 2013
Lessons learned with PCF Scaling Secure Computation
Ben Kreuter, abhi shelat Workshop on language support for Privacy Enhancing Technologies (PETSHOP) 2013
PCF: A Portable Circuit Format For Scalable Two-Party Secure Computation
Benjamin Kreuter, a.shelat, Benjamin Mood, Kevin Butler USENIX Security, 2013
Algorithms for Compressed Inputs
Nathan Brunelle, Gabe Robins, abhi shelat Data Compression Conference, 2013 (poster)
Blackbox Construction of A More Than Non-Malleable CCA1 Encryption Scheme from Plaintext
Steve Myers, Mona Sergi, abhi shelat J. of Computer Security, Vol 21, No 5, pp 721–748
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
Steve Myers, Mona Sergi, abhi shelat Theory of Cryptography Conference (TCC) 2013
Billion-Gate Secure Computation with Malicious Adversaries
Ben Kreuter, Chih-hao Shen, abhi shelat USENIX Security 2012
Matching by propensity score in cohort studies with three treatment groups
J. A. Rassen, a. shelat, J. Myers, R.J. Glynn, and S. Schneeweiss Epidemiology, in press 2012
One-to-many propensity score matching in cohort studies,
J. A. Rassen, a. shelat, J. Myers, R. Glynn, K. Rothman, S. Schneeweiss J. of Pharmacoepidemiology and Drug Safety, v21.S2, 12 pages, May 2012
Computing on Authenticated Data
J.Ahn, D.Boneh, J.Camenisch, S.Hohenberger, a.shelat, and B.Waters Theory of Cryptography Conference 2012
Efficient Secure Computation with Garbled Circuits
Y. Huang, C.~Shen, D.~Evans, J.~Katz, and a.~shelat Information systems security 2011
Blackbox Construction of A More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
Steve Myers, Mona Sergi, abhi shelat Secure Computer Networks (SCN) 2011
Two-output Secure Computation With Malicious Adversaries
Chih-hao Shen and a. shelat Eurocrypt 2011
A Sub-0.5V Lattice-Based Public-Key Encryption Scheme for RFID Platforms in 130nm CMOS
Yu Yao, Sudhanshu Khanna, Ben Calhoun, Dave Evans, John Lach, and a. shelat RFIDSEC’11 Asia
Rafael Pass and a. shelat Innovations in Computer Science ’11 (ICS’11)
Optimistic Concurrent Zero Knowledge
Alon Rosen and a. shelat Asiacrypt ’10
Additive Combinatorics and Discrete Logarithm Based Range Protocols
R. Chaabouni, H. Lipmaa, a.shelat Australasian conf Inf Security & Privacy (ACISP’10) and
Bit Encryption is Complete
Steven Myers and abhi shelat. FOCS 2009. Proceedings version
Collusion-Free Multiparty Computation in the Mediated Model
J. Alwen, J. Katz, Y. Lindell, G. Persiano, a. shelat, and I. Visconti. CRYPTO 2009. Santa Barbara, CA.
Purely Rational Secret Sharing
Silvio Micalli and abhi shelat. Theory of Cryptography Conference (TCC) 2009.
Efficient Protocols for Set Membership and Range Proofs
Jan Camenisch, Raﬁk Chaabouni, and abhi shelat ASIACRYPT 2008
Collusion-Free Protocols in the Mediated Model
Joel Alwen, abhi shelat, and Ivan Visconti CRYPTO 2008
Bounded CCA2-Secure Encryption
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, abhi shelat, and Vinod Vaikuntanathan. ASIACRYPT’07, December 2007, Kuching, Malaysia.
Relations Among Notions of Non-Malleability for Encryption
Rafael Pass, abhi shelat, and Vinod Vaikuntanathan. ASIACRYPT’07, December 2007, Kuching, Malaysia.
Cryptography from Sunspots: How to use an Imperfect Reference String
Ran Canetti, Rafael Pass, and abhi shelat Foundations of Computer Science (FOCS’07), Providence, Rhode Island, October 2007.
Efficient Fork-Linearizable Access to Untrusted Shared Memory
Christian Cachin, abhi shelat, and Alex Shraer Principles of Distributed Computing (PODC’07), Portland, Oregan, Aug 2007.
Simulatable Adaptive Oblivious Transfer
Jan Camenisch, Gregory Neven, and abhi shelat EUROCRYPT 2007, Barcelona, Spain, May 2007. p.573-590.
Securely Obfuscating Re-encryption
Susan Hohenberger, Guy Rothblum, abhi shelat, and Vinod Vaikuntanathan Theory of Cryptography Conference (TCC’07), Amsterdam, The Netherlands, Feb 2007, p. 233-252.
Construction of a Non-malleable Encryption Scheme from Any Semantically-Secure One
Rafael Pass, abhi shelat, and Vinod Vaikuntanathan CRYPTO’06, Santa Barbara, CA, Aug 2006, p.271-289.
Unconditional Characterizations of Non-Interactive Zero-Knowledge
Rafael pass and abhi shelat CRYPTO’05, Santa Barbara, CA, Aug 2005, p.118-134.
The Smallest Grammar Problem
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, abhi shelat IEEE Transactions on Information Theory, Vol. 51, Issue 7, Jul 2005, p2554-2576.
Matt Lepinski and Silvio Micali and abhi shelat Symposium on the Theory of Computation (STOC’05), Baltimore, MD, May 2005, p.543-552.
Fair Zero Knowledge
Matt Lepinski and Silvio Micali and abhi shelat Theory of Cryptography (TCC’05), Cambridge, MA, Feb 2005, p.245-263.
Completely Fair SFE and Coalition-Safe Cheap Talk
Matt Lepinski and Silvio Micali and Chris Peikert and abhi shelat Principles of Distributed Computing (PODC’04), St. John’s Newfoundland, Jul 2004, p.1-10.
Searching for Stable Mechanisms : Automated Design for Imperfect Players
Andrew Blumberg and abhi shelat AAAI 2004
Remembrance of Data Passed: A Study of Disk Sanitization Practices
Simson Garfinkel and abhi shelat IEEE Security and Privacy, January/February 2003
Lower Bounds for Collusion-Secure Fingerprinting
Chris Peikert, abhi shelat, and Adam Smith SODA 2003
Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, abhi shelat STOC 2002
Approximation Algorithms for Grammar-Based Compression
Eric Lehman and abhi shelat SODA 2002