Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
From MaRDI portal
Publication:5756627
DOI10.1007/11818175_31zbMath1129.94016MaRDI 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
94A60: Cryptography
Related Items
Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme, Unnamed Item, The quadratic hull of a code and the geometric view on multiplication algorithms, Foundations of Homomorphic Secret Sharing, 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, OT-Combiners via Secure Computation, Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves, Isolated Proofs of Knowledge and Isolated Zero Knowledge, Actively secure garbled circuits with constant communication overhead in the plain model, Ligero: lightweight sublinear arguments without a trusted setup, More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings, A simple combinatorial treatment of constructions and threshold gaps of ramp schemes, Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method, On \(d\)-multiplicative secret sharing, Coset bounds for algebraic geometric codes, Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures, Efficient robust secret sharing from expander graphs, Three-level secret sharing schemes from the twisted cubic, Access structures of hyperelliptic secret sharing schemes, 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, 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, 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