| 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
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
Theoretical Computer Science | 2024-03-28 | Paper |
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 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
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
Journal of Cryptology | 2023-07-05 | Paper |
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
Journal of Cryptology | 2023-04-13 | Paper |
| Perfectly-secure asynchronous MPC for general adversaries (extended abstract) | 2022-07-06 | Paper |
| High throughput secure MPC over small population in hybrid networks (extended abstract) | 2022-07-06 | Paper |
| Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation | 2022-07-06 | Paper |
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
The power of shunning: efficient asynchronous Byzantine agreement revisited
Journal of the ACM | 2020-11-11 | Paper |
Almost-surely terminating asynchronous Byzantine agreement revisited
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Brief announcement: Asynchronous secure distributed computing with transferrable non-equivocation revisited
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 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
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
Linear overhead optimally-resilient robust MPC using preprocessing
Lecture Notes in Computer Science | 2016-10-21 | Paper |
The effect of population contexts on classifier performance
Journal of Biological Systems | 2016-01-22 | Paper |
Asynchronous MPC with a strict honest majority using non-equivocation
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Efficient asynchronous verifiable secret sharing and multiparty computation
Journal of Cryptology | 2015-03-25 | Paper |
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Efficient single phase unconditionally secure message transmission with optimum communication complexity
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Brief announcement: Efficient optimally resilient statistical AVSS and its applications
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Brief announcement: Optimal amortized secret sharing with cheater identification
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Reducing the Overhead of MPC over a Large Population
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Simple and efficient asynchronous Byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Asynchronous Byzantine agreement with optimal resilience
Distributed Computing | 2014-07-11 | Paper |
Constant phase efficient protocols for secure message transmission in directed networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
Journal of the ACM | 2014-02-17 | Paper |
Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
Lecture Notes in Computer Science | 2014-01-14 | Paper |
Between a rock and a hard place: interpolating between MPC and FHE
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
On the communication complexity of reliable and secure message transmission in asynchronous networks
Information Security and Cryptology - ICISC 2011 | 2012-11-01 | Paper |
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing | 2011-08-19 | Paper |
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
Applied Cryptography and Network Security | 2011-06-28 | Paper |
The round complexity of perfectly secure general VSS
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
International Journal of Applied Cryptography | 2011-04-05 | Paper |
| Modeling and control in cancer genomics | 2011-01-03 | Paper |
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Information Security and Cryptology | 2010-11-23 | Paper |
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings | 2010-05-04 | Paper |
Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
Progress in Cryptology - INDOCRYPT 2009 | 2009-12-17 | Paper |
Information Theoretically Secure Multi Party Set Intersection Re-visited
Selected Areas in Cryptography | 2009-12-09 | Paper |
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
Cryptology and Network Security | 2009-11-26 | Paper |
The Round Complexity of Verifiable Secret Sharing Revisited
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules
International Journal of Computer Mathematics | 2009-06-02 | Paper |
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography | 2009-05-12 | Paper |
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
Distributed Computing and Networking | 2009-03-26 | Paper |
Round Efficient Unconditionally Secure Multiparty Computation Protocol
Progress in Cryptology - INDOCRYPT 2008 | 2009-01-22 | Paper |
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
Information Security and Privacy | 2008-07-08 | Paper |
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Cryptology and Network Security | 2008-04-15 | Paper |
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
Progress in Cryptology - INDOCRYPT 2006 | 2008-04-11 | Paper |
Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
Lecture Notes in Computer Science | 2008-04-11 | Paper |
Returning and non-returning parallel communicating finite automata are equivalent
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
Returning and non-returning parallel communicating finite automata are equivalent
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
Returning and non-returning parallel communicating finite automata are equivalent
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
| Network of evolutionary processors, past, present and future | 2007-12-11 | Paper |
External control in Markovian genetic regulatory networks
Machine Learning | 2003-08-20 | Paper |
