Scalable Secure Multiparty Computation
From MaRDI portal
Publication:5756646
DOI10.1007/11818175_30zbMath1161.94394MaRDI 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
Unnamed Item, Garbled Circuits as Randomized Encodings of Functions: a Primer, On the Bottleneck Complexity of MPC with Correlated Randomness, OT-Combiners via Secure Computation, Counting Method for Multi-party Computation over Non-abelian Groups, From fairness to full security in multiparty computation, Round-optimal secure multi-party computation, Low cost constant round MPC combining BMR and oblivious transfer, Fast large-scale honest-majority MPC for malicious adversaries, Actively secure garbled circuits with constant communication overhead in the plain model, Ligero: lightweight sublinear arguments without a trusted setup, Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, Multi-party computation with conversion of secret sharing, Efficient robust secret sharing from expander graphs, Best possible information-theoretic MPC, Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, Secure computation with low communication from cross-checking, Efficient asynchronous verifiable secret sharing and multiparty computation, Order-C secure multiparty computation for highly repetitive circuits, The more the merrier: reducing the cost of large scale MPC, The price of active security in cryptographic protocols, Fluid MPC: secure multiparty computation with dynamic participants, On the power of secure two-party computation, Secure multi-party computation in large networks, Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?, On communication-efficient asynchronous MPC with adaptive security, Network Oblivious Transfer, On the Power of Secure Two-Party Computation, Secure Protocol Transformations, A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations, Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract), Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, Binary AMD Circuits from Secure Multiparty Computation, Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs, Graph Design for Secure Multiparty Computation over Non-Abelian Groups
