Asynchronous Multiparty Computation: Theory and Implementation

DOI10.1007/978-3-642-00468-1_10MaRDI QIDQ3617519zbMATH OpenOpenAlexFDO

Authors Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen, Ivan B. Damgård

Publication date 24 March 2009

Published in Public Key Cryptography – PKC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00468-1_10

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Simple and Efficient Perfectly-Secure Asynchronous MPC
• scientific article; zbMATH DE number 1583939
• scientific article; zbMATH DE number 1955785
• Asynchronous Multi-Party Computation with Quadratic Communication
• Secure multi-party computation in large networks

Cited in

(33)

• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• On multiparty garbling of arithmetic circuits
• Secure computation with low communication from cross-checking
• VIFF
• Efficient asynchronous verifiable secret sharing and multiparty computation
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Actively secure setup for SPDZ
• High throughput secure MPC over small population in hybrid networks (extended abstract)
• Synchronous consensus with optimal asynchronous fallback guarantees
• Secure multi-party computation in large networks
• Cryptographic algorithms for privacy-preserving online applications
• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• Asynchronous secure multiparty computation in constant time
• Linear overhead optimally-resilient robust MPC using preprocessing
• High-precision secure computation of satellite collision probabilities
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• Constant-round asynchronous multi-party computation based on one-way functions
• Secure outsourced computation
• Generic constant-round oblivious sorting algorithm for MPC
• Rate-limited secure function evaluation
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Asynchronous Multi-Party Computation with Quadratic Communication
• scientific article; zbMATH DE number 1950364 (Why is no real title available?)
• scientific article; zbMATH DE number 1955785 (Why is no real title available?)
• Rate-limited secure function evaluation: definitions and constructions
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Block cipher invariants as eigenvectors of correlation matrices
• Fast large-scale honest-majority MPC for malicious adversaries
• High-throughput secure three-party computation with an honest majority
• \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
• Computationally efficient asynchronous MPC with linear communication and low additive overhead
• Correction to: ``Actively secure setup for SPDZ
• Compilation of function representations for secure computing paradigms

This page was built for publication: Asynchronous Multiparty Computation: Theory and Implementation

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