Requirements for group independent linear threshold secret sharing schemes

DOI10.1007/3-540-45450-0_7MaRDI QIDQ4412962zbMATH OpenFDO

Authors Brian R. King

Publication date 17 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2384/23840089.htm

zbMATH Keywords

bounds on share sizegroup independent linear threshold schemeslinear secret sharingmonotone span programssecret sharingthreshold cryptography

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Randomness required for linear threshold sharing schemes defined over any finite abelian group
• A secret sharing scheme based on group presentations and the word problem
• Multisecret threshold schemes
• Linear threshold multisecret sharing schemes
• A secret share threshold scheme based on multivariate linear polynomial

Cited in

(3)

• Randomness required for linear threshold sharing schemes defined over any finite abelian group
• Threshold Secret Sharing Requires a Linear Size Alphabet
• Revisiting the Karnin, Greene and Hellman Bounds

This page was built for publication: Requirements for group independent linear threshold secret sharing schemes

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