Efficient constant-round MPC with identifiable abort and public verifiability
type: Item
instance of: scholarly article
title: Efficient constant-round MPC with identifiable abort and public verifiability
DOI: 10.1007/978-3-030-56880-1_20
author: Carsten Baum
author: Emmanuela Orsini
author: Peter Scholl
author: Eduardo Soria-Vazquez
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68M25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614580
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 20
OpenAlex ID: W3037053551
cites work: More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
cites work: Calling Out Cheaters: Covert Security with Public Verifiability
cites work: Publicly Auditable Secure Multi-Party Computation
cites work: Insured MPC: efficient secure computation with financial penalties
cites work: Efficient Secure Multiparty Computation with Identifiable Abort
cites work: Protocols for Multiparty Coin Toss with Dishonest Majority
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Efficient UC commitment extension with homomorphism for free (and applications)
cites work: On the Security of the “Free-XOR” Technique
cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
cites work: Catching MPC cheaters: identification and openability
cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: A Unified Approach to MPC with Preprocessing Using OT
cites work: Broadcast Extensions with Optimal Communication and Round Complexity
cites work: Q2707409
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Covert security with public verifiability: faster, leaner, and simpler
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Secure Multi-Party Computation with Identifiable Abort
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Actively Secure OT Extension with Optimal Overhead
cites work: Fair and Robust Multi-party Computation Using a Global Transaction Ledger
cites work: Public Verifiability in the Covert Model (Almost) for Free
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
cites work: More Efficient Constant-Round Multi-party Computation from BMR and SHE
cites work: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
cites work: On the Feasibility of Extending Oblivious Transfer
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Bounded-concurrent secure multi-party computation with a dishonest majority
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Unconditional Byzantine agreement for any number of faulty processors
cites work: Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
cites work: Cheater Detection in SPDZ Multiparty Computation
cites work: Unconditionally Secure Signature Schemes Revisited
description: scientific article; zbMATH DE number 7614580