PEKS Data Search Device Using Category-Specific DB Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Public-key Encryption with Keyword Search (PEKS) systems face inefficiencies in search processing time, as they often require searching through all data, leading to increased processing time with larger datasets and inefficiencies in handling multiple search requests.

Innovation Solution

A data search device and method that utilizes a data storage unit, key-determination information storage, and a search condition input unit to decrypt and select relevant data groups for search queries, allowing for targeted searches within specific data groups rather than the entire dataset.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If PEKS searches through all data files to ensure complete search results, then search reliability is improved, but search processing time increases significantly

Engineering Contradiction:
Improvesearch reliabilityVSAvoidsearch processing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent divides the encrypted database into multiple data groups, each associated with a specific decryption key. Instead of searching through all data files sequentially, the system segments the search space and only processes relevant groups based on the search query and key-determination information, thereby reducing search time while maintaining reliability through targeted decryption and verification

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs preliminary actions by pre-establishing data groups with their corresponding decryption keys and key-determination information before actual search operations. This allows the search process to directly access pre-organized data structures rather than performing exhaustive searches, reducing processing time while ensuring complete search results through the preliminary organization of data

Inventive Principle:
Principle #10Preliminary action

2Reliability

If PEKS searches through all data files to maintain comprehensive search coverage, then search completeness is improved, but device complexity increases

Engineering Contradiction:
Improvesearch completenessVSAvoidsearch process complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the database into multiple data groups with associated decryption keys, creating a structured organization that simplifies the search process. The search algorithm only needs to process relevant groups rather than all data, reducing computational complexity while maintaining comprehensive search coverage through the segmented structure

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces key-determination information as an intermediary element that mediates between the search query and the data groups. This intermediary allows the system to determine which data groups are relevant without examining all data, simplifying the search process while ensuring completeness through the intermediary's role in filtering and directing search operations

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If PEKS processes all search requests sequentially through the entire database, then search accuracy is maintained, but processing efficiency decreases

Engineering Contradiction:
Improvesearch accuracyVSAvoidprocessing efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent segments the search process into targeted operations on specific data groups rather than sequential processing of all data. By dividing the database into manageable groups with associated keys, the system can process multiple search requests more efficiently, improving productivity while maintaining accuracy through the segmented approach that ensures all relevant data is examined

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs preliminary organization of data into groups with associated keys and key-determination information, enabling faster processing of subsequent search requests. This preliminary action allows the system to maintain search accuracy by ensuring all relevant data is properly organized while significantly improving processing efficiency through reduced search scope

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUSRE48146E1Data search device, data search method, computer readable medium storing data search program, data registration device, data registration method, computer readable medium storing data registration program, and information processing device
Publication Date: 2020.08.04 MITSUBISHI ELECTRIC CORP
  • USRE48146E1 patent drawing
  • USRE48146E1 patent drawing
  • USRE48146E1 patent drawing

AI summary

A data search server stores a system ciphertext including a data ciphertext and a keyword ciphertext in each category-specific DB unit for each data category, and stores each category-determination secret key being associated with each category-specific DB unit. A search request receiving unit receives from a data search terminal a search request including a search trapdoor and an index tag. A data searching unit searches for a category-determination secret key with which the index tag is decrypted to the same value as a key-determination value. Using the search trapdoor, the data searching unit performs a search of a Public-key Encryption with Keyword Search scheme on system ciphertexts in a category-specific DB unit associated with this category-determination secret key. A search result transmitting unit transmits to the data search terminal a data ciphertext included in a system ciphertext which has been found as a hit in the search.