Revisiting group oriented secret sharing schemes
From MaRDI portal
Publication:6125457
DOI10.1016/j.ins.2021.12.053OpenAlexW4205454300MaRDI QIDQ6125457
No author found.
Publication date: 11 April 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.12.053
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Reversible data hiding based on Shamir's secret sharing for color images over cloud
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- A verifiable threshold secret sharing scheme based on lattices
- How to share a secret
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Solving BDD by Enumeration: An Update
- A modular approach to key safeguarding
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- Group Authentication
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Revisiting group oriented secret sharing schemes