| Publication | Date of Publication | Type |
|---|
| Credibility in private set membership | 2023-11-16 | Paper |
| A new approach to efficient non-malleable zero-knowledge | 2023-07-07 | Paper |
| Black-box constructions of bounded-concurrent secure computation | 2022-12-16 | Paper |
| Towards a unified approach to black-box constructions of zero-knowledge proofs | 2022-05-18 | Paper |
| Compact ring signatures from learning with errors | 2022-03-31 | Paper |
| Random walks and concurrent zero-knowledge | 2021-02-23 | Paper |
| Improved algorithms for optimal embeddings | 2018-11-05 | Paper |
| A new approach to black-box concurrent secure computation | 2018-07-09 | Paper |
| Incremental deterministic public-key encryption | 2018-04-26 | Paper |
| Block-wise non-malleable codes | 2017-12-19 | Paper |
| Do distributed differentially-private protocols require oblivious transfer? | 2017-12-19 | Paper |
| Incremental program obfuscation | 2017-11-15 | Paper |
| Textbook non-malleable commitments | 2017-09-29 | Paper |
| Breaking the sub-exponential barrier in obfustopia | 2017-06-23 | Paper |
| On the exact round complexity of self-composable two-party computation | 2017-06-13 | Paper |
| Secure multiparty RAM computation in constant rounds | 2016-12-21 | Paper |
| Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium | 2016-10-27 | Paper |
| Deterministic Public-Key Encryption Under Continual Leakage | 2016-10-04 | Paper |
| The Exact Round Complexity of Secure Computation | 2016-07-15 | Paper |
| Optimal computational split-state non-malleable codes | 2016-04-08 | Paper |
| Explicit non-malleable codes against bit-wise tampering and permutations | 2015-12-10 | Paper |
| Public-coin differing-inputs obfuscation and its applications | 2015-07-06 | Paper |
| A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations | 2015-07-06 | Paper |
| Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP | 2015-07-06 | Paper |
| Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma | 2015-07-06 | Paper |
| Non-malleable zero knowledge: black-box constructions and definitional relationships | 2014-10-14 | Paper |
| Relaxed two-to-one recoding schemes | 2014-10-14 | Paper |
| Interactive proofs under continual memory leakage | 2014-08-07 | Paper |
| Achieving constant round leakage-resilient zero-knowledge | 2014-02-18 | Paper |
| Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols | 2013-09-02 | Paper |
| Cryptography using \texttt{CAPTCHA} puzzles | 2013-04-19 | Paper |
| Incremental Deterministic Public-Key Encryption | 2012-06-29 | Paper |
| Property preserving symmetric encryption | 2012-06-29 | Paper |
| Publicly verifiable secret sharing for cloud-based key management | 2011-12-16 | Paper |
| Efficiency preserving transformations for concurrent non-malleable zero knowledge | 2010-02-24 | Paper |
| Computational Differential Privacy | 2009-10-20 | Paper |
| Adaptive One-Way Functions and Applications | 2009-02-10 | Paper |
| Bounded Ciphertext Policy Attribute Based Encryption | 2008-08-19 | Paper |
| Precise Concurrent Zero Knowledge | 2008-04-15 | Paper |
| Private Locally Decodable Codes | 2007-11-28 | Paper |
| Topics in Cryptology – CT-RSA 2006 | 2007-02-12 | Paper |
