| 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 |
| https://portal.mardi4nfdi.de/entity/Q4598167 | 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 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 |
