Secure Fragment Conversion Across Rings With Overflow Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional secure fragment conversion methods for protecting privacy data are inefficient, failing to achieve high efficiency in implementing fragment conversion between rings of different sizes.
Innovation Solution
A secure-fragment-conversion method that splits privacy data into fragments and uses multi-party joint computation to update local fragments with an offset, compute overflow bits, and obtain converted fragments in a second ring, ensuring privacy is protected and efficiency is maintained.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional secure fragment conversion methods are used, then privacy data is protected, but conversion efficiency is low
Solution Approach 1:
The patent segments the fragment conversion process into distinct phases: offset addition phase, multi-party joint computation phase for overflow bit calculation, and converted fragment generation phase. Each party independently computes their local fragments and shares only necessary intermediate results, enabling parallel processing that improves conversion efficiency while maintaining privacy protection through distributed computation.
Solution Approach 2:
The patent applies preliminary action by pre-computing offset values and preparing fragment structures before the actual conversion process. Parties pre-process their local fragments by adding offsets and preparing for multi-party joint computation, which reduces the computational burden during the actual conversion and improves overall efficiency without compromising security.
2Adaptability or versatility
If fragment conversion is performed between rings of different sizes, then secret sharing functionality is enhanced, but computational complexity increases
Solution Approach 1:
The patent changes parameters by systematically varying the ring sizes (different moduli values) to adapt to different secret sharing requirements. The method handles conversions between rings of different sizes by computing overflow bits and adjusting fragments according to the target ring's modulus, enabling flexible adaptation to various functionality requirements while managing computational complexity through efficient algorithms.
Solution Approach 2:
The patent introduces an intermediary mechanism through the use of overflow bits and intermediate fragment representations. During conversion between rings of different sizes, parties compute intermediate values that bridge the gap between different ring structures, allowing seamless transitions while keeping the complexity manageable through structured intermediate steps rather than direct complex transformations.
3Reliability
If multi-party joint computation is used, then privacy protection is maintained, but communication overhead increases
Solution Approach 1:
The patent extracts and processes only the necessary components for secure computation. Instead of exchanging complete fragment sets among all parties, each party extracts and shares only the specific intermediate results needed for overflow bit computation. This selective extraction reduces communication overhead while maintaining privacy protection through multi-party joint computation on the essential elements.
Solution Approach 2:
The patent applies partial action by having parties perform computations on only the portions of data necessary for the conversion task. Rather than fully processing and communicating all fragment information, parties compute and share partial results (overflow bits and intermediate fragments) that are sufficient for achieving the conversion goal while minimizing communication requirements.
Data Source
AI summary
In an implementation, a first party or a third party updates, by adding an offset to the first fragment, two local fragments held by the local party, where the offset enables offset data obtained by performing addition on updated fragments of each party to be greater than or equal to 0. Multi-party joint computation is performed by using the two updated local fragments together with fragments held by the other two parties to obtain two overflow fragments of an overflow bit and in a second ring for performing a modulo operation on a second value of an n power of 2, m is less than n; and the overflow bit indicates whether the offset data is greater than or equal to the first value. Two converted fragments are obtained in the second ring based on the two updated local fragments, the two overflow fragments, and the offset.