Ciphertext Sorting With Noise-Masked Comparison Privacy

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing data sorting methods for ciphertexts face risks of data leakage, particularly in cryptographic computing, where comparison results can reveal statistical information, compromising privacy security.

Innovation Solution

A data sorting method that updates non-reference ciphertexts with a noise value and a specified parameter, compares them with an updated reference ciphertext, and divides the array into subarrays based on these values, ensuring that equal relationships are not leaked, thus enhancing privacy protection.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If ciphertext sorting is performed using traditional comparison methods, then sorting functionality is achieved, but data leakage risk increases

Engineering Contradiction:

Improvesorting functionalityVSAvoiddata leakage risk

Core Design Contradiction:

Ease of operationVSObject-affected harmful factors

Solution Approach 1:

The patent introduces noise values as an intermediary element between the ciphertexts during comparison. Instead of directly comparing original ciphertexts, the system compares ciphertexts combined with noise values, which masks the true relationships and prevents data leakage while maintaining sorting functionality

Inventive Principle:

Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent modifies the comparison parameter by adding noise values to ciphertexts before comparison. This parameter change transforms the comparison from direct ciphertext comparison to comparison of ciphertext-plus-noise combinations, thereby protecting privacy while enabling sorting

Inventive Principle:

Principle #35Parameter changes

2Reliability

If noise values are added to ciphertexts for privacy protection, then data security is improved, but comparison accuracy may deteriorate

Engineering Contradiction:

Improvedata securityVSAvoidcomparison accuracy

Core Design Contradiction:

ReliabilityVSMeasurement precision

Solution Approach 1:

The patent applies partial action by selectively adding noise values only to certain positions or under certain conditions during the sorting process. This selective approach maintains sufficient comparison accuracy for sorting while providing privacy protection where most needed

Inventive Principle:

Principle #16Partial or excessive action

Solution Approach 2:

The patent performs preliminary actions by pre-processing ciphertexts with noise values before the actual sorting comparison. This preliminary noise addition is carefully controlled to preserve the relative ordering relationships needed for accurate sorting while establishing privacy protection in advance

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS20250362868A1Data sorting methods and apparatuses, devices, and readable storage media

Publication Date: 2025.11.27 ALIPAY (HANGZHOU) INFORMATION TECH CO LTD

AI summary

This specification discloses a data sorting method and apparatus, a device, and a readable storage medium. In the data sorting method provided in this specification, a non-reference ciphertext is updated based on a first noise value corresponding to the non-reference ciphertext and a first specified parameter, and each non-reference ciphertext is compared with an updated reference ciphertext. Further, a to-be-processed array is divided into a plurality of subarrays based on a first comparison result. Each subarray is separately re-used as a to-be-processed array. The above-mentioned comparison process is repeated until each array includes only a single ciphertext. A sorting result of each ciphertext is determined based on a size relationship between the arrays.