| Publication | Date of Publication | Type |
|---|
Asymptotically free broadcast in constant expected time via packed VSS
Journal of Cryptology | 2025-10-23 | Paper |
| 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
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Attaining GOD beyond honest majority with friends and foes
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Fully-secure MPC with minimal trust
Theory of Cryptography | 2023-08-14 | Paper |
On perfectly secure two-party computation for symmetric functionalities with correlated randomness
Theory of Cryptography | 2023-08-14 | Paper |
Asymptotically free broadcast in constant expected time via packed VSS
Theory of Cryptography | 2023-08-14 | Paper |
Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
Theory of Cryptography | 2023-08-14 | Paper |
Beyond honest majority: the round complexity of fair and robust multi-party computation
Journal of Cryptology | 2023-07-26 | Paper |
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Quadratic multiparty randomized encodings beyond honest majority and their applications
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
MPClan: protocol suite for privacy-conscious computations
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 |
| 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
Journal of Cryptology | 2021-09-10 | Paper |
Optimal extension protocols for Byzantine broadcast and agreement
Distributed Computing | 2021-03-12 | Paper |
The power of shunning: efficient asynchronous Byzantine agreement revisited
Journal of the ACM | 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
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 |
On the exact round complexity of secure three-party computation
Lecture Notes in Computer Science | 2018-09-26 | Paper |
On the Power of Hybrid Networks in Multi-Party Computation
IEEE Transactions on Information Theory | 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
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
An Efficient Framework for Unconditionally Secure Multiparty Computation
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
Efficient one-sided adaptively secure computation
Journal of Cryptology | 2017-03-02 | Paper |
Linear overhead optimally-resilient robust MPC using preprocessing
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Selective Opening Security for Receivers
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Adaptively secure computation with partial erasures
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Anonymous authentication with shared secrets
Progress in Cryptology - LATINCRYPT 2014 | 2015-09-17 | Paper |
Efficient asynchronous verifiable secret sharing and multiparty computation
Journal of Cryptology | 2015-03-25 | Paper |
Brief announcement: communication efficient asynchronous Byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | 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 |
Reducing the Overhead of MPC over a Large Population
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Key-indistinguishable message authentication codes
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 |
One-Sided Adaptively Secure Two-Party Computation
Theory of Cryptography | 2014-02-18 | 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 |
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 |
Computational verifiable secret sharing revisited
Lecture Notes in Computer Science | 2011-12-02 | 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 |
Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
Lecture Notes in Computer Science | 2011-05-19 | 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 |
The round complexity of verifiable secret sharing: the statistical case
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | 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 optimal multi-valued asynchronous broadcast protocol
Lecture Notes in Computer Science | 2010-08-31 | 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 |
Indoor versus outdoor scene classification using probabilistic neural network
EURASIP Journal on Advances in Signal Processing | 2009-09-01 | 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 |
Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry
Pattern Recognition | 2008-05-09 | 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 |
