Revisiting group oriented secret sharing schemes
From MaRDI portal
Recommendations
- Analysis and improvement of a multisecret sharing authenticating scheme
- Gruppen secret sharing or how to share several secrets if you must?
- Analysis on a dynamic \( (t,n)\) threshold multi-secret sharing scheme
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- A secret sharing scheme based on group presentations and the word problem
Cites work
- A modular approach to key safeguarding
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- A verifiable threshold secret sharing scheme based on lattices
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- General secure multi-party computation from any linear secret-sharing scheme
- Group Authentication
- How to share a secret
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1303970 (Why is no real title available?)
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the efficacy of solving LWE by reduction to unique-SVP
- Reversible data hiding based on Shamir's secret sharing for color images over cloud
- Solving BDD by enumeration: an update
This page was built for publication: Revisiting group oriented secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125457)
