Efficient asynchronous secure multiparty distributed computation

DOI10.1007/3-540-44495-5_11MaRDI QIDQ2707598zbMATH OpenFDO

Authors C. Pandu Rangan, Kannan Srinathan

Publication date 8 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44495-5_11

zbMATH Keywords

perfect asynchronous secure computations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Asynchronous Multiparty Computation: Theory and Implementation
• Asynchronous unconditionally secure computation: An efficiency improvement
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous perfectly secure computation tolerating generalized adversaries

Cited in

(25)

• Robust random number generation for peer-to-peer systems
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Secure multi-party computation in large networks
• Secure \(k\)-skyband computation framework in distributed multi-party databases
• MPC with synchronous security and asynchronous responsiveness
• On communication-efficient asynchronous MPC with adaptive security
• Efficient Asynchronous Accumulators for Distributed PKI
• Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous Multiparty Computation: Theory and Implementation
• Asynchronous perfectly secure computation tolerating generalized adversaries
• Asynchronous unconditionally secure computation: An efficiency improvement
• Communication Locality in Secure Multi-party Computation
• Multiparty Interactive Communication with Private Channels
• Batch secret sharing for secure multi-party computation in asynchronous network
• Network-agnostic security comes (almost) for free in DKG and MPC
• Secure message transmission in asynchronous networks
• Perfect asynchronous MPC with linear communication overhead
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Linear-communication asynchronous complete secret sharing with optimal resilience
• Fast and efficient perfectly secure network-agnostic secure computation
• Reducing communication costs in robust peer-to-peer networks

This page was built for publication: Efficient asynchronous secure multiparty distributed computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707598)