Broadcast Encryption Revocation via CP-ABE and Key Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current broadcast encryption systems face limitations in efficiently managing both temporary and permanent user revocation, leading to performance penalties, security issues, and overhead due to the complexity of maintaining user lists and potential collusion between authorized and revoked users.
Innovation Solution
A broadcast encryption scheme that combines Cipher-text Policy Attribute-Based Encryption (CP-ABE) with public-key cryptography, enabling both temporary and permanent revocation by using a Master Secret Key (MSK) and Public Parameters (PP) to generate and update secret keys, ensuring only authorized users can decrypt content, while preventing revoked users from accessing future messages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If temporary revocation is implemented by inserting revoked user IDs into the ciphertext, then unauthorized users cannot decrypt the content, but the ciphertext size and encryption complexity increase with the number of revoked users
Solution Approach 1:
The patent divides the revocation mechanism into two separate components: temporary revocation handled through ciphertext policies and permanent revocation handled through key management. This segmentation allows each mechanism to optimize for its specific purpose without the other's overhead, resolving the contradiction between security and complexity.
Solution Approach 2:
The patent extracts the permanent revocation functionality from the temporary revocation mechanism by implementing a separate key update system. When a user is permanently revoked, their secret key is updated to invalidate future decryption capability, while temporary revocation only affects specific ciphertexts. This extraction eliminates the need to track permanent revocations in the ciphertext policy.
2Adaptability or versatility
If the broadcaster maintains lists of revoked and authorized users for temporary revocation, then decryption authorization can be controlled per message, but the overhead and security risks increase with growing user lists
Solution Approach 1:
The patent segments the revocation information into two parts: permanent revocation status stored in the user's secret key and temporary revocation policy embedded in the ciphertext. This segmentation eliminates the need for the broadcaster to maintain and transmit complete user lists, as each user independently knows their permanent status and the ciphertext specifies temporary restrictions.
Solution Approach 2:
The system enables self-service revocation management where users automatically update their own secret keys based on permanent revocation decisions, and the temporary revocation policy is self-contained in the ciphertext. This eliminates the need for the broadcaster to actively manage and distribute user lists, reducing data overhead significantly.
3Reliability
If permanent revocation is implemented by updating user secret keys, then revoked users cannot decrypt future messages, but the key management complexity increases
Solution Approach 1:
The patent merges the temporary and permanent revocation mechanisms into a unified system where the secret key structure accommodates both functionalities. The secret key contains components that enable automatic validation against both permanent revocation status and temporary policy requirements, simplifying key management while maintaining both revocation types.
Solution Approach 2:
The secret key structure is designed with multi-functionality to handle both permanent and temporary revocation scenarios. A single key update operation can enforce permanent revocation, while the same key works with ciphertext policies to enforce temporary revocation, eliminating the need for separate key management systems.
4Adaptability or versatility
If separate key management and content distribution functions are implemented, then multiple content providers can access the system, but symmetric-key encryption cannot be used since the key manager cannot share all keys
Solution Approach 1:
The patent replaces the symmetric-key mechanical system with a public-key cryptographic system. Instead of physically sharing secret keys between the key manager and content providers, the system uses public keys for encryption and private keys for decryption, allowing secure content distribution without key sharing while maintaining system flexibility.
Data Source
AI summary
A broadcast encryption method that allows a broadcaster to send encrypted content to a set of users such that only a subset of authorized users can decrypt the content, and to perform both temporary and permanent revocation of users. Accordingly, during a Setup stage, a Key Service generates a public key and a Master Secret Key (MSK) and sends the Public Parameters PP used to generate the public key to a broadcaster and to all users. The broadcaster uses the Public Parameters PP to create a message M, with which the broadcaster encrypts the content, and further creates a Cipher Text (CT), which is sent to all users. During a Key Gen stage, whenever a user wishes to decrypt the message M for decrypting the content, the user sends a request with his ID1 to the Key Service. The Key Service generates a corresponding secret key SKID1 and the secret key SKID1 is sent to the user ID1 via a secure data channel. During a Decrypt stage, the user uses the secret key SKID1, to decrypt the Cipher Text (CT) and obtain the message M. During a Revoke stage of k users (k=1, 2, 3, . . . ) a State Update Message (SUM) which is sent to all users, is provided and each user updates his state with the SUM he received, such that the k users having identities ID1, ID2, . . . IDk will not be able to update their state and will be permanently revoked, while all the remaining users being admitted users will be able to update their state and will not be revoked. Temporary revocation is done by inserting a list of IDs (ID1, ID2, . . . IDk) to be revoked into the CT.