Secure multiparty computation goes live

DOI10.1007/978-3-642-03549-4_20MaRDI QIDQ3655178zbMATH OpenOpenAlexFDO

Authors Peter Bogetoft, Dan Lund Christensen, Martin Geisler, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Illeborg Pagter, Tomas Toft, 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

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

Recommendations

• Scalable Secure Multiparty Computation
• Recent results in scalable multi-party computation
• Secure two-party computation is practical
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• Multiparty computation, an introduction

Cited in

(43)

• Amortizing division and exponentiation
• High throughput secure MPC over small population in hybrid networks (extended abstract)
• GNUC: a new universal composability framework
• Efficient computations over encrypted data blocks
• A secure and efficient protocol for electronic treasury auctions
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Practically efficient secure single-commodity multi-market auctions
• On the exact round complexity of secure three-party computation
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Randomized functions with high round complexity
• Applying secure multi-party computation in practice
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Kicking-the-bucket: fast privacy-preserving trading using buckets
• Verifiable multi-party computation with perfectly private audit trail
• Network oblivious transfer
• Secure computation with minimal interaction, revisited
• Secure Multi-party Computation: Information Flow of Outputs and Game Theory
• Secure outsourced computation
• \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• Improved signature schemes for secure multi-party computation with certified inputs
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• Private liquidity matching using MPC
• Rate-limited secure function evaluation
• PoW-based distributed cryptography with no trusted setup
• From Passive to Covert Security at Low Cost
• Privacy assurances in multiple data-aggregation transactions
• A distributed protocol for privacy preserving aggregation with non-permanent participants
• A formal treatment of the role of verified compilers in secure computation
• Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
• Secure multi-party computation in large networks
• On compiling Boolean circuits optimized for secure multi-party computation
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• TIDE: a novel approach to constructing timed-release encryption
• An efficient structural attack on NIST submission DAGS
• Efficient secure two-party exponentiation
• Rate-limited secure function evaluation: definitions and constructions
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Satisfiability modulo finite fields
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• Better preprocessing for secure multiparty computation
• When is a semi-honest secure multiparty computation valuable?
• A new approach to efficient and secure fixed-point computation

This page was built for publication: Secure multiparty computation goes live

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