Scalable Multiparty Computation with Nearly Optimal Work and Resilience

DOI10.1007/978-3-540-85174-5_14MaRDI QIDQ3600223zbMATH OpenOpenAlexFDO

Authors

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_14

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Cryptography (94A60)

Recommendations

• Scalable Secure Multiparty Computation
• Scalable and Unconditionally Secure Multiparty Computation
• Efficient perfectly secure computation with optimal resilience
• Secure multi-party computation in large networks
• Efficient perfectly secure computation with optimal resilience

Cited in

(38)

• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• A theoretical and empirical evaluation of an algorithm for self-healing computation
• Secure computation with low communication from cross-checking
• Order-C secure multiparty computation for highly repetitive circuits
• Multi-party threshold private set intersection with sublinear communication
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Secure multi-party computation in large networks
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Communication-optimal proactive secret sharing for dynamic groups
• Polynomial evaluation and side channel analysis
• Proactive Secret Sharing with a Dishonest Majority
• Network oblivious transfer
• On the communication required for unconditionally secure multiplication
• Bounded indistinguishability and the complexity of recovering secrets
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• From Passive to Covert Security at Low Cost
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Multikey fully homomorphic encryption and applications
• The bottleneck complexity of secure multiparty computation
• On the bottleneck complexity of MPC with correlated randomness
• Recent results in scalable multi-party computation
• Efficient and decentralized polling protocol for general social networks
• On the computational overhead of MPC with dishonest majority
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• How to recover a secret with O(n) additions
• Cryptography with weights: MPC, encryption and signatures
• On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
• VSS Made Simpler
• Decentralized polling with respectable participants
• On information-theoretic secure multiparty computation with local repairability
• Scalable multiparty computation from non-linear secret sharing
• Scalable agreement protocols with optimal optimistic efficiency
• Efficient robust secret sharing from expander graphs
• Honest majority constant-round MPC with linear communication from one-way functions

This page was built for publication: Scalable Multiparty Computation with Nearly Optimal Work and Resilience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600223)