Efficient constant-round MPC with identifiable abort and public verifiability
From MaRDI portal
Publication:2096540
DOI10.1007/978-3-030-56880-1_20OpenAlexW3037053551MaRDI QIDQ2096540FDOQ2096540
Authors: Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_20
Cites Work
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
- A Framework for Efficient and Composable Oblivious Transfer
- Semi-homomorphic encryption and multiparty computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Advances in Cryptology - CRYPTO 2003
- Authenticated Algorithms for Byzantine Agreement
- On the security of the ``Free-XOR technique
- Protocols for multiparty coin toss with dishonest majority
- Title not available (Why is that?)
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Low cost constant round MPC combining BMR and oblivious transfer
- More efficient oblivious transfer extensions with security for malicious adversaries
- Actively secure OT extension with optimal overhead
- On the feasibility of extending oblivious transfer
- A Unified Approach to MPC with Preprocessing Using OT
- Efficient constant round multi-party computation combining BMR and SPDZ
- Fair and robust multi-party computation using a global transaction ledger
- Fairness versus guaranteed output delivery in secure multiparty computation
- Catching MPC cheaters: identification and openability
- Secure multi-party computation with identifiable abort
- Unconditionally Secure Signature Schemes Revisited
- Efficient UC commitment extension with homomorphism for free (and applications)
- Insured MPC: efficient secure computation with financial penalties
- Covert security with public verifiability: faster, leaner, and simpler
- Public verifiability in the covert model (almost) for free
- Efficient secure multiparty computation with identifiable abort
- More efficient constant-round multi-party computation from BMR and SHE
- Calling out cheaters: covert security with public verifiability
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Publicly auditable secure multi-party computation
- Cheater detection in SPDZ multiparty computation
- Broadcast Extensions with Optimal Communication and Round Complexity
Cited In (20)
- Efficient, actively secure MPC with a dishonest majority: a survey
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- On the correlation complexity of MPC with cheater identification
- On actively-secure elementary MPC reductions
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Shielded computations in smart contracts overcoming forks
- Honest majority MPC with abort with minimal online communication
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Round-optimal multi-party computation with identifiable abort
- TARDIS: a foundation of time-lock puzzles in UC
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Certifying private probabilistic mechanisms
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Secure multiparty computation with identifiable abort via vindicating release
- Gossiping for communication-efficient broadcast
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: Efficient constant-round MPC with identifiable abort and public verifiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096540)
