Key-Policy Attribute-Based Encryption Using Pairing-Friendly Curves
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing attribute-based encryption (ABE) schemes face inefficiencies, security limitations, and complexity in deployment, making them unsuitable for widespread adoption in real-world applications.
Innovation Solution
A method for implementing key-policy attribute-based encryption using pairing-friendly elliptic curves, which enhances efficiency, security, and flexibility by optimizing ciphertext and key sizes, encryption and decryption speeds, and security guarantees.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If existing attribute-based encryption schemes are implemented, then fine-grained access control is achieved, but encryption and decryption speeds are slow
Solution Approach 1:
The patent segments the attribute-based encryption process by separating the access policy evaluation from the actual decryption operation. The ciphertext is divided into multiple components corresponding to different attributes, and the decryption key is structured to efficiently evaluate the access policy. This segmentation enables parallel processing of attribute matching, significantly improving decryption speed while maintaining security.
Solution Approach 2:
The patent changes critical parameters of the encryption scheme by using asymmetric (Type-III) pairing-friendly elliptic curves with optimized group orders. By carefully selecting parameters such as the security parameter λ and the group order p, the patent achieves both high-speed computation and strong security guarantees. The parameter optimization reduces the computational complexity of pairing operations, directly improving encryption and decryption speeds.
2Reliability
If existing attribute-based encryption schemes are implemented, then security is provided, but ciphertext and key sizes are large
Solution Approach 1:
The patent extracts and eliminates redundant elements from the ciphertext and key structures. By using a compact representation of attribute encodings and removing unnecessary cryptographic components, the patent reduces ciphertext size by approximately 30% compared to existing schemes. The key structure is optimized by extracting only the essential elements needed for decryption, reducing key sizes while maintaining equivalent security levels.
Solution Approach 2:
The patent employs composite cryptographic structures that combine multiple cryptographic primitives into unified, space-efficient formats. The encryption scheme integrates symmetric and asymmetric cryptography, along with hash functions, into a composite structure that achieves strong security guarantees with reduced overall size. This composite approach allows the system to leverage the strengths of different cryptographic methods while minimizing the total data overhead.
3Adaptability or versatility
If existing attribute-based encryption schemes are implemented, then access control is enabled, but deployment complexity is high
Solution Approach 1:
The patent creates a universal attribute-based encryption framework that can handle multiple access control policies and attribute types through a single unified interface. The system supports both ciphertext-policy and key-policy ABE modes, as well as various access structures (threshold, AND, OR, hierarchical), using the same core cryptographic primitives. This universality simplifies deployment by eliminating the need for separate implementations of different ABE variants.
Solution Approach 2:
The patent introduces an intermediary attribute encoding layer that mediates between the access policy definition and the cryptographic operations. This encoding layer translates high-level access control requirements into cryptographic parameters, shielding users from the underlying complexity. The intermediary structure allows policy administrators to define access controls using intuitive rules rather than complex cryptographic configurations, significantly reducing deployment complexity.
Data Source
AI summary
The present disclosure provides a method for key-policy attribute-based encryption. The method includes receiving a message to be encrypted, a master public key, and a set of attributes. A random integer s is sampled between 1 and a prime integer p, where p is established by a pairing-friendly curve comprising three groups of two source groups and one target group. Every attribute in the set is hashed to a first source group of the pairing-friendly curve and multiplied by s to generate a set of attribute encodings. A target group element in the master public key is multiplied by s to generate a blinding factor. The message is masked with the blinding factor. A ciphertext is computed comprising the masked message, the set of attributes, the set of attribute encodings, and an encoding of s in a second source group of the pairing-friendly curve. The ciphertext is then outputted.


