Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
From MaRDI portal
Recommendations
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- Secure Computation from Random Error Correcting Codes
- On the complexity of arithmetic secret sharing
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
Cited in
(63)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Algebraic geometric codes with applications
- Nearly optimal robust secret sharing
- Secret sharing schemes based on graphical codes
- The price of active security in cryptographic protocols
- On the complexity of arithmetic secret sharing
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Private set intersection: new generic constructions and feasibility results
- A note on ramp secret sharing schemes from error-correcting codes
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- On the complexity of additively homomorphic UC commitments
- Secure protocol transformations
- On constructing homomorphic encryption schemes from coding theory
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Secret Sharing Schemes with Algebraic Properties and Applications
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Access Structures of Elliptic Secret Sharing Schemes
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Geometric and Computational Approach to Classical and Quantum Secret Sharing
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Foundations of homomorphic secret sharing
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Threshold secret sharing requires a linear-size alphabet
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- On secret sharing with nonlinear product reconstruction
- On some bounds for symmetric tensor rank of multiplication in finite fields
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Secure Computation from Random Error Correcting Codes
- OT-Combiners via Secure Computation
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- On \(d\)-multiplicative secret sharing
- Ligero: lightweight sublinear arguments without a trusted setup
- Actively secure garbled circuits with constant communication overhead in the plain model
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Improved single-round secure multiplication using regenerating codes
- Coset bounds for algebraic geometric codes
- Threshold secret sharing with geometric algebras
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- The price of active security in cryptographic protocols
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Efficient robust secret sharing from expander graphs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Four families of squares of BCH codes and their complements
- New constructions on self-dual algebraic geometry codes
- Proving as fast as computing: succinct arguments with constant prover overhead
- Hadamard square of series connected linear codes
- Hadamard square of linear codes and the generalized minimal distance of Reed-Muller code of order 2
- A proof of the Brill-Noether method from scratch
- Three-level secret sharing schemes from the twisted cubic
- Honest majority constant-round MPC with linear communication from one-way functions
- Some results on Schur powers and cubes of primitive narrow-sense BCH codes
- The Schur products of some binary LCD BCH codes
- Access structures of hyperelliptic secret sharing schemes
This page was built for publication: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756627)
