Asynchronous Multiparty Computation: Theory and Implementation

DOI10.1007/978-3-642-00468-1_10zbMath1227.68014OpenAlexW2099221302MaRDI 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

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

Related Items

Compilation of function representations for secure computing paradigms, Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces, Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, Rate-limited secure function evaluation, High throughput secure MPC over small population in hybrid networks (extended abstract), Secure multi-party computation in large networks, Synchronous consensus with optimal asynchronous fallback guarantees, Cryptographic algorithms for privacy-preserving online applications, High-throughput secure three-party computation with an honest majority, \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions, On multiparty garbling of arithmetic circuits, Secure computation with low communication from cross-checking, Fast large-scale honest-majority MPC for malicious adversaries, Secure Outsourced Computation, Rate-Limited Secure Function Evaluation: Definitions and Constructions, Efficient asynchronous verifiable secret sharing and multiparty computation, Block cipher invariants as eigenvectors of correlation matrices, High-performance multi-party computation for binary circuits based on oblivious transfer, VIFF, Generic Constant-Round Oblivious Sorting Algorithm for MPC, Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing, High-Precision Secure Computation of Satellite Collision Probabilities, Actively secure setup for SPDZ