Publications

The following is a chronological list of most of my publications. Please see my Google Scholar profile and DBLP page for the PDFs.

with Shashank Agrawal, Pratyay Mukherjee, Peter Rindal
DiSE: Distributed Symmetric-key Encryption.
ACM CCS 2018


with Shashank Agrawal, Peihan Miao, Pratyay Mukherjee
PASTA: PASsword-based Threshold Authentication.
ACM CCS 2018


with Peter Rindal
ABY3: A Mixed Protocol Framework for Machine Learning.
ACM CCS 2018


with Shashank Agrawal and Chaya Ganesh
Non-Interactive Zero-Knowledge Proofs for Composite Statements.
CRYPTO 2018


with Nishanth Chandran, Juan Garay, and Satyanarayana Vusirikala
Efficient Constant-Round and Actively Secure MPC: Beyond the Three-Party Case.
ACM CCS 2017


with Yupeng Zhang
SecureML: A System for Scalable Privacy-Preserving Machine Learning.
IEEE S&P 2017


with Mike Rosulek and Alessandra Scafuro
Sublinear Zero-Knowledge Arguments for RAM Programs.
EUROCRYPT 2017


with Mike Rosulek
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings.
EUROCRYPT 2017


with Ian Miers
IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality.
NDSS 2017


with Sanjam Garg and Charalampos Papamanthou
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption.
CRYPTO 2016


with Melissa Chase and Chaya Ganesh
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials.
CRYPTO 2016


with Alptekin Kupcu
Fast Optimistically Fair Cut-and-Choose 2PC.
FC 2016


with Ostap Orobetes and Ben Riva
Efficient Server-Aided 2PC for Mobile Phones.
PETS 2016


with Mike Rosulek and Ye Zhang
Fast and Secure Three-party Computation: The Garbled Circuit Approach.
ACM CCS 2015


with Zhangxiang Hu and Mike Rosulek
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost.
CRYPTO 2015


with Arash Afshar and Zhangxiang Hu and Mike Rosulek
How to Efficiently Evaluate RAM Programs with Malicious Security.
EUROCRYPT 2015


with Vladimir Kolesnikov and Ben Riva and Mike Rosulek
Richer Efficiency/Security Trade-offs in 2PC.
TCC 2015


with Saeed Sadeghian and Nigel Smart
Actively Secure Private Function Evaluation.
ASIACRYPT 2014


with Vladimir Kolesnikov and Mike Rosulek
FleXOR: Flexible garbling for XOR gates that beats free-XOR.
CRYPTO 2014


with Arash Afshar, Benny Pinkas, and Ben Riva
Non-Interactive Secure Computation Based on Cut-and-Choose.
EUROCRYPT 2014


with Seny Kamara, Mariana Raykova, and Saeed Sadeghian
Scaling Private Set Intersection to Billion-Element Sets.
FC 2014


with Dana Dachman-Soled and George Fuchsbauer and Adam O’Neill
Enhance Chosen-Ciphertext Security and Applications.
PKC 2014


with Ebrahim Tarameshloo and Philip W. L. Fong
On Protection in Federated Social Computing Systems.
ACM CODASPY 2014


with Ben Riva
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.
CRYPTO 2013


with Isheeta Nargis and Wayne Eberly
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority.
AFRICACRYPT 2013


with Saeed Sadeghian
How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation.[Full Version][Long Talk]
EUROCRYPT 2013


with Salman Niksefat, Babak Sadeghiyan, and Saeed Sadeghian
ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols
The Computer Journal, 2013, doi: 10.1093/comjnl/bxt019


with Ozgur Dagdelen and Daniele Venturi
Rate-limited Secure Function Evaluation: Definitions and Constructions.
PKC 2013


with Salman Niksefat and Babak Sadeghiyan
Oblivious Decision Program Evaluation.
In IET Information Security Journal, 2013, doi: 10.1049/iet-ifs.2012.0032


with Seny Kamara and Ben Riva
Salus: A System for Server-Aided Secure Function Evaluation.
ACM CCS 2012.


with Salman Niksefat
Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions.
FC 2012


with Salman Niksefat, Saeed Sadeghian, and Babak Sadeghiyan
An Efficient Protocol for Oblivious DFA Evaluation and Applications.
CT-RSA 2012.


with Seny Kamara, and Mariana Raykova
Outsourcing Multiparty Computation.

eprint archive 2011


Fast Computation On Encrypted Polynomials and Applications.
CANS 2011


A Closer Look at Anonymity and Robustness in Encryption Schemes.
ASIACRYPT 2010


One-time Signatures and Chameleon Hash Functions.
SAC 2010


with Matthew Franklin
Secure and Efficient Evaluation of Multivariate Polynomials and Applications.
ACNS 2010


with Eike Kiltz and Adam O’Neill.
Adaptive Trapdoor Functions and Chosen Ciphertext Security.
EUROCRYPT 2010


with Mark Gondree
Longest Common Subsequence as Private Search.
ACM WPES 2009 


with Matthew Franklin and Mark Gondree.
Communication-Efficient Private Protocols for Longest Common Subsequence.
CT-RSA 2009 .


with Enav Weinreb.
Efficient Secure Linear Algebra In Presence of Covert or Computationally Unbounded Adversaries.
CRYPTO 2008


with Vipul Goyal and Adam Smith.
Secure Two-party and Multi-party Computation against Covert Adversaries.
EUROCRYPT 2008


with Mark Gondree and Matthew Franklin.
Multiparty Indirect Indexing and Applications.
ASIACRYPT 2007 .


with Nenad Dedic.
Constant-Round Private Database Queries .
ICALP 2007


with Eike Kiltz and Enav Weinreb and Matthew Franklin.
Secure Linear Algebra Using Linearly Recurrent Sequences.
TCC 2007 .


with Matthew Franklin and Mark Gondree.
Improved Efficiency for Private Stable Matching.
CT-RSA 2007 .


with Matthew Franklin.
Efficiency Tradeoffs for Malicious Two-Party Computation.
PKC 2006


with Matthew Franklin.
Efficient Polynomial Operations in the Shared-Coefficients Setting.
PKC 2006 .


with Gergei Bana and Till Stegers.
Computational Soundness of Formal Indistinguishability and Static Equivalence.
ASIAN 2006 .