Pages that link to "Item:Q3600223"
From MaRDI portal
The following pages link to Scalable Multiparty Computation with Nearly Optimal Work and Resilience (Q3600223):
Displayed 29 items.
- Decentralized polling with respectable participants (Q663428) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups (Q2794492) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- (Q5002694) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Efficient and Decentralized Polling Protocol for General Social Networks (Q5207912) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- How to recover a secret with \(O(n)\) additions (Q6186593) (← links)
- Cryptography with weights: MPC, encryption and signatures (Q6186595) (← links)