Scalable Multiparty Computation with Nearly Optimal Work and Resilience

DOI10.1007/978-3-540-85174-5_14zbMath1183.68082OpenAlexW1939687213MaRDI QIDQ3600223

No author found.

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

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

Related Items (29)

Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ Secure multi-party computation in large networks ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ 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) ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Unnamed Item ⋮ How to recover a secret with \(O(n)\) additions ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Secure computation with low communication from cross-checking ⋮ Decentralized polling with respectable participants ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Efficient robust secret sharing from expander graphs ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ From fairness to full security in multiparty computation ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Efficient and Decentralized Polling Protocol for General Social Networks ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ 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 ⋮ From Passive to Covert Security at Low Cost

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