Supercharge Your Innovation With Domain-Expert AI Agents!

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

Active Publication Date: 2015-12-23
重庆涔信科技有限公司
View PDF3 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a revocable attribute encryption method based on a complete binary tree, which solves the problem of high complexity of the attribute encryption method and incomplete revocation of user information in the prior art

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Revocable attribute encryption method based on complete binary tree
  • Revocable attribute encryption method based on complete binary tree
  • Revocable attribute encryption method based on complete binary tree

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention discloses a revocable attribute encryption method based on a complete binary tree. The method comprises the steps of firstly carrying out system parameter initialization, then carrying out a key generation process, carrying out encryption, and finally carrying out decryption. According to the method, the technology that all information of a node corresponding user is revoked after revoking a binary tree leaf node is realized, through the intersection of the corresponding path of the user in the binary tree and the coverage set corresponding to a revoking list, whether the user has decryption ability is judged, once the user is revoked, the user does not have the decryption ability any more, and the overall safety of the scheme is proved based on a determination bilinear Diffie-Hellman problem.

Description

technical field [0001] The invention belongs to the technical field of information security, and in particular relates to a revocable attribute encryption method based on a complete binary tree. Background technique [0002] With the appearance of the early obscurity identity-based encryption methods, attribute-based cryptography entered the human line of sight. In reality, users not only have unique public keys or identities, but are replaced by corresponding attributes of users, such as name, age, department, etc., thus broadening the application field of attribute-based cryptosystems, which has attracted the attention of researchers. . [0003] Revocation has been intensively studied as an indispensable function in the field of public key cryptography. With the introduction and development of attribute encryption, research on attribute encryption schemes for revocable attributes can better meet the actual needs. Contents of the invention [0004] The purpose of the p...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L9/08H04L29/06
Inventor 王尚平余小娟王晓峰
Owner 重庆涔信科技有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More