Several Generalizations of Shamir's Secret Sharing Scheme
From MaRDI portal
Publication:3022011
DOI10.1142/S0129054104002510zbMATH Open1067.68067OpenAlexW2006088653MaRDI QIDQ3022011FDOQ3022011
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002510
Recommendations
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
Cited In (15)
- A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem
- Relationship between MDS codes and threshold schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-admissible tracks in Shamirs scheme
- Admissible tracks in Shamir's scheme
- Title not available (Why is that?)
- Generalised cumulative arrays in secret sharing
- A novel secret sharing scheme based on Shamir’s secret sharing scheme over field extensions
- Elementary symmetric polynomials in Shamir's scheme
- Admissible tracks in Lai-Ding's secret sharing scheme
- Title not available (Why is that?)
- New generalized secret-sharing schemes with points on a hyperplane using a Wronskian matrix
- A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes
- Selected application of the Chinese remainder theorem in multiparty computation
This page was built for publication: Several Generalizations of Shamir's Secret Sharing Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022011)