Pages that link to "Item:Q5756627"
From MaRDI portal
The following pages link to Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields (Q5756627):
Displayed 39 items.
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Coset bounds for algebraic geometric codes (Q623250) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Three-level secret sharing schemes from the twisted cubic (Q712244) (← links)
- Access structures of hyperelliptic secret sharing schemes (Q897323) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields (Q1726005) (← links)
- Algebraic geometric codes with applications (Q1956522) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- Secret sharing schemes based on graphical codes (Q2016393) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- Secret Sharing Schemes with Algebraic Properties and Applications (Q3188241) (← links)
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes (Q3600362) (← links)
- Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme (Q4975177) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- The quadratic hull of a code and the geometric view on multiplication algorithms (Q5043439) (← links)
- (Q5140836) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- On Secret Sharing with Nonlinear Product Reconstruction (Q5265016) (← links)
- On some bounds for symmetric tensor rank of multiplication in finite fields (Q5346821) (← links)
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties (Q5346825) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves (Q5458608) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)