Secure Table Deduplication With Sort-Key Record Retention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation systems face challenges in designating a specific record to be left during overlap deletion in tables, leading to unpredictable record retention after deletion.
Innovation Solution
An analysis device that performs sorting and deletion of records using secure computation, allowing for the designation of a specific record to be retained during overlap deletion by utilizing a second key different from the first key for sorting and deleting records other than the designated one.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If secure computation is used for overlap deletion, then data security is maintained, but the ability to designate a specific record to be left is lost
Solution Approach 1:
The patent introduces a sorting key as an intermediary mechanism that enables record identification without revealing data. By sorting records based on a secondary key (e.g., entry date) before deletion, the system can deterministically identify which record to retain (e.g., the latest record) while maintaining secure computation. The sorting key acts as a mediator that provides ordering information necessary for record designation without compromising data confidentiality.
Solution Approach 2:
The patent applies preliminary sorting to records before performing overlap deletion. By pre-sorting records based on a secondary key in ascending or descending order, the system establishes a deterministic sequence that identifies which record should be retained. This preliminary action enables the deletion process to systematically keep the desired record (e.g., first or last in the sorted sequence) while maintaining secure computation throughout the process.
2Ease of manufacture
If random record selection is used for overlap deletion, then implementation simplicity is achieved, but predictable record retention cannot be ensured
Solution Approach 1:
The patent changes the parameter basis for record selection from random selection to deterministic sorting. By introducing a sorting key and specifying sort order (ascending/descending), the system transforms the deletion process from unpredictable to fully deterministic. The record to be retained is determined by its position in the sorted sequence (e.g., first or last record), providing complete predictability while maintaining implementation feasibility through standard sorting operations.
Data Source
AI summary
An analysis device according to an embodiment includes a sorting unit and a deletion unit. The sorting unit sorts records of a table including records in which values of a first key (overlap deletion key) overlap by secure computation using a second key (sort key) different from the first key. The deletion unit deletes records other than one record at a predetermined position in a set by secure computation for each of the sets of the records which is included in the table subjected to sorting by the sorting unit and in which the first key overlaps.