| Publication | Date of Publication | Type |
|---|
| Concurrent zero knowledge with logarithmic round-complexity | 2026-05-29 | Paper |
| On the (im)possibility of cryptography with imperfect randomness | 2026-05-29 | Paper |
| Concurrent non-malleable zero knowledge | 2026-05-29 | Paper |
| Towards building efficient SCALES protocols | 2026-04-23 | Paper |
| Communication complexity vs randomness complexity in interactive proofs | 2026-02-03 | Paper |
| Homomorphic indistinguishability obfuscation and its applications | 2025-11-04 | Paper |
| Leakage-resilient incompressible cryptography: constructions and barriers | 2025-07-03 | Paper |
| Randomness in private sequential stateless protocols | 2025-07-03 | Paper |
| On the computational complexity of coin flipping | 2025-04-29 | Paper |
| Malicious security for SCALES. Outsourced computation with ephemeral servers | 2024-12-13 | Paper |
| R3PO: reach-restricted reactive program obfuscation and its applications | 2024-11-12 | Paper |
| CASE: a new frontier in public-key authenticated encryption | 2024-08-02 | Paper |
A map of witness maps: new definitions and connections
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
Theory of Cryptography | 2023-08-14 | Paper |
Secure non-interactive reducibility is decidable
Theory of Cryptography | 2023-08-14 | Paper |
SCALES. MPC with small clients and larger ephemeral servers
Theory of Cryptography | 2023-08-14 | Paper |
| Group Structure in Correlations and Its Applications in Cryptography. | 2023-07-03 | Paper |
| On communication models and best-achievable security in two-round MPC | 2023-04-13 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
Witness maps and applications
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| COA-secure obfuscation and applications | 2022-08-30 | Paper |
| Secure non-interactive reduction and spectral analysis of correlations | 2022-08-30 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| Zero-communication reductions | 2022-03-23 | Paper |
| Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC | 2021-07-28 | Paper |
| The bottleneck complexity of secure multiparty computation | 2021-07-28 | Paper |
| Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation | 2020-05-12 | Paper |
| Uncovering algebraic structures in the MPC landscape | 2020-02-06 | Paper |
| Towards characterizing securely computable two-party randomized functions | 2018-05-16 | Paper |
Rényi information complexity and an information theoretic characterization of the partition bound
(available as arXiv preprint) | 2017-12-19 | Paper |
Reconciling non-malleability with homomorphic encryption
Journal of Cryptology | 2017-10-12 | Paper |
Limits of random oracles in secure computation (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Assisted Common Information With an Application to Secure Two-Party Sampling
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Communication and Randomness Lower Bounds for Secure Computation
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
Theory of Cryptography | 2016-12-22 | Paper |
Secure protocol transformations
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
All complete functionalities are reversible
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Optimal computational split-state non-malleable codes
Theory of Cryptography | 2016-04-08 | Paper |
Explicit non-malleable codes against bit-wise tampering and permutations
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Cryptographic agents: towards a unified theory of computing on encrypted data
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
On the practical security of inner product functional encryption
Lecture Notes in Computer Science | 2015-08-27 | Paper |
A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
Theory of Cryptography | 2015-07-06 | Paper |
Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
Theory of Cryptography | 2015-07-06 | Paper |
Circuits resilient to additive attacks with applications to secure computation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
A unified characterization of completeness and triviality for secure function evaluation
Lecture Notes in Computer Science | 2014-08-20 | Paper |
On the communication complexity of secure computation
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Secure computation using leaky tokens
Automata, Languages, and Programming | 2014-07-01 | Paper |
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
On the power of public-key encryption in secure computation
Theory of Cryptography | 2014-02-18 | Paper |
Lower Bounds in the Hardware Token Model
Theory of Cryptography | 2014-02-18 | Paper |
On fair exchange, fair coins and fair sampling
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Robust pseudorandom generators
Automata, Languages, and Programming | 2013-08-06 | Paper |
New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Resource fairness and composability of cryptographic protocols
Journal of Cryptology | 2012-01-13 | Paper |
The limits of common coins: further results
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Constant-rate oblivious transfer from noisy channels
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Efficient non-interactive secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Exploring the limits of common coins using frontier analysis of protocols
Theory of Cryptography | 2011-05-19 | Paper |
Attribute-based signatures
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
A zero-one law for cryptographic complexity with respect to computational UC security
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Concurrent general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
New notions of security: achieving universal composability without trusted setup
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximating the smallest grammar
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Statistically Hiding Sets
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Rerandomizable RCCA Encryption
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Secure Arithmetic Computation with No Honest Majority
Theory of Cryptography | 2009-03-03 | Paper |
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Theory of Cryptography | 2009-03-03 | Paper |
Founding Cryptography on Oblivious Transfer – Efficiently
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Towards Robust Computation on Encrypted Data
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
The Smallest Grammar Problem
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Homomorphic Encryption with CCA Security
Automata, Languages and Programming | 2008-08-19 | Paper |
Concurrent composition of secure protocols in the timing model
Journal of Cryptology | 2007-12-06 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Private Circuits II: Keeping Secrets in Tamperable Circuits
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2089989 (Why is no real title available?) | 2004-08-12 | Paper |
