Efficient secure multi-party computation. (Extended Abstract)
From MaRDI portal
Recommendations
Cited in
(79)- Composition of secure multi-party protocols. A comprehensive study.
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- On the message complexity of secure multiparty computation
- Minimal complete primitives for secure multi-party computation
- Preface (to the special issue on general secure multiparty computation)
- Efficient asynchronous verifiable secret sharing and multiparty computation
- A note on secure multiparty computation via higher residue symbols
- Guaranteed output delivery comes free in honest majority MPC
- Efficient constructions for almost-everywhere secure computation
- ATLAS: efficient and scalable MPC in the honest majority setting
- Efficient information-theoretic multi-party computation over non-commutative rings
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Improved signature schemes for secure multi-party computation with certified inputs
- Secure multiparty computation with sublinear preprocessing
- Secure multi-party computation made simple
- Optimal extension protocols for Byzantine broadcast and agreement
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- An efficient approach for secure multi-party computation without authenticated channel
- Efficient fully secure computation via distributed zero-knowledge proofs
- On Adaptively Secure Multiparty Computation with a Short CRS
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Size-Hiding Computation for Multiple Parties
- Cheater detection in SPDZ multiparty computation
- An equational approach to secure multi-party computation
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- The cost of fault tolerance in multi-party communication complexity
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Secure multi-party computation protocol for sequencing problem
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Secure Multiparty AES
- Improved primitives for secure multiparty integer computation
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups
- On Secure Multi-party Computation in Black-Box Groups
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1952911 (Why is no real title available?)
- scientific article; zbMATH DE number 1754645 (Why is no real title available?)
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- scientific article; zbMATH DE number 1848306 (Why is no real title available?)
- Communication Locality in Secure Multi-party Computation
- Techniques for Efficient Secure Computation Based on Yao’s Protocol
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Bit-slice auction circuit
- scientific article; zbMATH DE number 7267018 (Why is no real title available?)
- Secure Multi-Party Computation for Elliptic Curves
- Atomic Secure Multi-party Multiplication with Low Communication
- Counting Method for Multi-party Computation over Non-abelian Groups
- A Single Initialization Server for Multi-party Cryptography
- On the computational overhead of MPC with dishonest majority
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- TinyKeys: a new approach to efficient multi-party computation
- Theory of Cryptography
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Asymptotically free broadcast in constant expected time via packed VSS
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Secure message transmission in asynchronous networks
- VSS Made Simpler
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Multi-party computation with conversion of secret sharing
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Asymptotically free broadcast in constant expected time via packed VSS
- Statistical layered MPC
- Perfectly-secure MPC with constant online communication complexity
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Perfectly-secure multiparty computation with linear communication complexity over any modulus
- On the communication complexity of secure multi-party computation with aborts
- Perfectly secure network-agnostic MPC comes for free
- Scaling fully secure MPC via robust recursive search and gap amplification
- Detect, pack and batch: perfectly secure MPC with linear communication and constant expected time
This page was built for publication: Efficient secure multi-party computation. (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707411)
