Secure Computation With Encrypted Values Using Dynamic Encryption Ranks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing computing technologies fail to securely perform calculations with encrypted values, as unauthorized parties can obtain information about intermediate results, compromising the encryption process.

Innovation Solution

A method is introduced where input values are encoded with an initial encryption rank, and subsequent operations modify this rank, ensuring that only the final decoded output is usable, preventing unauthorized access to intermediate results by maintaining an encrypted domain throughout the calculation process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If intermediate results are made accessible during calculation, then ease of operation is improved, but security is worsened as unauthorized parties can obtain information about the encoding process

Engineering Contradiction:
Improveaccess to intermediate resultsVSAvoidsecurity of encryption process
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The calculation process is segmented into multiple operations with different encryption ranks. Each intermediate result is assigned a specific encryption rank that prevents unauthorized decoding, while the final result at rank 0 is made accessible. This segmentation allows the system to maintain security during computation while enabling access to the final decoded output.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different parts of the calculation process have different security properties. Intermediate results maintain high encryption (security), while the final result has low encryption (accessibility). The encryption rank varies locally across different stages of the calculation, allowing simultaneous security and accessibility where appropriate.

Inventive Principle:
Principle #3Local quality

2Reliability

If encryption rank is increased for intermediate results, then security is improved, but loss of information is worsened as unauthorized parties cannot obtain useful output

Engineering Contradiction:
Improvesecurity of intermediate resultsVSAvoiduseability of intermediate results
Core Design Contradiction:
ReliabilityVSLoss of information

Solution Approach 1:

The encryption rank is dynamic rather than static. It changes throughout the calculation process, starting at a higher rank for security and decreasing to 0 for the final accessible result. This dynamic adjustment allows the system to balance security and information usability at different stages.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The encryption rank parameter is changed systematically during the calculation. Each operation modifies the encryption rank according to predefined rules, transforming the encoded values from high-security intermediate form to low-security final form, enabling both protection and eventual usability.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If encoding process is made complex with encryption ranks, then security is improved, but device complexity is worsened

Engineering Contradiction:
Improvesecurity against unauthorized accessVSAvoidcomplexity of encoding process
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The complexity of the encoding process is prepared in advance by establishing a predetermined number of operations and their corresponding encryption ranks. This preliminary setup allows the system to manage complexity systematically rather than ad hoc, reducing the burden during actual execution while maintaining security.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10680796B2Computing with encrypted values
Publication Date: 2020.06.09 KONINKLIJKE PHILIPS NV
  • US10680796B2 patent drawing
  • US10680796B2 patent drawing
  • US10680796B2 patent drawing

AI summary

A secure calculation is performed on at least one input value. The calculation includes a number of operations, with a first operation performed on the input value, and subsequent operations performed on results produced by previous operations. An initial encryption rank is set, based on the number of operations to be performed in the calculation. The input value is encoded, together with the initial encryption rank. The calculation is then performed, such that the first operation is performed on the encoded input value to produce an encoded result, and subsequent operations are performed on respective encoded results produced by previous operations to produce further encoded results. A new encryption rank is set when an operation in the calculation is performed on the encoded input value or on an encoded result produced by a previous operation, such that the encoded result of said operation in the calculation has the new encryption rank. A decoding function provides a useable output value from an encoded result only if the encoded result has an encryption rank that has reached a predefined value.