| Publication | Date of Publication | Type |
|---|
| SPRINT: high-throughput robust distributed Schnorr signatures | 2024-11-13 | Paper |
| Proactive secret sharing with constant communication | 2024-08-02 | Paper |
Additive randomized encodings and their applications
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
| YOSO: You only speak once. Secure MPC with stateless ephemeral roles | 2022-04-22 | Paper |
| Can a public blockchain keep a secret? | 2021-12-01 | Paper |
On the local leakage resilience of linear secret sharing schemes
Journal of Cryptology | 2021-06-28 | Paper |
| On fully secure MPC with solitary output | 2020-04-30 | Paper |
Efficient RSA key generation and threshold Paillier in the two-party setting
Journal of Cryptology | 2019-06-20 | Paper |
| Best possible information-theoretic MPC | 2018-12-06 | Paper |
On the local leakage resilience of linear secret sharing schemes
Lecture Notes in Computer Science | 2018-09-12 | Paper |
| Secure two-party computation with fairness -- a necessary design principle | 2018-01-19 | Paper |
| Robust non-interactive multiparty computation against constant-size collusion | 2017-11-03 | Paper |
Asynchronous secure computations with optimal resilience (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
On Compression of Data Encrypted With Block Ciphers
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Secure multiparty computation with general interaction patterns
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
On the composition of authenticated Byzantine Agreement
Journal of the ACM | 2015-12-04 | Paper |
Robust and efficient sharing of RSA functions
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Fast asynchronous Byzantine agreement with optimal resilience
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
The round complexity of verifiable secret sharing and secure multicast
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Protecting circuits from computationally bounded and noisy leakage
SIAM Journal on Computing | 2015-02-09 | Paper |
Information-theoretically secure protocols and security under composition
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Robust threshold DSS signatures
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Sequential composition of protocols without simultaneous termination
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
A full characterization of functions that imply fair coin tossing and ramifications to fairness
Theory of Cryptography | 2013-03-18 | Paper |
Efficient RSA key generation and threshold Paillier in the two-party setting
Lecture Notes in Computer Science | 2012-06-08 | Paper |
Secure computation without authentication
Journal of Cryptology | 2012-01-13 | Paper |
Perfectly-secure multiplication for any \(t < n/3\)
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Security for signcryption: the two-user model
Practical Signcryption | 2011-05-18 | Paper |
Information-theoretically secure protocols and security under composition
SIAM Journal on Computing | 2010-11-04 | Paper |
On the composition of authenticated byzantine agreement
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
Applied Cryptography and Network Security | 2010-07-06 | Paper |
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Secure network coding over the integers
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
The Round Complexity of Verifiable Secret Sharing Revisited
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
| Cryptography and game theory | 2008-09-12 | Paper |
Threshold RSA for Dynamic and Ad-Hoc Groups
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Secure Computation Without Authentication
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Degradation and Amplification of Computational Hardness
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Secure distributed key generation for discrete-log based cryptosystems
Journal of Cryptology | 2007-05-24 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2086700 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1962164 (Why is no real title available?) | 2003-08-10 | Paper |
| scientific article; zbMATH DE number 1942420 (Why is no real title available?) | 2003-06-30 | Paper |
Robust threshold DSS signatures
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1617921 (Why is no real title available?) | 2002-10-28 | Paper |
| scientific article; zbMATH DE number 1759774 (Why is no real title available?) | 2002-07-28 | Paper |
RSA-based undeniable signatures
Journal of Cryptology | 2000-12-21 | Paper |
Secure distributed storage and retrieval
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1418290 (Why is no real title available?) | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1304079 (Why is no real title available?) | 2000-03-07 | Paper |
Robust and efficient sharing of RSA functions.
Journal of Cryptology | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1302840 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1304080 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303126 (Why is no real title available?) | 1999-06-17 | Paper |
Secure Hash-and-Sign Signatures Without the Random Oracle
Advances in Cryptology — EUROCRYPT ’99 | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1088231 (Why is no real title available?) | 1998-05-12 | Paper |
| scientific article; zbMATH DE number 503254 (Why is no real title available?) | 1994-09-20 | Paper |
