Secure Table Reference System Reducing Communication Volume
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation techniques for referencing lookup tables while maintaining secrecy result in a relatively large communication volume.
Innovation Solution
A secure table reference system comprising multiple secure computation apparatuses that combine, calculate differences, permute, and apply inverse permutations to input and output vectors, reducing communication volume by generating shares of combined and sorted vectors efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If secure table reference is performed using conventional techniques, then secrecy is maintained, but communication volume becomes large
Solution Approach 1:
The patent segments the secure table reference process into multiple distinct modules: combination module (combining input vectors with lookup table indices), sorting module (sorting combined vectors), permutation module (applying permutations to sorted results), and inverse permutation module (reversing permutations to retrieve final results). Each module processes only necessary data portions, reducing overall communication volume while maintaining secrecy through shared secret computation among multiple parties.
Solution Approach 2:
The patent performs preliminary sorting of combined vectors before applying permutations. By sorting the combined vectors (comprising input values and lookup table indices) in advance, the system establishes a deterministic order that reduces the search space and minimizes the data that needs to be communicated during the permutation phase, thereby reducing communication volume while preserving secrecy.
2Productivity
If communication volume is reduced in secure computation, then efficiency improves, but computation complexity increases
Solution Approach 1:
The patent divides the secure computation system into multiple specialized modules: combination parts that merge input vectors with lookup table indices, difference calculation parts that compute differences between sorted elements, permutation calculation parts that generate sorting permutations, permutation application parts that apply permutations to results, vector generation parts that construct output vectors, and inverse permutation parts that reverse permutations. This segmentation allows each module to perform specialized computations efficiently, reducing overall communication volume while distributing computational complexity across multiple components.
Solution Approach 2:
The patent introduces intermediate data structures and computation steps as mediators: combined vectors that merge input data with lookup table indices, sorted versions of these combined vectors, and permutation sequences that map between different orderings. These intermediaries facilitate efficient computation by breaking down complex secure table reference operations into manageable steps, reducing direct communication requirements between parties while maintaining computational correctness.
Data Source
AI summary
A secure table reference system includes a first combining part 11n for generating [v′] of v′∈ Fm+nt in which d and v are combined, a difference calculation part 12n for generating [r″] of r″ that has a difference between a certain element of r and an element before the certain element as an element corresponding to the certain element, a second combining part 13n for generating [r′] of r′∈ Fm+nt in which r″ and an m-dimensional zero are combined, a permutation calculation part 14n for generating {{σ}} of a permutation σ that stably sorts v′ in ascending order, a permutation application part 15n for generating [s] of s: =σ(r′) obtained by applying the permutation σ to r′, a vector generation part 16n for generating [s′] of a prefix-sum s′ of s, an inverse permutation application part for generating [s″] of s″ obtained by applying an inverse permutation σ−1 of the permutation σ to s′, and an output part 17n for generating [x] of x ∈ Fm consisting of (nt+1)th and subsequent elements of s″.