A Share Hardening Method for Multi-Factor Secret Sharing


KIPS Transactions on Computer and Communication Systems, Vol. 13, No. 1, pp. 31-37, Jan. 2024
https://doi.org/10.3745/KTCCS.2024.13.1.31,   PDF Download:
Keywords: Security, Secret Sharing, Share, Hardening
Abstract

Conventional secret sharing techniques often derive shares from randomly generated polynomials or planes, resulting in lengthy and complex shares that are challenging to memorize and/or manage without the aid of a separate computer or specialized device. Modifying existing secret sharing methods to use a predetermined value, such as a memorizable password or bio-metric information, offers a solution. However, this approach raises concerns about security, especially when the predetermined value lacks randomness or has low entropy. In such cases, adversaries may deduce a secret S with just (t - 1) shares by guessing the predetermined value or employing brute force attacks. In this paper, we introduce a share hardening method designed to ensure the security of secret sharing while enabling the use of memorizable passwords or biometric information as predetermined shares.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. W. Chung and M. S. Ryu, "A Share Hardening Method for Multi-Factor Secret Sharing," KIPS Transactions on Computer and Communication Systems, vol. 13, no. 1, pp. 31-37, 2024. DOI: https://doi.org/10.3745/KTCCS.2024.13.1.31.

[ACM Style]
Sung Wook Chung and Min Soo Ryu. 2024. A Share Hardening Method for Multi-Factor Secret Sharing. KIPS Transactions on Computer and Communication Systems, 13, 1, (2024), 31-37. DOI: https://doi.org/10.3745/KTCCS.2024.13.1.31.