Scalable and Unconditionally Secure Multiparty Computation

DOI10.1007/978-3-540-74143-5_32zbMath1215.94041OpenAlexW1528693676MaRDI QIDQ3612571

Jesper Buus Nielsen, Ivan B. Damgård

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (61)

Fluid MPC: secure multiparty computation with dynamic participants ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Honest majority MPC with abort with minimal online communication ⋮ Quantum private comparison against decoherence noise ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Secure multi-party computation in large networks ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Fault-tolerate quantum private comparison based on GHZ states and ECC ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ An efficient identity tracing scheme for blockchain-based systems ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Privacy preserving solution of DCOPs by mediation ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Quantum private comparison based on phase encoding of single photons ⋮ Decentralized polling with respectable participants ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ Efficient robust secret sharing from expander graphs ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ On the exact round complexity of secure three-party computation ⋮ Efficient and Decentralized Polling Protocol for General Social Networks ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Network Oblivious Transfer ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ From Passive to Covert Security at Low Cost ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ The price of active security in cryptographic protocols

This page was built for publication: Scalable and Unconditionally Secure Multiparty Computation