Efficient Secure Multiparty Computation with Identifiable Abort
From MaRDI portal
Publication:3179367
DOI10.1007/978-3-662-53641-4_18zbMath1406.94025OpenAlexW2524585805MaRDI QIDQ3179367
Peter Scholl, Carsten Baum, Emmanuela Orsini
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2016/187
Related Items (8)
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 ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ From fairness to full security in multiparty computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Efficient constant-round MPC with identifiable abort and public verifiability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signatures for network coding
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Secure multi-party computation without agreement
- Better Preprocessing for Secure Multiparty Computation
- (Leveled) fully homomorphic encryption without bootstrapping
- Secure Multi-Party Computation with Identifiable Abort
- Identifying Cheaters without an Honest Majority
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Multi-valued Byzantine Broadcast: The t < n Case
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Unconditionally Secure Signature Schemes Revisited
- Semi-homomorphic Encryption and Multiparty Computation
- Authenticated Algorithms for Byzantine Agreement
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Foundations of Cryptography
- On the Feasibility of Extending Oblivious Transfer
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
This page was built for publication: Efficient Secure Multiparty Computation with Identifiable Abort
