Secure multi-party computation without agreement
From MaRDI portal
Recommendations
Cited in
(46)- On expected constant-round protocols for Byzantine agreement
- General composition and universal composability in secure multiparty computation
- Composition of secure multi-party protocols. A comprehensive study.
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Fairness versus guaranteed output delivery in secure multiparty computation
- Secure computation with low communication from cross-checking
- Characterization of secure multiparty computation without broadcast
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Broadcast-optimal two-round MPC
- Synchronous consensus with optimal asynchronous fallback guarantees
- On fully secure MPC with solitary output
- \(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
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Probabilistic termination and composability of cryptographic protocols
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
- Protocols for multiparty coin toss with a dishonest majority
- Characterization of secure multiparty computation without broadcast
- Probabilistic Termination and Composability of Cryptographic Protocols
- Secure computation, I/O-efficient algorithms and distributed signatures
- Broadcast (and round) efficient verifiable secret sharing
- Efficient secure multiparty computation with identifiable abort
- More efficient constant-round multi-party computation from BMR and SHE
- Secure computation with minimal interaction, revisited
- scientific article; zbMATH DE number 2013820 (Why is no real title available?)
- Secure Computation Without Authentication
- Legally-Enforceable Fairness in Secure Two-Party Computation
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Low cost constant round MPC combining BMR and oblivious transfer
- Multiparty generation of an RSA modulus
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Mixed-technique multi-party computations composed of two-party computations
- Fast large-scale honest-majority MPC for malicious adversaries
- High-throughput secure three-party computation with an honest majority
- Non-interactive zero-knowledge proofs to multiple verifiers
- Completeness theorems for adaptively secure broadcast
- Resource fairness and composability of cryptographic protocols
- Secure computation without authentication
- Broadcast-optimal four-round MPC in the plain model
- On the round complexity of fully secure solitary MPC with honest majority
- On the communication complexity of secure multi-party computation with aborts
- Broadcast-optimal secure computation from black-box oblivious transfer
- Byzantine agreement and Byzantine broadcast
- Simple three-round multiparty Schnorr signing with full simulatability
- Cryptography in the multi-string model
This page was built for publication: Secure multi-party computation without agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501711)
