Deidentified Content Surrogates for Privacy-Safe ML Training

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing medical data privacy laws and contractual limitations restrict the long-term storage and usage of user data for training machine learning models, necessitating a method to deidentify personal information while allowing secure sharing for training purposes.

Innovation Solution

A two-step hashing process using a first hashing algorithm (H1) to replace personal information with mathematical representations and a second hashing algorithm (H2) to generate surrogates, enabling secure sharing of deidentified content for training machine learning models without risking reversal to personal information.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If personal information is stored and used for training machine learning models, then model training accuracy is improved, but data privacy compliance deteriorates

Engineering Contradiction:
Improvemodel training accuracyVSAvoiddata privacy compliance
Core Design Contradiction:
Measurement precisionVSReliability

Solution Approach 1:

The patent extracts personal information from the data and replaces it with hashed mathematical representations. This separation allows the data to be used for model training while the personal information remains securely stored in hash form that cannot be reversed, thus maintaining both training accuracy and privacy compliance.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent introduces hashing algorithms (H1 and H2) as intermediaries between personal information and machine learning models. These hash functions transform personal information into mathematical representations that preserve statistical properties for training purposes while making the original information irretrievable, serving as a mediator that satisfies both training needs and privacy requirements.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Device complexity

If deidentification is performed using a single hashing algorithm, then processing simplicity is maintained, but security against reversal deteriorates

Engineering Contradiction:
Improvehashing process simplicityVSAvoidsecurity against reversal
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent segments the hashing process into two distinct algorithms: H1 for initial hashing of personal information and H2 for generating surrogates from the hashed representations. This segmentation creates multiple layers of security where each hash function protects against reversal of the previous one, while maintaining clear separation of concerns in the processing pipeline.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from a single-dimensional hashing approach to a two-dimensional hashing structure. The first dimension (H1) transforms personal information to mathematical representations, and the second dimension (H2) transforms those representations to surrogates. This dimensional expansion creates additional security layers without significantly complicating the overall process.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS20250342276A1System and method for generating deidentified content
Publication Date: 2025.11.06 MICROSOFT TECHNOLOGY LICENSING LLC
  • US20250342276A1 patent drawing
  • US20250342276A1 patent drawing
  • US20250342276A1 patent drawing

AI summary

A method, computer program product, and computing system for processing raw content to identify personal information; replacing the personal information within the raw content with a first mathematical representation of the personal information generated using a first hashing algorithm, thus defining deidentified content; and defining a selected surrogate for the first mathematical representation, wherein the selected surrogate has a second mathematical representation generated using a second hashing algorithm that is equivalent to the first mathematical representation of the personal information that was generated using the first hashing algorithm.