Secure multiparty computation with identifiable abort via vindicating release

DOI10.1007/978-3-031-68397-8_2MaRDI QIDQ6653023

Abhi Shelat, Jack Doerner, Yashvanth Kondi, Ran Cohen

Publication date: 13 December 2024

zbMATH Keywords

input-revealing IA

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial fairness in secure two-party computation
• Updatable and universal common reference strings with applications to zk-SNARKs
• Fairness versus guaranteed output delivery in secure multiparty computation
• Catching MPC cheaters: identification and openability
• Efficient adaptively secure zero-knowledge from garbled circuits
• Efficient constant-round MPC with identifiable abort and public verifiability
• Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
• UC-secure OT from LWE, revisited
• Broadcast-optimal two-round MPC
• Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
• Round efficient secure multiparty quantum computation with identifiable abort
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Round-optimal multi-party computation with identifiable abort
• Secure multiparty computation with sublinear preprocessing
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Protocols for multiparty coin toss with a dishonest majority
• Secure Multi-Party Computation with Identifiable Abort
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• Identifying Cheaters without an Honest Majority
• Multiparty Computation from Somewhat Homomorphic Encryption
• Cheater Detection in SPDZ Multiparty Computation
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
• Semi-homomorphic Encryption and Multiparty Computation
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Efficient Secure Multiparty Computation with Identifiable Abort
• Universally composable two-party and multi-party secure computation
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• MPC vs. SFE : Unconditional and Computational Security
• Complete Fairness in Multi-party Computation without an Honest Majority
• Realistic Failures in Secure Multi-party Computation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• Universally Composable Synchronous Computation
• 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
• Advances in Cryptology - CRYPTO 2003
• Efficient generation of shared RSA keys
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
• Theory of Cryptography
• From fairness to full security in multiparty computation
• Multiparty generation of an RSA modulus
• Low cost constant round MPC combining BMR and oblivious transfer
• Improved straight-line extraction in the random oracle model with applications to signature aggregation
• On sufficient oracles for secure computation with identifiable abort
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
• Snarky ceremonies
• Constant-round simulation-secure coin tossing extension with guaranteed output

This page was built for publication: Secure multiparty computation with identifiable abort via vindicating release