| Publication | Date of Publication | Type |
|---|
Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
Journal of Cryptology | 2025-02-28 | Paper |
| Secure multiparty computation with identifiable abort via vindicating release | 2024-12-13 | Paper |
Improved straight-line extraction in the random oracle model with applications to signature aggregation
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Adaptively secure MPC with sublinear communication complexity
Journal of Cryptology | 2023-04-13 | Paper |
Multiparty generation of an RSA modulus
Advances in Cryptology – CRYPTO 2020 | 2022-12-07 | Paper |
| Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols | 2022-08-30 | Paper |
Multiparty generation of an RSA modulus
Journal of Cryptology | 2022-04-04 | Paper |
| Going beyond dual execution: MPC for functions with efficient verification | 2021-12-01 | Paper |
| Minimizing trust in hardware wallets with two factor signatures | 2021-03-17 | Paper |
Adaptively secure MPC with sublinear communication complexity
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
Socially optimal mining pools
Web and Internet Economics | 2019-01-30 | Paper |
| Multi-key searchable encryption, revisited | 2018-05-16 | Paper |
Analysis of the Blockchain Protocol in Asynchronous Networks
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Bounded KDM security from iO and OWF
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Secure computation from millionaire
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Impossibility of VBB obfuscation with ideal constant-degree graded encodings
Theory of Cryptography | 2016-03-23 | Paper |
Lower bounds on assumptions behind indistinguishability obfuscation
Theory of Cryptography | 2016-03-23 | Paper |
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Computing on authenticated data
Journal of Cryptology | 2015-05-12 | Paper |
Bit Encryption Is Complete
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Efficient fork-linearizable access to untrusted shared memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
Theory of Cryptography | 2013-03-18 | Paper |
Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Computing on Authenticated Data
Theory of Cryptography | 2012-06-15 | Paper |
Securely obfuscating re-encryption
Journal of Cryptology | 2012-01-13 | Paper |
Two-output secure computation with malicious adversaries
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Optimistic concurrent zero knowledge
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Collusion-free protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Approximating the smallest grammar
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Collusion-Free Multiparty Computation in the Mediated Model
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Purely Rational Secret Sharing (Extended Abstract)
Theory of Cryptography | 2009-03-03 | Paper |
Efficient Protocols for Set Membership and Range Proofs
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Collusion-Free Protocols in the Mediated Model
Lecture Notes in Computer Science | 2009-02-10 | Paper |
The Smallest Grammar Problem
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounded CCA2-Secure Encryption
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Relations Among Notions of Non-malleability for Encryption
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Unconditional Characterizations of Non-interactive Zero-Knowledge
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Simulatable Adaptive Oblivious Transfer
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Securely Obfuscating Re-encryption
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2119662 (Why is no real title available?) | 2004-11-29 | Paper |
