Scalable Multiparty Computation with Nearly Optimal Work and Resilience
From MaRDI portal
Publication:3600223
DOI10.1007/978-3-540-85174-5_14zbMath1183.68082MaRDI 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
Related Items
Multikey Fully Homomorphic Encryption and Applications, Unnamed Item, On the Bottleneck Complexity of MPC with Correlated Randomness, Efficient and Decentralized Polling Protocol for General Social Networks, On the Computational Overhead of MPC with Dishonest Majority, From fairness to full security in 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, Decentralized polling with respectable participants, Efficient robust secret sharing from expander graphs, Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, 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
