Secure multi-party computation with identifiable abort
From MaRDI portal
Recommendations
Cited in
(51)- Catching MPC cheaters: identification and openability
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Generic compiler for publicly verifiable covert multi-party computation
- TARDIS: a foundation of time-lock puzzles in UC
- 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
- Broadcast-optimal two-round MPC
- Round efficient secure multiparty quantum computation with identifiable abort
- Shielded computations in smart contracts overcoming forks
- 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
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Efficient, actively secure MPC with a dishonest majority: a survey
- Probabilistic termination and composability of cryptographic protocols
- Survey of information security
- On actively-secure elementary MPC reductions
- On communication models and best-achievable security in two-round MPC
- Secure protocol transformations
- Identifying cheaters without an honest majority
- Cheater detection in SPDZ multiparty computation
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Efficient secure multiparty computation with identifiable abort
- Multiparty generation of an RSA modulus
- Multiparty generation of an RSA modulus
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- 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
- Must the communication graph of MPC protocols be an expander?
- 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
- A Trustless GQ Multi-signature Scheme with Identifiable Abort
- On the correlation complexity of MPC with cheater identification
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
- Round-optimal, fully secure distributed key generation
- Secure multiparty computation with identifiable abort via vindicating release
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Multi-Holder anonymous credentials from BBS signatures
- MPC with publicly identifiable abort from pseudorandomness and homomorphic encryption
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- Distributing keys and random secrets with constant complexity
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Multi-committee MPC: from unanimous to identifiable abort
This page was built for publication: Secure multi-party computation with identifiable abort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874547)
