Cryptographic System Using Universal Basis Vectors for Flexible Attribute Management

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In functional encryption schemes, adding a new attribute category requires generating new pairs of basis Bt and B*t, necessitating the reissuance of public parameters, which is inefficient and inflexible.

Innovation Solution

A cryptographic system that uses a predetermined basis B and basis B* for all attribute categories, allowing the generation of transmission-side and reception-side vectors with specific coefficients, enabling pairing operations to maintain security without the need for new basis pairs when adding an attribute category.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a new pair of basis Bt and B*t is generated for each attribute category, then security is maintained for each category, but the public parameter must be reissued when adding an attribute category

Engineering Contradiction:
ImprovesecurityVSAvoidflexibility to add attribute category
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent applies universality by using a single pair of basis vectors B and B* that serves all attribute categories simultaneously. Instead of generating separate basis pairs (Bt, B*t) for each category t, the system uses one universal basis pair where different attribute categories are represented by different coefficient combinations of the same basis vectors. This allows the public parameter to remain valid across all categories without reissuance, while maintaining security through the mathematical properties of the basis vectors and their duals.

Inventive Principle:
Principle #6Universality (Multi-functionality)

2Reliability

If a new pair of basis Bt and B*t is generated for each attribute category, then category-specific security is ensured, but system complexity increases

Engineering Contradiction:
Improvecategory-specific securityVSAvoidnumber of basis pairs
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent merges multiple category-specific basis pairs into a single shared basis pair (B, B*). Instead of maintaining separate basis vectors for each attribute category, the system combines them by using the same basis vectors for all categories but assigning different coefficient values based on the category and attribute. This reduction from multiple basis pairs to one significantly decreases system complexity while preserving the ability to provide security for each category through the coefficient structure.

Inventive Principle:
Principle #5Merging (Combining)

3Reliability

If a new pair of basis Bt and B*t is generated for each attribute category, then security is maintained, but reissuance of public parameter is required

Engineering Contradiction:
ImprovesecurityVSAvoidtime for reissuing public parameter
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs preliminary action by establishing a single universal basis pair (B, B*) in advance that is designed to accommodate all current and future attribute categories. The basis vectors are constructed with sufficient dimensionality and structure to represent multiple categories without requiring regeneration. This preliminary setup eliminates the need for time-consuming reissuance operations when new categories are added, as the system can simply assign new coefficient combinations to the existing basis vectors.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9407438B2Cryptographic system, cryptographic method, and cryptographic program
Publication Date: 2016.08.02 MITSUBISHI ELECTRIC CORP
  • US9407438B2 patent drawing
  • US9407438B2 patent drawing
  • US9407438B2 patent drawing

AI summary

The present invention aims to allow for addition of an attribute category without reissuing a public parameter. A cryptographic system 10 uses an indexing technique in dual system encryption in dual pairing vector spaces. Specifically, for a transmission-side vector tj for index j, the cryptographic system 10 sets information J assigned to the index j in advance as a coefficient of a predetermined basis vector. For a reception-side vector for index j′ corresponding to the index j, the cryptographic system 10 sets information J′ having an inner-product of 0 with the information J as a coefficient of a basis vector corresponding to the predetermined basis vector.