Secret Sharing XOR Logic for Secure Threshold Data Restoration

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing threshold secret sharing schemes using XOR operations are inefficient due to large memory requirements and vulnerability to data inference, especially when dealing with real-time performance and large data sets, and they often have limitations in setting the number of shares and threshold values.

Innovation Solution

A secret sharing apparatus that generates shared data through XOR operations between divided data, allowing for reduced data size and enhanced restoration speed, while also enabling flexible setting of the number of shares and threshold values, and incorporating random numbers for enhanced security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If polynomial interpolation is used for threshold secret sharing, then security is achieved, but calculation time increases and real-time performance deteriorates

Engineering Contradiction:

ImprovesecurityVSAvoidcalculation time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent replaces the complex polynomial interpolation calculation system with a simple XOR operation system. Instead of performing computationally intensive polynomial calculations, the invention uses bitwise XOR operations between divided data and random number sequences, achieving the same secret sharing security goal with dramatically reduced calculation time and improved real-time performance.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

2Productivity

If XOR operation is used for threshold secret sharing, then calculation speed improves, but original data can be easily inferred from shared data if random number sequence is leaked

Engineering Contradiction:

Improvecalculation speedVSAvoidsecurity

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent segments the random number usage into multiple independent random number sequences, each corresponding to different divided data. By dividing the random number resource into multiple independent sequences and combining them through XOR operations across multiple shares, the system maintains calculation speed while preventing data inference even if one random number sequence is compromised.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary structure where multiple divided data pieces are combined with multiple random number sequences through XOR operations. This intermediary layer of multiple XORed components prevents direct inference of original data, as recovering the original requires all shares and their corresponding random number sequences, thus maintaining security while preserving calculation efficiency.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Reliability

If number of shares is increased in XOR-based secret sharing, then security distribution improves, but memory capacity requirement increases due to same data size as original

Engineering Contradiction:

Improvesecurity distributionVSAvoidmemory capacity

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments the original data into multiple divided data pieces before applying XOR operations with random number sequences. This segmentation allows the system to create multiple shares where each share contains only a portion of the divided data combined with random numbers, reducing the memory capacity required per share compared to storing complete original data size, while still achieving secure distribution across multiple shares.

Inventive Principle:

Principle #1Segmentation

4Device complexity

If traditional XOR secret sharing is used, then simplicity is maintained, but threshold value settings are limited

Engineering Contradiction:

Improvesystem simplicityVSAvoidthreshold value flexibility

Core Design Contradiction:

Device complexityVSAdaptability or versatility

Solution Approach 1:

The patent introduces dynamic configurability to the XOR-based secret sharing system by allowing flexible setting of threshold values and number of shares. The system can dynamically adjust the parameters k (threshold) and n (total shares) based on security requirements, maintaining the simplicity of XOR operations while achieving adaptability in threshold settings through configurable division and combination rules of multiple divided data pieces.

Inventive Principle:

Principle #15Dynamics

Data Source

PatentUS9680639B2Secret sharing apparatus and secret sharing method that restores secret data from at least two of generated shared data

Publication Date: 2017.06.13 PIECE FUTURE PTE LTD

AI summary

A secret sharing apparatus generates, from secret data, a plurality of pieces of shared data from which the secret data is able to be restored. The secret data includes a plurality of pieces of divided data which does not include a random number. The secret sharing apparatus includes a shared data generating section which performs an XOR operation between the pieces of divided data and generates the plurality of pieces of shared data which includes the result of the XOR operation between the pieces of divided data.