Pages that link to "Item:Q3580972"
From MaRDI portal
The following pages link to Bounded-concurrent secure multi-party computation with a dishonest majority (Q3580972):
Displaying 35 items.
- Secure computation without authentication (Q656923) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Universally Composable Private Proximity Testing (Q3092361) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- How to obtain full privacy in auctions (Q5492128) (← links)
- Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Game-theoretically secure protocols for the ordinal random assignment problem (Q6535137) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
