Secret sharing based on a hard-on-average problem

DOI10.1016/J.LAA.2005.10.040MaRDI QIDQ2369061zbMATH OpenOpenAlexWikidataFDO

Authors C. Hernández-Goya, Pino Caballero-Gil

Publication date 28 April 2006

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2005.10.040

zbMATH Keywords

Computational complexityCryptographySecret sharingMatrices

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secret sharing schemes with applications in security protocols
• Secret-Sharing Schemes: A Survey
• On the size of shares for secret sharing schemes
• scientific article; zbMATH DE number 1024051
• scientific article; zbMATH DE number 176543

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 3912274 (Why is no real title available?)
• scientific article; zbMATH DE number 3574966 (Why is no real title available?)
• scientific article; zbMATH DE number 3635490 (Why is no real title available?)
• scientific article; zbMATH DE number 1008518 (Why is no real title available?)
• Average Case Complete Problems
• How to share a secret
• On secret sharing systems
• On the theory of average case complexity

Cited in

(2)

• Secret sharing on the \(d\)-dimensional cube
• Approximate Degree, Secret Sharing, and Concentration Phenomena

This page was built for publication: Secret sharing based on a hard-on-average problem

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