Secure Multiparty Computation Goes Live

DOI10.1007/978-3-642-03549-4_20zbMath1417.94045OpenAlexW1595357546MaRDI QIDQ3655178

Kurt Nielsen, Janus Dam Nielsen, Peter Bogetoft, Jakob Illeborg Pagter, Jesper Buus Nielsen, Martin Geisler, Dan Lund Christensen, Tomas Toft, Mikkel Krøigaard, Ivan B. Damgård, Thomas Pelle Jakobsen, Michael I. Schwartzbach

Publication date: 7 January 2010

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03549-4_20

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (39)

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ An efficient structural attack on NIST submission DAGS ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ PoW-Based Distributed Cryptography with No Trusted Setup ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Rate-limited secure function evaluation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Private liquidity matching using MPC ⋮ Privacy Assurances in Multiple Data-Aggregation Transactions ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Secure multi-party computation in large networks ⋮ A formal treatment of the role of verified compilers in secure computation ⋮ Efficient Computations over Encrypted Data Blocks ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Kicking-the-bucket: fast privacy-preserving trading using buckets ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Amortizing division and exponentiation ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ A distributed protocol for privacy preserving aggregation with non-permanent participants ⋮ Secure Outsourced Computation ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ On the exact round complexity of secure three-party computation ⋮ GNUC: a new universal composability framework ⋮ Efficient Secure Two-Party Exponentiation ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail ⋮ Network Oblivious Transfer ⋮ From Passive to Covert Security at Low Cost ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ Practically Efficient Secure Single-Commodity Multi-market Auctions ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer

This page was built for publication: Secure Multiparty Computation Goes Live