Asynchronous Multiparty Computation: Theory and Implementation

DOI10.1007/978-3-642-00468-1_10zbMath1227.68014MaRDI QIDQ3617519

Martin Geisler, Jesper Buus Nielsen, Mikkel Krøigaard, 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

94A60: Cryptography

68M12: Network protocols

94A62: Authentication, digital signatures and secret sharing

Related Items

Rate-Limited Secure Function Evaluation: Definitions and Constructions, 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, VIFF, Rate-limited secure function evaluation, Compilation of function representations for secure computing paradigms, 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, 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, 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, Secure Outsourced Computation, Generic Constant-Round Oblivious Sorting Algorithm for MPC