Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
From MaRDI portal
Publication:5756627
DOI10.1007/11818175_31zbMath1129.94016OpenAlexW1574535057MaRDI QIDQ5756627
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_31
Related Items (39)
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ On \(d\)-multiplicative secret sharing ⋮ Private set intersection: new generic constructions and feasibility results ⋮ A simple combinatorial treatment of constructions and threshold gaps of ramp schemes ⋮ 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 ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Coset bounds for algebraic geometric codes ⋮ Access structures of hyperelliptic secret sharing schemes ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Algebraic geometric codes with applications ⋮ Foundations of Homomorphic Secret Sharing ⋮ Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Efficient robust secret sharing from expander graphs ⋮ Nearly optimal robust secret sharing ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Secret sharing schemes based on graphical codes ⋮ Three-level secret sharing schemes from the twisted cubic ⋮ Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes ⋮ OT-Combiners via Secure Computation ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves ⋮ Isolated Proofs of Knowledge and Isolated Zero Knowledge ⋮ Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme ⋮ Secure Protocol Transformations ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ Unnamed Item ⋮ On Secret Sharing with Nonlinear Product Reconstruction ⋮ The price of active security in cryptographic protocols
This page was built for publication: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
