Secure Computation for Encrypted Groupby-Sum With Dummy Records

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing secure computation methods fail to handle database processing with encrypted dummy flag columns, as they assume all records are meaningful, leading to incorrect results due to dummy records affecting the final outcome.

Innovation Solution

A secure computation device that performs Groupby-sum operations on encrypted data with a dummy flag column by sorting and separating dummy records, generating boundary flags, and calculating addition and difference values to output accurate results without decoding.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional secure computation methods are used that assume all records are meaningful, then the computation can be performed on encrypted data, but the results become incorrect due to dummy records affecting the final outcome

Engineering Contradiction:
Improvecomputational accuracyVSAvoidhandling of dummy records
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent segments the data processing by introducing a dummy flag column that separates dummy records from meaningful records. The processing is divided into stages: sorting by key column, identifying boundary records, and selectively processing only non-dummy records. This segmentation allows the system to handle encrypted data with dummy records while maintaining computational accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent extracts and removes dummy records from the processing flow by using the dummy flag column to identify and exclude them. The boundary flag generation unit identifies records that should be processed, and the addition value generation unit calculates sums only for non-dummy records, effectively taking out the harmful dummy records from the computation.

Inventive Principle:
Principle #2Taking out (Extraction)

2Device complexity

If dummy records are included in encrypted database processing, then the data structure remains simple, but the final computation results become incorrect

Engineering Contradiction:
Improvedata structure complexityVSAvoidcomputation result accuracy
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent applies local quality by adding a dummy flag column only to the specific column that needs to distinguish dummy records from meaningful records. The boundary flag generation unit then applies different processing logic to different records based on their dummy flag status, allowing accurate computation while maintaining relatively simple data structure.

Inventive Principle:
Principle #3Local quality

3Ease of operation

If all records are treated as meaningful values, then the processing algorithm is simple, but dummy records affect the final result and prevent obtaining original correct results

Engineering Contradiction:
Improveprocessing algorithm simplicityVSAvoidresult accuracy
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent applies preliminary action by performing sorting by the key column and generating boundary flags before the actual computation. This preliminary organization of data allows the subsequent addition value generation unit to efficiently identify and process only the relevant non-dummy records, maintaining algorithm simplicity while ensuring result accuracy.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20250349228A1Secure computation device, secure computation method, and program
Publication Date: 2025.11.13 NT T INC
  • US20250349228A1 patent drawing
  • US20250349228A1 patent drawing
  • US20250349228A1 patent drawing

AI summary

A secure computation device includes a dummy record separating/sorting unit that sorts a table, a boundary flag generation unit that generates a boundary flag, an addition value generation unit that generates an addition value, a boundary sorting unit that stably sorts a table, a difference value generation unit that generates a difference value, and an operation result output unit that outputs a table.