| Publication | Date of Publication | Type |
|---|
| Perfect asynchronous MPC with linear communication overhead | 2024-11-13 | Paper |
| The round complexity of statistical MPC with optimal resiliency | 2024-05-08 | Paper |
| Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time | 2023-12-08 | Paper |
| Attaining GOD beyond honest majority with friends and foes | 2023-08-25 | Paper |
| Fully-secure MPC with minimal trust | 2023-08-14 | Paper |
| On perfectly secure two-party computation for symmetric functionalities with correlated randomness | 2023-08-14 | Paper |
| Asymptotically free broadcast in constant expected time via packed VSS | 2023-08-14 | Paper |
| Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) | 2023-08-14 | Paper |
| Beyond honest majority: the round complexity of fair and robust multi-party computation | 2023-07-26 | Paper |
| Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) | 2023-07-07 | Paper |
| Quadratic multiparty randomized encodings beyond honest majority and their applications | 2023-07-07 | Paper |
| MPClan: protocol suite for privacy-conscious computations | 2023-07-05 | Paper |
| On the communication efficiency of statistically secure asynchronous MPC with optimal resilience | 2023-04-13 | Paper |
| On the exact round complexity of best-of-both-worlds multi-party computation | 2023-03-29 | Paper |
| Three-round secure multiparty computation from black-box two-round oblivious transfer | 2022-04-22 | Paper |
| The resiliency of MPC with low interaction: the benefit of making errors (extended abstract) | 2022-03-23 | Paper |
| On the exact round complexity of secure three-party computation | 2021-09-10 | Paper |
| Optimal extension protocols for Byzantine broadcast and agreement | 2021-03-12 | Paper |
| The power of shunning: efficient asynchronous Byzantine agreement revisited | 2020-11-11 | Paper |
| Beyond honest majority: the round complexity of fair and robust multi-party computation | 2020-05-20 | 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 |
| On the exact round complexity of secure three-party computation | 2018-09-26 | Paper |
| On the Power of Hybrid Networks in Multi-Party Computation | 2018-09-14 | Paper |
| Efficient adaptively secure zero-knowledge from garbled circuits | 2018-05-29 | Paper |
| Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network | 2018-03-16 | Paper |
| Privacy-free garbled circuits for formulas: size zero and information-theoretic | 2017-11-03 | Paper |
| Broadcast Extensions with Optimal Communication and Round Complexity | 2017-09-29 | Paper |
| An Efficient Framework for Unconditionally Secure Multiparty Computation | 2017-05-02 | Paper |
| Efficient one-sided adaptively secure computation | 2017-03-02 | Paper |
| Linear overhead optimally-resilient robust MPC using preprocessing | 2016-10-21 | Paper |
| Selective Opening Security for Receivers | 2016-06-10 | Paper |
| Adaptively secure computation with partial erasures | 2016-03-23 | Paper |
| Anonymous authentication with shared secrets | 2015-09-17 | Paper |
| Efficient asynchronous verifiable secret sharing and multiparty computation | 2015-03-25 | Paper |
| Brief announcement: communication efficient asynchronous Byzantine agreement | 2015-03-02 | 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: Efficient optimally resilient statistical AVSS and its applications | 2014-12-05 | Paper |
| Reducing the Overhead of MPC over a Large Population | 2014-10-14 | Paper |
| Key-indistinguishable message authentication codes | 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 |
| One-Sided Adaptively Secure Two-Party Computation | 2014-02-18 | Paper |
| On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission | 2014-02-17 | 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 |
| Computational verifiable secret sharing revisited | 2011-12-02 | 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 |
| Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience | 2011-05-19 | 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 |
| The round complexity of verifiable secret sharing: the statistical case | 2010-12-07 | 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 optimal multi-valued asynchronous broadcast protocol | 2010-08-31 | 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 |
| Indoor versus outdoor scene classification using probabilistic neural network | 2009-09-01 | 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 |
| Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry | 2008-05-09 | Paper |
| Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary | 2008-04-15 | Paper |
| Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission | 2008-04-11 | Paper |
| Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality | 2008-04-11 | Paper |
