| Publication | Date of Publication | Type |
|---|
| An improved threshold homomorphic cryptosystem based on class groups | 2025-01-10 | Paper |
| Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model) | 2024-12-27 | Paper |
| MPC with low bottleneck-complexity: information-theoretic security and more | 2024-11-22 | Paper |
| Secure multiparty computation from threshold encryption based on class groups | 2024-02-02 | Paper |
| Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions | 2024-02-02 | Paper |
| Witness-succinct universally-composable SNARKs | 2023-12-08 | Paper |
| Structure-preserving compilers from new notions of obfuscations | 2023-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059364 | 2023-11-02 | Paper |
| Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers | 2023-07-25 | Paper |
| On access control encryption without sanitization | 2023-07-25 | Paper |
| An algebraic framework for silent preprocessing with trustless setup and active security | 2023-07-07 | Paper |
| Black-box transformations from passive to covert security with public verifiability | 2022-11-09 | Paper |
| Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) | 2022-08-30 | Paper |
| On the Bottleneck Complexity of MPC with Correlated Randomness | 2022-07-08 | Paper |
| ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines | 2022-07-08 | Paper |
| Stronger notions and a more efficient construction of threshold ring signatures | 2022-06-15 | Paper |
| Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms | 2022-06-15 | Paper |
| Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices | 2022-04-21 | Paper |
| Stronger security and constructions of multi-designated verifier signatures | 2022-03-23 | Paper |
| Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices | 2021-12-21 | Paper |
| Balancing privacy and accountability in blockchain identity management | 2021-12-20 | Paper |
| The rise of Paillier: homomorphic secret sharing and public-key silent OT | 2021-12-08 | Paper |
| Security of hedged Fiat-Shamir signatures under fault attacks | 2021-12-01 | Paper |
| High-performance multi-party computation for binary circuits based on oblivious transfer | 2021-08-10 | Paper |
| Quisquis: a new design for anonymous cryptocurrencies | 2020-05-20 | Paper |
| Proofs of replicated storage without timing assumptions | 2020-05-20 | Paper |
| Sharing information with competitors | 2020-02-04 | Paper |
| Combining private set intersection with secure two-party computation | 2018-10-17 | Paper |
| Yet another compiler for active security or: efficient MPC over arbitrary rings | 2018-09-26 | Paper |
| Revealing encryption for partial ordering | 2018-04-20 | Paper |
| Access Control Encryption for Equality, Comparison, and More | 2017-06-13 | Paper |
| Access Control Encryption: Enforcing Information Flow with Cryptography | 2016-12-22 | Paper |
| Cross and Clean: Amortized Garbled Circuits with Constant Overhead | 2016-12-21 | Paper |
| Non-Interactive Verifiable Secret Sharing for Monotone Circuits | 2016-06-22 | Paper |
| How to bootstrap anonymous communication | 2016-04-15 | Paper |
| Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge | 2015-09-30 | Paper |
| The Simplest Protocol for Oblivious Transfer | 2015-09-17 | Paper |
| Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security) | 2014-10-14 | Paper |
| Publicly Auditable Secure Multi-Party Computation | 2014-10-14 | Paper |
| Statistical Concurrent Non-malleable Zero Knowledge | 2014-02-18 | Paper |
| Hiding the Input-Size in Secure Two-Party Computation | 2013-12-10 | Paper |
| MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions | 2013-05-31 | Paper |
| Calling Out Cheaters: Covert Security with Public Verifiability | 2013-03-19 | Paper |
| On the Power of Correlated Randomness in Secure Computation | 2013-03-18 | Paper |
| A New Approach to Practical Active-Secure Two-Party Computation | 2012-09-25 | Paper |
| Lower and Upper Bounds for Deniable Public-Key Encryption | 2011-12-02 | Paper |
| Semi-homomorphic Encryption and Multiparty Computation | 2011-05-27 | Paper |
| On Invertible Sampling and Adaptive Security | 2010-12-07 | Paper |
| Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost | 2010-08-24 | Paper |
| On the Necessary and Sufficient Assumptions for UC Computation | 2010-02-24 | Paper |
| LEGO for Two-Party Secure Computation | 2009-03-03 | Paper |
