Ashish Choudhury

From MaRDI portal
Person:635381

Available identifiers

zbMath Open choudhary.ashishMaRDI QIDQ635381

List of research outcomes

PublicationDate of PublicationType
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience2024-03-28Paper
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees2024-03-26Paper
Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries2023-08-14Paper
Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries2023-07-05Paper
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience2023-04-13Paper
Perfectly-secure asynchronous MPC for general adversaries (extended abstract)2022-07-06Paper
Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation2022-07-06Paper
High throughput secure MPC over small population in hybrid networks (extended abstract)2022-07-06Paper
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time2021-03-15Paper
The Power of Shunning2020-11-11Paper
Brief Announcement2019-09-19Paper
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited2019-09-19Paper
Crash-tolerant consensus in directed graph revisited (extended abstract)2019-01-30Paper
Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network2018-03-16Paper
An Efficient Framework for Unconditionally Secure Multiparty Computation2017-05-02Paper
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing2016-10-21Paper
THE EFFECT OF POPULATION CONTEXTS ON CLASSIFIER PERFORMANCE2016-01-22Paper
Asynchronous MPC with a strict honest majority using non-equivocation2015-09-03Paper
Efficient asynchronous verifiable secret sharing and multiparty computation2015-03-25Paper
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary2014-12-12Paper
Efficient single phase unconditionally secure message transmission with optimum communication complexity2014-12-12Paper
Brief announcement2014-12-05Paper
Brief announcement2014-12-05Paper
Reducing the Overhead of MPC over a Large Population2014-10-14Paper
Simple and efficient asynchronous byzantine agreement with optimal resilience2014-07-23Paper
Asynchronous Byzantine agreement with optimal resilience2014-07-11Paper
Constant phase efficient protocols for secure message transmission in directed networks2014-03-13Paper
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission2014-02-17Paper
Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation2014-01-14Paper
Between a Rock and a Hard Place: Interpolating between MPC and FHE2013-12-10Paper
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks2012-11-01Paper
Secure message transmission in asynchronous networks2011-08-19Paper
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary2011-06-28Paper
The Round Complexity of Perfectly Secure General VSS2011-05-19Paper
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality2011-04-05Paper
https://portal.mardi4nfdi.de/entity/Q30621412011-01-03Paper
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience2010-11-23Paper
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience2010-09-29Paper
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience2010-05-04Paper
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience2009-12-17Paper
Information Theoretically Secure Multi Party Set Intersection Re-visited2009-12-09Paper
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security2009-11-26Paper
The Round Complexity of Verifiable Secret Sharing Revisited2009-10-20Paper
Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules2009-06-02Paper
Perfectly reliable and secure message transmission tolerating mobile adversary2009-05-12Paper
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks2009-03-26Paper
Round Efficient Unconditionally Secure Multiparty Computation Protocol2009-01-22Paper
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary2009-01-09Paper
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited2008-11-20Paper
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary2008-09-02Paper
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary2008-07-08Paper
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary2008-04-15Paper
Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality2008-04-11Paper
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission2008-04-11Paper
Returning and non-returning parallel communicating finite automata are equivalent2008-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54315542007-12-11Paper
External control in Markovian genetic regulatory networks2003-08-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ashish Choudhury