Homomorphic Encryption Query Vector for Secure Data Processing

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing encryption methods do not provide end-to-end secure operations for querying data, as they require decryption of queries at intermediate servers, compromising security.

Innovation Solution

The implementation of a homomorphic encryption scheme that allows for the creation of a query vector (Q_V) which is encrypted and can be processed by servers without decryption, ensuring end-to-end security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional encryption methods are used for querying data, then data protection is provided, but the queries must be decrypted at intermediate servers which compromises security

Engineering Contradiction:

ImprovesecurityVSAvoiddecryption operation

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary encryption layer that allows the query to remain encrypted throughout the transmission and processing pipeline. The homomorphic encryption scheme acts as a mediator that enables server processing of encrypted data without requiring decryption at intermediate nodes, thus maintaining security while enabling functional operation.

Inventive Principle:

Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces the traditional mechanical decryption process with a homomorphic encryption mechanism that allows mathematical operations to be performed directly on encrypted data. This substitution eliminates the need for decryption at intermediate servers while preserving the ability to query and process data, thereby improving security without sacrificing functionality.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

2Reliability

If queries are encrypted and processed without decryption, then end-to-end security is achieved, but the encryption scheme complexity increases

Engineering Contradiction:

Improveend-to-end securityVSAvoidencryption scheme

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent utilizes homomorphic encryption parameters that allow the encryption scheme to maintain security while enabling specific mathematical operations. By changing the parameter set of the encryption scheme to support homomorphic properties, the system achieves end-to-end security without requiring excessive complexity in the encryption mechanism itself.

Inventive Principle:

Principle #35Parameter changes

3Reliability

If homomorphic encryption is used to encrypt queries, then unauthorized access is prevented, but the computational overhead increases

Engineering Contradiction:

Improvedata privacyVSAvoidcomputational overhead

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent applies homomorphic encryption selectively to the query components that require security protection, rather than encrypting all data and operations. This partial application of encryption maintains data privacy for critical query elements while reducing the overall computational overhead compared to full encryption of all operations.

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS12309127B2End-to-end secure operations using a query vector

Publication Date: 2025.05.20 ENVEIL INC

AI summary

Systems and methods for an end-to-end secure operation using query vector Q_V having size s. Exemplary methods include: extracting a set of term components {T} of the operation using a term generation function; setting Q_V, j=E(B_j) when H(T)=j for j=0, . . . , (s−1), E(B_j) being a non-zero bitmask corresponding to element T from the set of term components {T} encrypted using a homomorphic encryption scheme E; and setting Q_V, j=E(0) when H(T)≠j for j=0, . . . , (s−1), E(0) being a zero bitmask encrypted using the homomorphic encryption scheme E.