| Publication | Date of Publication | Type |
|---|
| How to recover a secret with \(O(n)\) additions | 2024-02-02 | Paper |
| Oblivious key-value stores and amplification for private set intersection | 2022-04-22 | Paper |
| PSI from PaXoS: fast, malicious private set intersection | 2022-03-23 | Paper |
| SpOT-light: lightweight private set intersection from sparse OT extension | 2020-03-09 | Paper |
| Efficient circuit-based PSI with linear communication | 2020-02-04 | Paper |
| Efficient constant-round multi-party computation combining BMR and SPDZ | 2019-08-13 | Paper |
| Efficient scalable multiparty private set-intersection via garbled Bloom filters | 2018-10-17 | Paper |
| Fast distributed RSA key generation for semi-honest and malicious adversaries | 2018-09-26 | Paper |
| Fast garbling of circuits under standard assumptions | 2018-09-14 | Paper |
| Distributed SSH key management with proactive RSA threshold signatures | 2018-08-10 | Paper |
| Efficient circuit-based PSI via cuckoo hashing | 2018-07-17 | Paper |
| Committed MPC -- maliciously secure multiparty computation from homomorphic commitments | 2018-05-16 | Paper |
| Asymptotically Tight Bounds for Composing ORAM with PIR | 2017-06-13 | Paper |
| Oblivious transfer and polynomial evaluation | 2016-09-29 | Paper |
| Efficient set intersection with simulation-based security | 2016-04-07 | Paper |
| Efficient Constant Round Multi-party Computation Combining BMR and SPDZ | 2015-12-10 | Paper |
| An efficient protocol for secure two-party computation in the presence of malicious adversaries | 2015-05-12 | Paper |
| Non-Interactive Secure Computation Based on Cut-and-Choose | 2014-05-27 | Paper |
| Secure computation of functionalities based on Hamming distance and its application to computing document similarity | 2013-11-15 | Paper |
| Secure two-party computation via cut-and-choose oblivious transfer | 2013-01-04 | Paper |
| Secure Computation on the Web: Computing without Simultaneous Interaction | 2011-08-12 | Paper |
| The IPS Compiler: Optimizations, Variants and Concrete Efficiency | 2011-08-12 | Paper |
| Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer | 2011-05-19 | Paper |
| Secure Set Intersection with Untrusted Hardware Tokens | 2011-02-11 | Paper |
| Secure computation of the median (and other elements of specified ranks) | 2010-09-21 | Paper |
| Oblivious RAM Revisited | 2010-08-24 | Paper |
| Privacy-Preserving Group Discovery with Linear Complexity | 2010-07-06 | Paper |
| The Design and Implementation of Protocol-Based Hidden Key Recovery | 2010-02-09 | Paper |
| Secure Two-Party Computation Is Practical | 2009-12-15 | Paper |
| Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles | 2009-08-06 | Paper |
| A proof of security of Yao's protocol for two-party computation | 2009-05-08 | Paper |
| Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries | 2008-11-20 | Paper |
| An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries | 2007-11-29 | Paper |
| Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles | 2007-11-15 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Oblivious Polynomial Evaluation | 2006-06-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Computationally secure oblivious transfer | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738937 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434870 | 2003-11-26 | Paper |
| Privacy preserving data mining | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536284 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768332 | 2002-09-01 | Paper |
| Tracing traitors | 2002-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536793 | 2002-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707416 | 2001-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941880 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249667 | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249354 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250771 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364561 | 1997-11-17 | Paper |
| On the Impossibility of Private Key Cryptography with Weakly Random Keys | 1994-02-17 | Paper |
