Secure multiparty computation goes live
DOI10.1007/978-3-642-03549-4_20zbMATH Open1417.94045OpenAlexW1595357546MaRDI QIDQ3655178FDOQ3655178
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
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cited In (43)
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- GNUC: a new universal composability framework
- Practically efficient secure single-commodity multi-market auctions
- 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
- Randomized functions with high round complexity
- 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
- Applying secure multi-party computation in practice
- Kicking-the-bucket: fast privacy-preserving trading using buckets
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Secure computation with minimal interaction, revisited
- Verifiable multi-party computation with perfectly private audit trail
- Network oblivious transfer
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Secure outsourced computation
- Lower and upper bounds on the randomness complexity of private computations of AND
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- 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
- PoW-based distributed cryptography with no trusted setup
- Rate-limited secure function evaluation
- From Passive to Covert Security at Low Cost
- Privacy assurances in multiple data-aggregation transactions
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- A formal treatment of the role of verified compilers in secure computation
- Secure multi-party computation in large networks
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- On compiling Boolean circuits optimized for secure multi-party computation
- TIDE: a novel approach to constructing timed-release encryption
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- An efficient structural attack on NIST submission DAGS
- Satisfiability modulo finite fields
- Efficient secure two-party exponentiation
- Rate-limited secure function evaluation: definitions and constructions
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Better preprocessing for secure multiparty computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- When is a semi-honest secure multiparty computation valuable?
- A new approach to efficient and secure fixed-point computation
- Amortizing division and exponentiation
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)
