Multi-Factor Threshold Sharing With Hardened Memorizable Shares
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional threshold secret sharing methods generate complex and non-memorizable shares, requiring additional devices for storage and management, and using predetermined values like passwords or biometrics can compromise security due to low entropy, making them vulnerable to attacks.
Innovation Solution
A share hardening method for multi-factor threshold secret sharing that includes operations to accept predetermined first shares, generate random second shares, determine aggregate shares, and create polynomials for generating remaining shares, ensuring security and usability by using passwords or biometrics without additional devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional threshold secret sharing methods are used to generate shares from polynomials or planes, then the secrecy of the secret is increased and the risk of losing the secret is lowered, but the shares become complex and long, requiring computer systems or separate digital devices for storage and management
Solution Approach 1:
The share is segmented into two distinct components: a predetermined first share value (which can be memorizable like a password or biometric information) and a randomly generated second share value. This segmentation allows the final share to maintain security properties while incorporating user-friendly elements that can be memorized without requiring external storage devices.
Solution Approach 2:
A share hardening value is introduced as an intermediary element that bridges the gap between user memorizable information and secure cryptographic shares. This intermediary component enhances the entropy and security of the final share while allowing the use of simpler, memorizable first share values.
2Ease of operation
If predetermined values like passwords or biometric information are used as shares, then the usability of secret sharing is improved and separate devices are not required, but the security may be compromised due to low entropy making them vulnerable to guessing or brute force attacks
Solution Approach 1:
The invention merges two types of share values with different characteristics: predetermined first share values (which provide usability and memorizability) and randomly generated second share values (which provide high entropy and security). The combination of these two components in the final share achieves both usability and security simultaneously.
Solution Approach 2:
The final share is constructed as a composite of two distinct components: the predetermined first share value and the randomly generated second share value. This composite structure combines the advantages of both components - the memorizability and user-friendliness of predetermined values with the high entropy and attack-resistance of random values.
Data Source
AI summary
Provided is a share hardening method for multi-factor threshold secret sharing which includes an arbitrary share predetermined by a user and is capable of guaranteeing a security. The share hardening method for multi-factor threshold secret sharing may include an operation of accepting at least one predetermined first share value, an operation of randomly generating at least one second share value corresponding to the at least one predetermined first share value, an operation of determining an aggregate share using the at least one predetermined first share value and the at least one second share value, an operation of generating a polynomial for threshold secret sharing based on the determined aggregate share, and an operation of generating the remaining full shares based on the generated polynomial.