Insured MPC: efficient secure computation with financial penalties

DOI10.1007/978-3-030-51280-4_22MaRDI QIDQ2226602zbMATH OpenOpenAlexFDO

Authors Carsten Baum, Bernardo David, Rafael Dowsley

Publication date 8 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-51280-4_22

zbMATH Keywords

cryptocurrenciesMPC protocolssecure multiparty computation

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Macroeconomic theory (monetary models, models of taxation) (91B64) Derivative securities (option pricing, hedging, etc.) (91G20) Cryptography (94A60)

Recommendations

• Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
• On fully secure MPC with solitary output
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Perfectly-Secure MPC with Linear Communication Complexity
• Adaptively secure MPC with sublinear communication complexity
• Adaptively secure MPC with sublinear communication complexity
• Amortized complexity of information-theoretically secure MPC revisited
• Efficient, actively secure MPC with a dishonest majority: a survey
• Private polynomial commitments and applications to MPC

Cited in

(15)

• TARDIS: a foundation of time-lock puzzles in UC
• Efficient constant-round MPC with identifiable abort and public verifiability
• FAST: fair auctions via secret transactions
• Coin-based multi-party fair exchange
• P2DEX: privacy-preserving decentralized cryptocurrency exchange
• Shielded computations in smart contracts overcoming forks
• Efficient fair multiparty protocols using blockchain and trusted hardware
• Fair and robust multi-party computation using a global transaction ledger
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
• (Public) verifiability for composable protocols without adaptivity or zero-knowledge
• GUC-secure commitments via random oracles: new impossibility and feasibility
• Constant-deposit multiparty lotteries on Bitcoin for arbitrary number of players and winners
• Eagle: efficient privacy preserving smart contracts
• Secure computation with penalties, revisited: how to handle coins with various colors
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: Insured MPC: efficient secure computation with financial penalties

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