Scalable and Unconditionally Secure Multiparty Computation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient and decentralized polling protocol for general social networks
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- Advances in Cryptology - EUROCRYPT 2004
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- MPClan: protocol suite for privacy-conscious computations
- Multi-party computation with conversion of secret sharing
- Advances in Cryptology - CRYPTO 2003
- Scalable Secure Multiparty Computation
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Efficient robust secret sharing from expander graphs
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditionally secure computation with reduced interaction
- Active security in multiparty computation over black-box groups
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Perfectly-secure MPC with constant online communication complexity
- Quantum private comparison against decoherence noise
- Fault-tolerate quantum private comparison based on GHZ states and ECC
- Attaining GOD beyond honest majority with friends and foes
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Perfectly-secure multiparty computation with linear communication complexity over any modulus
- Share the \textsf{MAYO}: thresholdizing \textsf{MAYO}
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Private neural network training with packed secret sharing
- On the communication complexity of secure multi-party computation with aborts
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- On communication-efficient asynchronous MPC with adaptive security
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Sharing transformation and dishonest majority MPC with packed secret sharing
- On the communication required for unconditionally secure multiplication
- On the exact round complexity of secure three-party computation
- scientific article; zbMATH DE number 4191080 (Why is no real title available?)
- Privacy preserving solution of DCOPs by mediation
- Linear overhead optimally-resilient robust MPC using preprocessing
- Efficient information-theoretic multi-party computation over non-commutative rings
- Fluid MPC: secure multiparty computation with dynamic participants
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Efficient asynchronous verifiable secret sharing and multiparty computation
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Improved single-round secure multiplication using regenerating codes
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Network oblivious transfer
- MPC with delayed parties over star-like networks
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Robust Multiparty Computation with Linear Communication Complexity
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- Communication-efficient MPC for general adversary structures
- An efficient identity tracing scheme for blockchain-based systems
- Le Mans: dynamic and fluid MPC for dishonest majority
- 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
- Improved signature schemes for secure multi-party computation with certified inputs
- TinyKeys: a new approach to efficient multi-party computation
- Quantum private comparison based on phase encoding of single photons
- Towards scalable YOSO MPC via packed secret-sharing
- On linear communication complexity for (maximally) fluid MPC
- Honest majority constant-round MPC with linear communication from one-way functions
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
- The price of active security in cryptographic protocols
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Graph coloring applied to secure computation in non-abelian groups
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- scientific article; zbMATH DE number 1952911 (Why is no real title available?)
- From Passive to Covert Security at Low Cost
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Storing and retrieving secrets on a blockchain
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Malicious security in collaborative zk-SNARKs: more than meets the eye
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Low cost constant round MPC combining BMR and oblivious transfer
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Guaranteed output delivery comes free in honest majority MPC
- The price of active security in cryptographic protocols
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- On the Amortized Communication Complexity of Byzantine Broadcast
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Simultaneous multiplication protocol based on packed linear secret sharing and its applications
- Fast large-scale honest-majority MPC for malicious adversaries
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
- Secure multi-party computation in large networks
- Non-interactive zero-knowledge proofs to multiple verifiers
- Honest majority MPC with \(\tilde{O}(|C|)\) communication in Minicrypt
- Weakly super-invertible matrices and constant communication dishonest majority MPC
This page was built for publication: Scalable and Unconditionally Secure Multiparty Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612571)
