Secure Multi-Party Computation with Identifiable Abort

DOI10.1007/978-3-662-44381-1_21zbMath1335.94053OpenAlexW312279799MaRDI QIDQ2874547

Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_21

Mathematics Subject Classification ID

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

Related Items (35)

Round efficient secure multiparty quantum computation with identifiable abort ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Shielded computations in smart contracts overcoming forks ⋮ Survey of information security ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Round-optimal multi-party computation with identifiable abort ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Cheater Detection in SPDZ Multiparty Computation ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ On sufficient oracles for secure computation with identifiable abort ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On active attack detection in messaging with immediate decryption ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ From fairness to full security in multiparty computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Multiparty generation of an RSA modulus ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Secure Protocol Transformations ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ FAST: fair auctions via secret transactions ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security ⋮ Multiparty generation of an RSA modulus ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Secure Multi-Party Computation with Identifiable Abort