Searchable Public-Key Encryption Using Segmented Pairing Algorithms

Solution Overview

Problem

Existing searchable public-key encryption schemes are inefficient in generating searchable ciphertexts and searching data, particularly in multi-user scenarios and cloud-assisted wireless sensor networks, due to high computational costs and complex cryptographic operations.

Innovation Solution

A method and system for searchable public-key encryption that simplifies cryptographic operations by using a first encryption algorithm with pairing for initial keyword encryption and a second algorithm without pairing for subsequent encryptions, reducing computational load and improving search efficiency through an implication relation between ciphertexts.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a first encryption algorithm with pairing operation is used for initial keyword encryption, then semantic security is maintained, but computational cost increases

Engineering Contradiction:

Improvesemantic securityVSAvoidcomputational cost

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The encryption process is segmented into two distinct algorithms: a first encryption algorithm using pairing operations for initial keyword encryption to ensure semantic security, and a second encryption algorithm without pairing operations for subsequent encryptions to reduce computational cost. This segmentation allows the system to balance security requirements with efficiency demands in different operational phases.

Inventive Principle:

Principle #1Segmentation

2Reliability

If pairing operations are performed for every keyword encryption, then security is maintained, but search efficiency deteriorates

Engineering Contradiction:

ImprovesecurityVSAvoidsearch efficiency

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The encryption process is segmented into two distinct algorithms: a first encryption algorithm using pairing operations for initial keyword encryption to ensure semantic security, and a second encryption algorithm without pairing operations for subsequent encryptions to reduce computational cost. This segmentation allows the system to balance security requirements with efficiency demands in different operational phases.

Inventive Principle:

Principle #1Segmentation

3Reliability

If complex cryptographic operations are used in searchable public-key encryption, then security is improved, but device complexity increases

Engineering Contradiction:

ImprovesecurityVSAvoidcryptographic operation complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The encryption process is segmented into two distinct algorithms: a first encryption algorithm using pairing operations for initial keyword encryption to ensure semantic security, and a second encryption algorithm without pairing operations for subsequent encryptions to reduce computational cost. This segmentation allows the system to balance security requirements with efficiency demands in different operational phases.

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS10673612B2Method of searchable public-key encryption and system and server using the same

Publication Date: 2020.06.02 HUAZHONG UNIV OF SCI & TECH

AI summary

The present invention involves with a method of searchable public-key encryption, a system and server using the method.