| Publication | Date of Publication | Type |
|---|
| Network-agnostic multi-party computation revisited (extended abstract) | 2024-11-12 | Paper |
| Network-agnostic perfectly secure message transmission revisited | 2024-10-23 | Paper |
| Network agnostic MPC with statistical security | 2024-08-02 | Paper |
| Perfectly-secure synchronous MPC with asynchronous fallback guarantees | 2024-07-18 | Paper |
| Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience | 2024-03-28 | Paper |
| Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees | 2024-03-26 | Paper |
| Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited | 2023-11-02 | Paper |
| Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries | 2023-08-14 | Paper |
| Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries | 2023-07-05 | Paper |
| On the communication efficiency of statistically secure asynchronous MPC with optimal resilience | 2023-04-13 | Paper |
| Perfectly-secure asynchronous MPC for general adversaries (extended abstract) | 2022-07-06 | Paper |
| Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation | 2022-07-06 | Paper |
| High throughput secure MPC over small population in hybrid networks (extended abstract) | 2022-07-06 | Paper |
| Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time | 2021-03-15 | Paper |
| The Power of Shunning | 2020-11-11 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited | 2019-09-19 | Paper |
| Crash-tolerant consensus in directed graph revisited (extended abstract) | 2019-01-30 | Paper |
| Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network | 2018-03-16 | Paper |
| An Efficient Framework for Unconditionally Secure Multiparty Computation | 2017-05-02 | Paper |
| Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing | 2016-10-21 | Paper |
| THE EFFECT OF POPULATION CONTEXTS ON CLASSIFIER PERFORMANCE | 2016-01-22 | Paper |
| Asynchronous MPC with a strict honest majority using non-equivocation | 2015-09-03 | Paper |
| Efficient asynchronous verifiable secret sharing and multiparty computation | 2015-03-25 | Paper |
| On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary | 2014-12-12 | Paper |
| Efficient single phase unconditionally secure message transmission with optimum communication complexity | 2014-12-12 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Reducing the Overhead of MPC over a Large Population | 2014-10-14 | Paper |
| Simple and efficient asynchronous byzantine agreement with optimal resilience | 2014-07-23 | Paper |
| Asynchronous Byzantine agreement with optimal resilience | 2014-07-11 | Paper |
| Constant phase efficient protocols for secure message transmission in directed networks | 2014-03-13 | Paper |
| On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission | 2014-02-17 | Paper |
| Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation | 2014-01-14 | Paper |
| Between a Rock and a Hard Place: Interpolating between MPC and FHE | 2013-12-10 | Paper |
| On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks | 2012-11-01 | Paper |
| Secure message transmission in asynchronous networks | 2011-08-19 | Paper |
| Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary | 2011-06-28 | Paper |
| The Round Complexity of Perfectly Secure General VSS | 2011-05-19 | Paper |
| Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality | 2011-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3062141 | 2011-01-03 | Paper |
| Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience | 2010-11-23 | Paper |
| Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience | 2010-09-29 | Paper |
| Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience | 2010-05-04 | Paper |
| Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience | 2009-12-17 | Paper |
| Information Theoretically Secure Multi Party Set Intersection Re-visited | 2009-12-09 | Paper |
| Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security | 2009-11-26 | Paper |
| The Round Complexity of Verifiable Secret Sharing Revisited | 2009-10-20 | Paper |
| Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules | 2009-06-02 | Paper |
| Perfectly reliable and secure message transmission tolerating mobile adversary | 2009-05-12 | Paper |
| On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks | 2009-03-26 | Paper |
| Round Efficient Unconditionally Secure Multiparty Computation Protocol | 2009-01-22 | Paper |
| Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary | 2009-01-09 | Paper |
| Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited | 2008-11-20 | Paper |
| Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary | 2008-09-02 | Paper |
| Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary | 2008-07-08 | Paper |
| Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary | 2008-04-15 | Paper |
| Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality | 2008-04-11 | Paper |
| Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission | 2008-04-11 | Paper |
| Returning and non-returning parallel communicating finite automata are equivalent | 2008-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431554 | 2007-12-11 | Paper |
| External control in Markovian genetic regulatory networks | 2003-08-20 | Paper |
