Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field

DOI10.1007/978-3-642-03356-8_28zbMath1252.94106OpenAlexW1581614720MaRDI QIDQ3183580

Hao Chen, Ronald Cramer, Ignacio Cascudo, Xing, Chaoping

Publication date: 20 October 2009

Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_28

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items

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 ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ On \(d\)-multiplicative secret sharing ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ On the unique representation of very strong algebraic geometry codes ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ The optimal linear secret sharing scheme for any given access structure ⋮ Foundations of Homomorphic Secret Sharing ⋮ A note on ramp secret sharing schemes from error-correcting codes ⋮ Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ On Secret Sharing with Nonlinear Product Reconstruction