| 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) Journal of Cryptology | 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 Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Witness-succinct universally-composable SNARKs Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Structure-preserving compilers from new notions of obfuscations Lecture Notes in Computer Science | 2023-11-16 | Paper |
| scientific article; zbMATH DE number 7759457 (Why is no real title available?) | 2023-11-02 | Paper |
Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers Lecture Notes in Computer Science | 2023-07-25 | Paper |
On access control encryption without sanitization Lecture Notes in Computer Science | 2023-07-25 | Paper |
An algebraic framework for silent preprocessing with trustless setup and active security Advances in Cryptology – CRYPTO 2022 | 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 Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines Public-Key Cryptography – PKC 2022 | 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 Journal of Cryptology | 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 Public-Key Cryptography – PKC 2021 | 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 Journal of Cryptology | 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 (available as arXiv preprint) | 2020-02-04 | 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 Lecture Notes in Computer Science | 2017-06-13 | Paper |
Access control encryption: enforcing information flow with cryptography Theory of Cryptography | 2016-12-22 | Paper |
Cross and clean: amortized garbled circuits with constant overhead Theory of Cryptography | 2016-12-21 | Paper |
Non-interactive verifiable secret sharing for monotone circuits Progress in Cryptology – AFRICACRYPT 2016 | 2016-06-22 | Paper |
How to bootstrap anonymous communication Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Privacy-free garbled circuits with applications to efficient zero-knowledge Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
The simplest protocol for oblivious transfer Progress in Cryptology -- LATINCRYPT 2015 | 2015-09-17 | Paper |
Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security) Lecture Notes in Computer Science | 2014-10-14 | Paper |
Publicly auditable secure multi-party computation Lecture Notes in Computer Science | 2014-10-14 | Paper |
Statistical concurrent non-malleable zero knowledge Theory of Cryptography | 2014-02-18 | Paper |
Hiding the input-size in secure two-party computation Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | 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 |
Calling out cheaters: covert security with public verifiability Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
On the power of correlated randomness in secure computation Theory of Cryptography | 2013-03-18 | Paper |
A new approach to practical active-secure two-party computation 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 |
Semi-homomorphic encryption and multiparty computation Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
On Invertible Sampling and Adaptive Security Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Multiparty computation for dishonest majority: from passive to active security at low cost 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 |
LEGO for Two-Party Secure Computation Theory of Cryptography | 2009-03-03 | Paper |