| Publication | Date of Publication | Type |
|---|
| Secure multiparty computation with identifiable abort via vindicating release | 2024-12-13 | Paper |
| Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited | 2024-08-15 | Paper |
| Locally verifiable distributed SNARGs | 2024-08-01 | Paper |
| Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW | 2024-06-25 | Paper |
Breaking the O(√ n)-Bit Barrier
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Completeness theorems for adaptively secure broadcast
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
Journal of Cryptology | 2023-11-21 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions
Journal of Cryptology | 2023-10-25 | Paper |
On the power of an honest majority in three-party computation without broadcast
Journal of Cryptology | 2023-07-26 | Paper |
Must the communication graph of MPC protocols be an expander?
Journal of Cryptology | 2023-07-05 | Paper |
Adaptively secure MPC with sublinear communication complexity
Journal of Cryptology | 2023-04-13 | Paper |
| On the round complexity of randomized Byzantine agreement | 2023-02-03 | 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 |
On the round complexity of randomized Byzantine agreement
Journal of Cryptology | 2022-04-04 | Paper |
On the round complexity of randomized Byzantine agreement
Journal of Cryptology | 2022-04-04 | Paper |
Multiparty generation of an RSA modulus
Journal of Cryptology | 2022-04-04 | Paper |
| Broadcast-optimal two-round MPC | 2022-03-23 | Paper |
| Topology-hiding communication from minimal assumptions | 2022-03-23 | Paper |
| On the power of an honest majority in three-party computation without broadcast | 2022-03-23 | Paper |
From fairness to full security in multiparty computation
Journal of Cryptology | 2022-01-06 | Paper |
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
Journal of Cryptology | 2021-06-28 | Paper |
| Must the communication graph of MPC protocols be an expander? | 2020-06-30 | Paper |
| Round-preserving parallel composition of probabilistic-termination cryptographic protocols | 2020-05-27 | Paper |
| Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
Adaptively secure MPC with sublinear communication complexity
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
Probabilistic termination and composability of cryptographic protocols
Journal of Cryptology | 2019-08-13 | Paper |
From fairness to full security in multiparty computation
Lecture Notes in Computer Science | 2018-10-17 | Paper |
Characterization of secure multiparty computation without broadcast
Journal of Cryptology | 2018-05-28 | Paper |
Fairness versus guaranteed output delivery in secure multiparty computation
Journal of Cryptology | 2018-02-15 | Paper |
Probabilistic Termination and Composability of Cryptographic Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
On Adaptively Secure Multiparty Computation with a Short CRS
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Asynchronous secure multiparty computation in constant time
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Characterization of secure multiparty computation without broadcast
Theory of Cryptography | 2016-03-23 | Paper |
Fairness versus guaranteed output delivery in secure multiparty computation
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Group Law Algorithms for Jacobian Varieties of Curves over Finite Fields
Algebraic Geometry and Its Applications | 2008-12-10 | Paper |
