| Publication | Date of Publication | Type |
|---|
| Best of both worlds. Revisiting the spymasters double agent problem | 2024-02-02 | Paper |
| Private polynomial commitments and applications to MPC | 2023-11-16 | Paper |
| Ligero: lightweight sublinear arguments without a trusted setup | 2023-11-07 | Paper |
| Putting the online phase on a diet: covert security from short MACs | 2023-10-04 | Paper |
| SCALES. MPC with small clients and larger ephemeral servers | 2023-08-14 | Paper |
| On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives | 2023-08-14 | Paper |
| Financially backed covert security | 2023-08-10 | Paper |
| Actively secure garbled circuits with constant communication overhead in the plain model | 2023-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6107255 | 2023-07-03 | Paper |
| Multi-clients verifiable computation via conditional disclosure of secrets | 2022-12-16 | Paper |
| Gradual GRAM and secure computation for RAM programs | 2022-12-16 | Paper |
| Asymptotically quasi-optimal cryptography | 2022-08-30 | Paper |
| ZK-PCPs from leakage-resilient secret sharing | 2022-08-01 | Paper |
| TinyKeys: a new approach to efficient multi-party computation | 2022-04-11 | Paper |
| The price of active security in cryptographic protocols | 2022-03-23 | Paper |
| Generic compiler for publicly verifiable covert multi-party computation | 2021-12-08 | Paper |
| Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? | 2021-12-01 | Paper |
| Going beyond dual execution: MPC for functions with efficient verification | 2021-12-01 | Paper |
| Round-optimal secure multi-party computation | 2021-07-30 | Paper |
| Low cost constant round MPC combining BMR and oblivious transfer | 2020-11-06 | Paper |
| TinyKeys: a new approach to efficient multi-party computation | 2020-06-30 | Paper |
| On the power of secure two-party computation | 2020-03-03 | Paper |
| Constant-round maliciously secure two-party computation in the RAM model | 2019-11-27 | Paper |
| What security can we achieve within 4 rounds? | 2019-11-27 | Paper |
| On black-box complexity of universally composable security in the CRS model | 2019-08-13 | Paper |
| Efficient RSA key generation and threshold Paillier in the two-party setting | 2019-06-20 | Paper |
| Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) | 2019-01-23 | Paper |
| Round-optimal fully black-box zero-knowledge arguments from one-way permutations | 2018-12-11 | Paper |
| Two-Dimensional Parameterized Matching | 2018-10-30 | Paper |
| Round-optimal secure multi-party computation | 2018-09-26 | Paper |
| Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs | 2018-05-28 | Paper |
| Low cost constant round MPC combining BMR and oblivious transfer | 2018-04-06 | Paper |
| Actively secure garbled circuits with constant communication overhead in the plain model | 2018-01-19 | Paper |
| Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model | 2017-06-13 | Paper |
| Scalable Multi-party Private Set-Intersection | 2017-06-13 | Paper |
| On Compression of Data Encrypted With Block Ciphers | 2017-06-08 | Paper |
| Efficient one-sided adaptively secure computation | 2017-03-02 | Paper |
| Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity | 2016-12-21 | Paper |
| Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions | 2016-12-21 | Paper |
| Constant-Round Maliciously Secure Two-Party Computation in the RAM Model | 2016-12-21 | Paper |
| On the Power of Secure Two-Party Computation | 2016-10-27 | Paper |
| The Feasibility of Outsourced Database Search in the Plain Model | 2016-10-21 | Paper |
| What Security Can We Achieve Within 4 Rounds? | 2016-10-21 | Paper |
| Toward a game theoretic view of secure computation | 2016-10-13 | Paper |
| Leakage-resilient cryptography from minimal assumptions | 2016-09-21 | Paper |
| Selective Opening Security for Receivers | 2016-06-10 | Paper |
| Automata evaluation and text search protocols with simulation-based security | 2016-06-01 | Paper |
| Signature schemes secure against hard-to-invert leakage | 2016-06-01 | Paper |
| Efficient set intersection with simulation-based security | 2016-04-07 | Paper |
| On Black-Box Complexity of Universally Composable Security in the CRS Model | 2016-03-23 | Paper |
| Adaptively Secure Computation with Partial Erasures | 2016-03-23 | Paper |
| Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs | 2015-07-06 | Paper |
| Distributed public key schemes secure against continual leakage | 2014-12-05 | Paper |
| Computationally secure pattern matching in the presence of malicious adversaries | 2014-09-25 | Paper |
| One-Sided Adaptively Secure Two-Party Computation | 2014-02-18 | Paper |
| Complete Fairness in Secure Two-Party Computation | 2014-02-17 | Paper |
| Outsourced Pattern Matching | 2013-08-07 | Paper |
| Leakage-Resilient Cryptography from Minimal Assumptions | 2013-05-31 | Paper |
| Signature Schemes Secure against Hard-to-Invert Leakage | 2013-03-19 | Paper |
| Efficient set operations in the presence of malicious adversaries | 2012-07-10 | Paper |
| Secure Two-Party Computation with Low Communication | 2012-06-15 | Paper |
| Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting | 2012-06-08 | Paper |
| Towards a Game Theoretic View of Secure Computation | 2011-05-27 | Paper |
| Computationally Secure Pattern Matching in the Presence of Malicious Adversaries | 2010-12-07 | Paper |
| Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries | 2010-09-21 | Paper |
| Approximate parameterized matching | 2010-08-14 | Paper |
| Efficient secure two-party protocols. Techniques and constructions | 2010-08-03 | Paper |
| Efficient Set Operations in the Presence of Malicious Adversaries | 2010-05-28 | Paper |
| Text Search Protocols with Simulation Based Security | 2010-05-28 | Paper |
| Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries | 2008-03-05 | Paper |
| Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions | 2007-08-30 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
