| Publication | Date of Publication | Type |
|---|
| Malleable SNARKs and their applications | 2025-12-02 | Paper |
| Early stopping for any number of corruptions | 2024-11-13 | Paper |
On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Formalizing delayed adaptive corruptions and the security of flooding networks
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Public randomness extraction with ephemeral roles and worst-case corruptions
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Random-index PIR and applications | 2023-04-13 | Paper |
| Fast threshold ECDSA with honest majority | 2022-12-16 | Paper |
| Afgjort: a partially synchronous finality layer for blockchains | 2022-12-16 | Paper |
| Reverse firewalls for actively secure MPCs | 2022-11-09 | Paper |
| Universally composable subversion-resilient cryptography | 2022-08-30 | Paper |
| Weight-based Nakamoto-style blockchains | 2022-06-15 | Paper |
| YOSO: You only speak once. Secure MPC with stateless ephemeral roles | 2022-04-22 | Paper |
| TARDIS: a foundation of time-lock puzzles in UC | 2021-12-08 | Paper |
| Lower bounds for leakage-resilient secret sharing | 2021-12-01 | Paper |
High-performance multi-party computation for binary circuits based on oblivious transfer
Journal of Cryptology | 2021-08-10 | Paper |
Continuously non-malleable codes in the split-state model
Journal of Cryptology | 2020-11-06 | Paper |
| Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures | 2020-03-09 | Paper |
| Communication lower bounds for statistically secure MPC, with or without preprocessing | 2020-03-09 | Paper |
| Continuous non-malleable codes in the 8-split-state model | 2020-02-04 | Paper |
Lower bounds for oblivious data structures
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Continuously non-malleable codes with split-state refresh
Theoretical Computer Science | 2019-01-18 | Paper |
| Yes, there is an oblivious RAM lower bound! | 2018-09-26 | Paper |
Continuously non-malleable codes with split-state refresh
Applied Cryptography and Network Security | 2018-08-10 | Paper |
| Maliciously secure oblivious linear function evaluation with constant overhead | 2018-04-06 | Paper |
Non-malleable Codes with Split-State Refresh
Lecture Notes in Computer Science | 2017-06-13 | Paper |
On the computational overhead of MPC with dishonest majority
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Predictable arguments of knowledge
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Fully Leakage-Resilient Codes
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Reactive garbling: foundation, instantiation, application
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
Theoretical Computer Science | 2016-12-22 | Paper |
Cross and clean: amortized garbled circuits with constant overhead
Theory of Cryptography | 2016-12-21 | Paper |
Rate-1, linear time and additively homomorphic UC commitments
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
On the communication required for unconditionally secure multiplication
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Unconditionally secure computation with reduced interaction
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Signature schemes secure against hard-to-invert leakage
Journal of Cryptology | 2016-06-01 | Paper |
On the complexity of additively homomorphic UC commitments
Theory of Cryptography | 2016-03-23 | Paper |
Mind your coins: fully leakage-resilient signatures with graceful degradation
Automata, Languages, and Programming | 2015-10-27 | Paper |
Superposition attacks on cryptographic protocols
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Privacy-free garbled circuits with applications to efficient zero-knowledge
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Adaptive versus Static Security in the UC Model
Provable Security | 2015-09-29 | Paper |
On the orthogonal vector problem and the feasibility of unconditionally secure leakage-resilient computation
Lecture Notes in Computer Science | 2015-09-24 | Paper |
A tamper and leakage resilient von Neumann architecture
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Additively homomorphic UC commitments with optimal amortized overhead
Lecture Notes in Computer Science | 2015-08-27 | Paper |
| Secure multiparty computation and secret sharing | 2015-08-06 | Paper |
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Compact VSS and efficient homomorphic UC commitments
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Faster maliciously secure two-party computation using the GPU
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Leakage-Resilient Signatures with Graceful Degradation
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Continuous non-malleable codes
Theory of Cryptography | 2014-02-18 | Paper |
Secure key management in the cloud
Cryptography and Coding | 2014-01-17 | Paper |
Limits on the power of cryptographic cheap talk
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
MiniLEGO: efficient secure two-party computation from general assumptions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
On the connection between leakage tolerance and adaptive security
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Signature schemes secure against hard-to-invert leakage
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
A new approach to practical active-secure two-party computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Actively secure two-party evaluation of any quantum operation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Lower and upper bounds for deniable public-key encryption
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Fully simulatable quantum-secure coin-flipping and applications
Lecture Notes in Computer Science | 2011-06-29 | Paper |
Perfectly secure oblivious RAM without random oracles
Theory of Cryptography | 2011-05-19 | Paper |
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
On the necessary and sufficient assumptions for UC computation
Theory of Cryptography | 2010-02-24 | Paper |
From Passive to Covert Security at Low Cost
Theory of Cryptography | 2010-02-24 | Paper |
Secure multiparty computation goes live
Financial Cryptography and Data Security | 2010-01-07 | Paper |
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Privacy-Enhancing Auctions Using Rational Cryptography
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Asynchronous Multiparty Computation: Theory and Implementation
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
Scalable and Unconditionally Secure Multiparty Computation
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
LEGO for Two-Party Secure Computation
Theory of Cryptography | 2009-03-03 | Paper |
Universally Composable Multiparty Computation with Partially Isolated Parties
Theory of Cryptography | 2009-03-03 | Paper |
Asynchronous Multi-Party Computation with Quadratic Communication
Automata, Languages and Programming | 2008-08-19 | Paper |
Secure Protocols with Asymmetric Trust
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Isolated Proofs of Knowledge and Isolated Zero Knowledge
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Lecture Notes in Computer Science | 2008-03-18 | Paper |
OT-Combiners via Secure Computation
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Simplified Threshold RSA with Adaptive and Proactive Security
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Robust Multiparty Computation with Linear Communication Complexity
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
| scientific article; zbMATH DE number 1942445 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1942416 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1942434 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1942437 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1808209 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1759794 (Why is no real title available?) | 2002-08-06 | Paper |
