Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
From MaRDI portal
Publication:3563850
DOI10.1007/978-3-642-13190-5_23zbMath1280.94046OpenAlexW1574373886MaRDI QIDQ3563850
Mikkel Krøigaard, Yuval Ishai, Ivan B. Damgård
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_23
Related Items (40)
ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ Asymptotically quasi-optimal cryptography ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Oblivious transfer with constant computational overhead ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Secure computation with low communication from cross-checking ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Efficient robust secret sharing from expander graphs ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Efficient Leakage Resilient Circuit Compilers ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Network Oblivious Transfer ⋮ Secure Protocol Transformations ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Guaranteed output delivery comes free in honest majority MPC
This page was built for publication: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
