2 out of N Secret Sharing Scheme Over GF(Q<sup>k</sup>)
In 2 out of n secret sharing scheme, a secret is splitted into n shares, and any 2 shares will recover the secret while any single share will leak no information about the secret. Previously the secret is drawn from prime field GF(q), where q is a prime number. In this paper, we realize a 2 out of n secret sharing scheme, where the secret can be drawn from extension field GF(q<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup>). Previous schemes can be seen as a special case of our scheme, where k=1.
Authors
- Teng Guo (ORCID: https://orcid.org/0000-0001-6604-475X)
Institutions
- University of International Relations (CN)
Publication Details
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1109/eit63098.2024.10762503
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- University of International Relations