Scalable and Unconditionally Secure Multiparty Computation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Graph coloring applied to secure computation in non-abelian groups
- 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
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- 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
- 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 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
- 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
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Secure multi-party computation in large networks
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- 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
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- 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
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- Communication-optimal proactive secret sharing for dynamic groups
- Linear overhead optimally-resilient robust MPC using preprocessing
- Network oblivious transfer
- On the communication required for unconditionally secure multiplication
- Active security in multiparty computation over black-box groups
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Communication-efficient MPC for general adversary structures
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- scientific article; zbMATH DE number 4191080 (Why is no real title available?)
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- From Passive to Covert Security at Low Cost
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Quantum private comparison against decoherence noise
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
- Fault-tolerate quantum private comparison based on GHZ states and ECC
- scientific article; zbMATH DE number 1952911 (Why is no real title available?)
- Quantum private comparison based on phase encoding of single photons
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- Storing and retrieving secrets on a blockchain
- Efficient and decentralized polling protocol for general social networks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Unconditionally secure computation with reduced interaction
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable Secure Multiparty Computation
- On the exact round complexity of secure three-party computation
- Efficient perfectly secure computation with optimal resilience
- TinyKeys: a new approach to efficient multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Efficient perfectly secure computation with optimal resilience
- 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
- Fast large-scale honest-majority MPC for malicious adversaries
- 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
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- On linear communication complexity for (maximally) fluid MPC
- On the Amortized Communication Complexity of Byzantine Broadcast
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- 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
- The price of active security in cryptographic protocols
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Decentralized polling with respectable participants
- Multi-party computation with conversion of secret sharing
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Scalable multiparty computation from non-linear secret sharing
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Scalable agreement protocols with optimal optimistic efficiency
- Efficient robust secret sharing from expander graphs
- 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
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Simultaneous multiplication protocol based on packed linear secret sharing and its applications
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)
