Scalable Secure Multiparty Computation
From MaRDI portal
Publication:5756646
DOI10.1007/11818175_30zbMath1161.94394OpenAlexW1542382722MaRDI QIDQ5756646
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_30
Related Items (37)
Fluid MPC: secure multiparty computation with dynamic participants ⋮ Best possible information-theoretic MPC ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ 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 ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Unnamed Item ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Secure computation with low communication from cross-checking ⋮ Multi-party computation with conversion of secret sharing ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient robust secret sharing from expander graphs ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ OT-Combiners via Secure Computation ⋮ From fairness to full security in multiparty computation ⋮ Round-optimal secure multi-party computation ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ On the power of secure two-party computation ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Network Oblivious Transfer ⋮ On the Power of Secure Two-Party Computation ⋮ Secure Protocol Transformations ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ The price of active security in cryptographic protocols
This page was built for publication: Scalable Secure Multiparty Computation
