Pages that link to "Item:Q3612571"
From MaRDI portal
The following pages link to Scalable and Unconditionally Secure Multiparty Computation (Q3612571):
Displaying 25 items.
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- An efficient identity tracing scheme for blockchain-based systems (Q6057389) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Privacy preserving solution of DCOPs by mediation (Q6161505) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications (Q6488447) (← links)
- Lightweight asynchronous verifiable secret sharing with optimal resilience (Q6570529) (← links)
- MPC with delayed parties over star-like networks (Q6595681) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields (Q6618586) (← links)
- On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)