First study for ramp secret sharing schemes through greatest common divisor of polynomials

DOI10.1007/978-3-030-44625-3_14MaRDI QIDQ3300516zbMATH OpenOpenAlexFDO

Authors G. C. Meletiou, D. S. Triantafyllou, Michael N. Vrahatis

Publication date 29 July 2020

Published in Computational Mathematics and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-44625-3_14

Mathematics Subject Classification ID

Existence theories in calculus of variations and optimal control (49Jxx) Numerical analysis in abstract spaces (65Jxx)

Recommendations

• Multiple ramp schemes
• On secret sharing systems
• Strongly secure ramp secret sharing schemes for general access structures
• scientific article; zbMATH DE number 969170
• Chinese remainder theorem secret sharing in multivariate polynomials

Cites work

• scientific article; zbMATH DE number 48827 (Why is no real title available?)
• scientific article; zbMATH DE number 486633 (Why is no real title available?)
• scientific article; zbMATH DE number 3090508 (Why is no real title available?)
• Computing real roots of real polynomials
• Factoring polynomials with rational coefficients
• Greatest common divisors from generalized sylvester resultant matrices
• Ideal ramp schemes and related combinatorial objects
• Numerical linear algebra and applications
• On rank and null space computation of the generalized Sylvester matrix
• Security of Ramp Schemes
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

This page was built for publication: First study for ramp secret sharing schemes through greatest common divisor of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300516)