Encrypted Data Insertion in Partially Ordered Sets

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In medical data management systems, indexes used for faster data retrieval can become a security risk due to potential unauthorized access, necessitating secure and efficient methods for data insertion and manipulation.

Innovation Solution

A computer system and method for inserting encrypted data items into a partially ordered set, where the client system determines the insert position, sorts, and encrypts the data items, allowing the server to insert them consecutively in sorted order without decrypting the data, thereby ensuring secure access and minimizing traversal of the data structure.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If indexes are used to improve data retrieval speed, then data access efficiency is improved, but security risk increases due to potential unauthorized access

Engineering Contradiction:
Improvedata retrieval speedVSAvoidsecurity risk
Core Design Contradiction:
SpeedVSObject-affected harmful factors

Solution Approach 1:

The patent applies preliminary action by encrypting data items before they are inserted into the index structure. The client system encrypts data items using the first encryption method before transmission to the server, ensuring that sensitive medical data is protected from unauthorized access while still allowing the index to function for efficient retrieval. This pre-encryption approach resolves the contradiction by maintaining both speed (through indexing) and security (through encryption).

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes the state of data items from unencrypted to encrypted form while maintaining their structural properties in the index. By transforming the encryption parameter and using order-preserving encryption techniques, the system allows encrypted data items to maintain their sorted order and positional relationships, enabling fast retrieval through the index without exposing the actual data content. This parameter change resolves the security risk while preserving retrieval speed.

Inventive Principle:
Principle #35Parameter changes

2Object-affected harmful factors

If data items are encrypted before insertion, then data security is improved, but insertion complexity increases

Engineering Contradiction:
Improvedata securityVSAvoidinsertion complexity
Core Design Contradiction:
Object-affected harmful factorsVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by performing encryption at the client side before data transmission. The client system encrypts multiple data items using the first encryption method before sending them to the server, which simplifies the server's insertion process. The server only needs to insert already-encrypted data items into the index structure without performing decryption or complex encryption operations, thus reducing insertion complexity on the server side while maintaining high security standards.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary encryption layer that translates between the need for security and the need for simple insertion operations. The encryption system acts as an intermediary that transforms data into a secure format that can still be efficiently indexed and retrieved. This intermediary layer resolves the contradiction by making encrypted data insertion as simple as unencrypted insertion from the server's perspective, while maintaining strong security through the encryption mechanism.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Object-affected harmful factors

If multiple encrypted data items are inserted consecutively, then data security is maintained, but insertion time increases

Engineering Contradiction:
Improvedata securityVSAvoidinsertion time
Core Design Contradiction:
Object-affected harmful factorsVSLoss of time

Solution Approach 1:

The patent merges multiple insertion operations into a single batch processing operation. The client system encrypts multiple data items and sends them to the server in one operation, and the server inserts all encrypted items consecutively without performing separate authentication or decryption steps for each item. This merging of operations maintains security (by keeping data encrypted throughout) while significantly reducing the total insertion time compared to individual insertions.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent ensures continuity of useful action by maintaining the encrypted state of data items throughout the entire insertion process. The server continuously inserts encrypted data items into the index structure without interrupting the process to decrypt or re-encrypt data. This continuous insertion of already-encrypted items maintains security while optimizing insertion speed, as the encryption/decryption overhead occurs only once at the client side before the continuous insertion sequence begins.

Inventive Principle:
Principle #20Continuity of useful action

Data Source

PatentUS10439992B2System for accessing data
Publication Date: 2019.10.08 COMPUGRP MEDICAL SE
  • US10439992B2 patent drawing
  • US10439992B2 patent drawing
  • US10439992B2 patent drawing

AI summary

The present disclosure relates to a computer system for inserting multiple data items in a relation, the relation being stored on a server computer of the computer system, the relation comprising data items, wherein the data items are encrypted with a first encryption method in the relation, wherein the data items form a partially ordered set in the relation, the partial order being formed with respect to the data items in non-encrypted form. The computer system further comprises a client system, wherein for inserting multiple encrypted data items in the partially ordered set: the client system is configured for determining that the multiple data items have a same insert position in the partially ordered set; sorting the multiple encrypted data items in accordance with a linear order corresponding to the order in which the encrypted data items are stored in the relation with respect to the partial ordered set, wherein depending on the insert position the sorting is performed in ascending or descending order; encrypting the multiple data items using the first encryption method; and the server system is configured for inserting the encrypted data items in the partially ordered set consecutively in their sorted order.