Functional Encryption for Arbitrary-Length String Pattern Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing functional encryption systems are limited to fixed-size inputs, restricting their application in scenarios requiring encryption based on arbitrary-length strings or patterns, such as network logging, database encryption, and pattern recognition in multimedia data.
Innovation Solution
The implementation of a deterministic finite automata-based system that supports regular languages, allowing encryption and decryption based on arbitrary-length strings, using bilinear groups and a setup, encryption, private secret key generation, and decryption process to manage and verify string patterns.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If functional encryption systems use fixed-size inputs, then the system complexity is reduced and security is easier to manage, but the applicability to arbitrary-length strings and patterns is limited
Solution Approach 1:
The patent segments the arbitrary-length input string into fixed-size blocks that can be processed individually through the functional encryption system. Each block is handled separately using the existing fixed-size functional encryption primitives, allowing the system to accommodate variable-length inputs without increasing the fundamental complexity of the encryption mechanism.
Solution Approach 2:
The patent introduces a new dimension of processing by organizing fixed-size functional encryption operations into a structured sequence that handles arbitrary-length inputs. This dimensional transformation allows the system to process variable-length data through fixed-size operations, effectively resolving the contradiction between input flexibility and system complexity.
2Adaptability or versatility
If functional encryption systems support regular languages and unbounded languages, then the versatility for pattern recognition is enhanced, but the computational complexity increases
Solution Approach 1:
The patent divides pattern recognition tasks into sequential processing of fixed-size input blocks, where each block is evaluated against the regular language pattern independently. This segmentation allows the system to recognize complex patterns in arbitrary-length strings without requiring the entire string to be processed simultaneously, thereby maintaining computational efficiency while supporting regular languages.
Solution Approach 2:
The patent implements continuous processing of input data through a stream of fixed-size blocks, where each block contributes to the overall pattern recognition decision. This continuous action allows the system to efficiently evaluate regular languages over unbounded inputs by maintaining a cumulative state across blocks, avoiding the need for exhaustive reprocessing and preserving computational productivity.
3Measurement precision
If the encryption system processes arbitrary-length strings, then the measurement precision for pattern matching is improved, but the loss of time for processing increases
Solution Approach 1:
The patent segments arbitrary-length strings into fixed-size blocks that are processed in sequence, with each block contributing to the pattern matching decision. This segmentation enables precise pattern matching across the entire input by evaluating each segment against the regular language pattern, while avoiding the need to hold and process the entire arbitrary-length string simultaneously, thus reducing processing time.
Solution Approach 2:
The patent performs preliminary processing of each fixed-size block independently before combining results for the final pattern matching decision. This preliminary action on individual blocks allows the system to prepare pattern matching data in advance for each segment, improving measurement precision for the overall pattern while reducing the time required for final evaluation by avoiding exhaustive processing of the complete arbitrary-length input at once.
Data Source
AI summary
Systems and methods for functional encryption systems that support regular languages and, thereby strings of arbitrary length, are provided. The disclosed systems and methods can encrypt data using public parameters and an arbitrary string. The arbitrary string can be included within the ciphertext as plaintext. A decryption key is generated that includes a representation of a regular language. The encrypted message can be decrypted only if the arbitrary string in the ciphertext is in the set of strings that comprise the regular language associated with the decryption key being used.