Round-optimal multi-party computation with identifiable abort
From MaRDI portal
Publication:2170005
DOI10.1007/978-3-031-06944-4_12zbMath1496.94035OpenAlexW4285257170MaRDI QIDQ2170005
Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_12
Related Items (2)
Four-round black-box non-malleable schemes from one-way permutations ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Cites Work
- Unnamed Item
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Round-optimal secure two-party computation from trapdoor permutations
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Round optimal concurrent non-malleability from polynomial hardness
- Catching MPC cheaters: identification and openability
- Promise zero knowledge and its applications to round optimal MPC
- Efficient constant-round MPC with identifiable abort and public verifiability
- Broadcast-optimal two-round MPC
- Round optimal secure multiparty computation from minimal assumptions
- Broadcast-optimal two round MPC with an honest majority
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Two round information-theoretic MPC with malicious security
- Secure Multi-Party Computation with Identifiable Abort
- Identifying Cheaters without an Honest Majority
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- Cheater Detection in SPDZ Multiparty Computation
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Founding Cryptography on Oblivious Transfer – Efficiently
- On the Composition of Zero-Knowledge Proof Systems
- Advances in Cryptology – CRYPTO 2004
- Textbook non-malleable commitments
- Constant round non-malleable protocols using one way functions
- Zaps and Their Applications
- Concurrent Non-malleable Commitments from Any One-Way Function
- The Exact Round Complexity of Secure Computation
- Round-optimal secure multi-party computation
This page was built for publication: Round-optimal multi-party computation with identifiable abort
