Revocable attribute encryption method based on complete binary tree
A complete binary tree and attribute encryption technology, applied in the field of revocable attribute encryption, which can solve the problems of incomplete revocation user information and high complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0034] The present invention will be described in detail below in combination with specific embodiments.
[0035] The present invention is based on a revocable attribute encryption method of a complete binary tree, which is specifically implemented according to the following steps:
[0036] Step 1. System parameter initialization:
[0037] Specifically follow the steps below to implement:
[0038] Input security parameter λ, randomly select α∈Z p , where Z p ={0,1,...,p-1}, use the set {1,2,...,m} to represent the attribute set, where m is the maximum number of attributes in the system, use each The leaf node represents the unique identifier of a user, defines the set of all users in the system as U, and converts U into in Represents the set of all leaf nodes converted from all users, so that Is the node set in the binary tree determined according to the naming rules of the system, for each leaf node make Indicates the path from the leaf node to the root node, for...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com