Efficient secure multiparty computation with identifiable abort
From MaRDI portal
Publication:3179367
Recommendations
Cites work
- scientific article; zbMATH DE number 1583775 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Authenticated Algorithms for Byzantine Agreement
- Better preprocessing for secure multiparty computation
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Fairness versus guaranteed output delivery in secure multiparty computation
- Foundations of Cryptography
- Identifying cheaters without an honest majority
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- Leveled fully homomorphic signatures from standard lattices
- Multi-valued Byzantine broadcast: the \(t < n\) case
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On the feasibility of extending oblivious transfer
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure multi-party computation with identifiable abort
- Secure multi-party computation without agreement
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Semi-homomorphic encryption and multiparty computation
- Signatures for network coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Unconditionally Secure Signature Schemes Revisited
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
Cited in
(17)- Efficient, actively secure MPC with a dishonest majority: a survey
- Identifying cheaters without an honest majority
- Attaining GOD beyond honest majority with friends and foes
- On the correlation complexity of MPC with cheater identification
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Secure multi-party computation with identifiable abort
- 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
- Efficient constant-round MPC with identifiable abort and public verifiability
- A Trustless GQ Multi-signature Scheme with Identifiable Abort
- On sufficient oracles for secure computation with identifiable abort
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Secure multiparty computation with identifiable abort via vindicating release
- Catching MPC cheaters: identification and openability
- Cheater detection in SPDZ multiparty computation
This page was built for publication: Efficient secure multiparty computation with identifiable abort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179367)
