Secure multiparty computation with identifiable abort via vindicating release
From MaRDI portal
Recommendations
- Efficient secure multiparty computation with identifiable abort
- Secure multi-party computation with identifiable abort
- Round-optimal multi-party computation with identifiable abort
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Catching MPC cheaters: identification and openability
Cites work
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- A Framework for Efficient and Composable Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
- Broadcast-optimal two-round MPC
- Catching MPC cheaters: identification and openability
- Cheater detection in SPDZ multiparty computation
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Complete Fairness in Multi-party Computation without an Honest Majority
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Efficient generation of shared RSA keys
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient secure multiparty computation with identifiable abort
- Fair coin flipping: tighter analysis and the many-party case
- Fairness versus guaranteed output delivery in secure multiparty computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- Identifying cheaters without an honest majority
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Low cost constant round MPC combining BMR and oblivious transfer
- MPC vs. SFE : Unconditional and Computational Security
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty generation of an RSA modulus
- On achieving the ``best of both worlds in secure multiparty computation
- On sufficient oracles for secure computation with identifiable abort
- Partial fairness in secure two-party computation
- Protocols for multiparty coin toss with a dishonest majority
- Realistic Failures in Secure Multi-party Computation
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- Round efficient secure multiparty quantum computation with identifiable abort
- Round-optimal multi-party computation with identifiable abort
- Secure multi-party computation with identifiable abort
- Secure multiparty computation with sublinear preprocessing
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Semi-homomorphic encryption and multiparty computation
- Snarky ceremonies
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Theory of Cryptography
- UC-secure OT from LWE, revisited
- Universally composable synchronous computation
- Universally composable two-party and multi-party secure computation
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(3)
This page was built for publication: Secure multiparty computation with identifiable abort via vindicating release
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653023)
