Pages that link to "Item:Q2501711"
From MaRDI portal
The following pages link to Secure multi-party computation without agreement (Q2501711):
Displaying 38 items.
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Secure computation without authentication (Q656923) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Composition of secure multi-party protocols. A comprehensive study. (Q1407493) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations (Q2465979) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Secure computation without agreement (Q4437112) (← links)
- Legally-Enforceable Fairness in Secure Two-Party Computation (Q5458936) (← links)
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (Q5738976) (← links)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol (Q5756545) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
