General secure multi-party computation from any linear secret-sharing scheme
From MaRDI portal
Publication:3374918
zbMATH Open1082.94515MaRDI QIDQ3374918FDOQ3374918
Authors: Ronald Cramer, Ueli M. Maurer, Ivan B. Damgård 
Publication date: 1 March 2006
Recommendations
Cited In (99)
- Multi-party revocation in sovrin: performance through distributed trust
- Coset bounds for algebraic geometric codes
- The optimal linear secret sharing scheme for any given access structure
- Processing secure, verifiable and efficient SQL over outsourced database
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Squares of matrix-product codes
- On \(d\)-multiplicative secret sharing
- On Linear Secret Sharing for Connectivity in Directed Graphs
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
- On the information ratio of non-perfect secret sharing schemes
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
- Progress in Cryptology - INDOCRYPT 2003
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient information-theoretic multi-party computation over non-commutative rings
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Secret sharing schemes based on graphical codes
- Secure publicly verifiable and proactive secret sharing schemes with general access structure
- Secret-sharing schemes for very dense graphs
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- On secret sharing with nonlinear product reconstruction
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Multi-Party Secure Computation of Multi-Variable Polynomials
- Foundations of homomorphic secret sharing
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- OT-Combiners via Secure Computation
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- On the (in)efficiency of non-interactive secure multiparty computation
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Linear multi-secret sharing schemes based on multi-party computation
- Efficient explicit constructions of compartmented secret sharing schemes
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- Low-complexity cryptographic hash functions
- Strongly multiplicative hierarchical threshold secret sharing
- Round-efficient perfectly secure message transmission scheme against general adversary
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Verifiably multiplicative secret sharing
- A note on ramp secret sharing schemes from error-correcting codes
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- A group identification protocol with leakage resilience of secret sharing scheme
- How to Share a Secret, Infinitely
- Secure multi-party computation protocol for sequencing problem
- High dimensional affine codes whose square has a designed minimum distance
- Title not available (Why is that?)
- Oblivious transfer based on single-qubit rotations
- Strong \((n, t, n)\) verifiable secret sharing scheme
- Secret-Sharing Schemes: A Survey
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Multi-party computation with conversion of secret sharing
- Improving the round complexity of VSS in point-to-point networks
- Optimal linear multiparty conditional disclosure of secrets protocols
- Local bounds for the optimal information ratio of secret sharing schemes
- Secure multi-party computation made simple
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Secret Sharing Schemes with Algebraic Properties and Applications
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Secure multiparty computation and secret sharing
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Methods of encrypting monotonic access structures
- Applied Cryptography and Network Security
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- Secure outsourced computation
- Blakley type secret sharing scheme based on the intersection of subspaces
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Asymptotically free broadcast in constant expected time via packed VSS
- Construction of arithmetic secret sharing schemes by using torsion limits
- Perfect MPC over layered graphs
- Bivariate polynomial-based secret sharing schemes with secure secret reconstruction
- Ideal uniform multipartite secret sharing schemes
- On information-theoretic secure multiparty computation with local repairability
- Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm
- The quadratic hull of a code and the geometric view on multiplication algorithms
- VSS Made Simpler
- A Single Initialization Server for Multi-party Cryptography
- Counting Method for Multi-party Computation over Non-abelian Groups
- Efficient Simultaneous Broadcast
- Properties of constacyclic codes under the Schur product
- CDS composition of multi-round protocols
- Scalable multiparty computation from non-linear secret sharing
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Ideal secret sharing schemes for useful multipartite access structures
- Zero-knowledge IOPs approaching witness length
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Secret sharing on regular bipartite access structures
- Generic constant-round oblivious sorting algorithm for MPC
- Revisiting group oriented secret sharing schemes
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Actively secure garbled circuits with constant communication overhead in the plain model
This page was built for publication: General secure multi-party computation from any linear secret-sharing scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374918)
