Encrypted Reach And Frequency Computation With Collision Detection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Computing the union, intersection, or frequency of large sets of data distributed across multiple sources involves sharing private or protected information, which negatively impacts privacy and security, and existing methods face scalability and computational resource exhaustion issues.

Innovation Solution

A method and system for zero-knowledge cryptographic computation of reach and frequency histograms using encrypted data structures, employing additively homomorphic encryption and probabilistic data structures like bloom filters, enabling secure and differentially private data processing across multiple parties without exposing private information.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If data from multiple sources is shared to compute union, intersection, or frequency, then computation accuracy is improved, but privacy and security are worsened

Engineering Contradiction:
Improvecomputation accuracyVSAvoidprivacy and security risk
Core Design Contradiction:
Measurement precisionVSObject-affected harmful factors

Solution Approach 1:

The patent introduces an intermediary encryption layer that allows data to be processed without exposing its contents. Encrypted data structures serve as a mediator between data sources and computation results, enabling accurate frequency and reach calculations while preventing direct access to private information. The encryption acts as a protective barrier that maintains both computational accuracy and data privacy.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent creates encrypted copies of data structures that preserve the necessary computational properties without revealing the original data. These encrypted representations allow multiple data sources to contribute to unified computations while each source maintains control over its private information. The encrypted copies enable accurate frequency calculations without exposing the underlying private data.

Inventive Principle:
Principle #26Copying

2Measurement precision

If large sets of data are processed to compute reach and frequency, then measurement accuracy is improved, but computational resources and network bandwidth are worsened

Engineering Contradiction:
Improvereach and frequency estimation accuracyVSAvoidcomputational resources and network bandwidth
Core Design Contradiction:
Measurement precisionVSUse of energy by moving object

Solution Approach 1:

The patent divides large datasets into encrypted data structures that can be processed in manageable segments. Each data source contributes encrypted representations of its data, which are then combined through homomorphic operations. This segmentation allows accurate reach and frequency computation across large datasets while reducing the computational burden on any single system and minimizing network bandwidth requirements compared to transmitting and processing raw data.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms data parameters through encryption and homomorphic operations, changing the representation of data from raw form to encrypted form that preserves mathematical properties. This parameter transformation enables accurate frequency and reach calculations without requiring processing of the full raw datasets, thereby reducing computational resources and network bandwidth requirements while maintaining measurement accuracy.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20250343670A1Cryptographic Computation Techniques for Multi-Party Reach and Frequency
Publication Date: 2025.11.06 GOOGLE LLC
  • US20250343670A1 patent drawing
  • US20250343670A1 patent drawing
  • US20250343670A1 patent drawing

AI summary

Systems and methods for detecting a collision when combining a first encrypted data structure and a second encrypted data structure are disclosed. The system can receive the first encrypted data structure representative of a first plurality of registers. Each register in the first plurality of registers can have an encrypted fingerprint value, and an encrypted register identifier value. The system can receive the second encrypted data structure representative of a second plurality of registers. The system can calculate a first sum associated with a first register of the first plurality of registers based on the fingerprint value of the first register. The system can calculate a second sum associated with a second register of the second plurality of registers. The system can determine a validity bit associated with the collision based on a comparison of the first sum and the second sum.