Universally composable identity proxy signcryption method

A technology of proxy signcryption and signcryption party, applied in the field of public key cryptography or general composable security framework or proxy signcryption field, it can solve the problem of no identity proxy signcryption, etc., and achieve low computational complexity and general composable security. sexual effect

Active Publication Date: 2019-01-29
XIAN UNIV OF POSTS & TELECOMM +1
View PDF11 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the identity proxy signcryption, the user's public key is determined by the user's identity information, and the user's private key is determined by the private key generator, thus overcoming the problem of certificate management. However, there is no identity proxy signcryption under the general composite framework.

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
  • Universally composable identity proxy signcryption method
  • Universally composable identity proxy signcryption method
  • Universally composable identity proxy signcryption method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0065] In this embodiment, the large prime number q is 2 192 -2 64 -1 as an example, the general and composite identity proxy signcryption method consists of the following steps:

[0066] A. System initialization

[0067] (A1) The order of the private key generator is selected as a large prime number q is 2 192 -2 64 A Cyclic Additive Group G of -1 1 and a cyclic multiplicative group G 2 , let P be the cyclic addition group G 1 A generator of , e is G 1 ×G 1 →G 2 A bilinear map of .

[0068] (A2) The private key generator selects a cryptographically secure Hash function h 1 、h 2 、h 3 、h 4 :h 1 is {0,1} * →G 1 , h 2 yes h 3 is {0,1} t ×G 1 ×G 2 →{0,1} l , h 4 yes in is {1,2,...,2 192 -2 64 -2}, l is the length of the message, and t is the length of the authorization certificate.

[0069] (A3) The private key generator randomly selects the master key s∈Z q * And determine the system public key y:

[0070] y=sP.

[0071] (A4) The private key ge...

Embodiment 2

[0121] In this embodiment, the large prime number q is 2 224 -2 96 +1 as an example, the general and composable identity proxy signcryption method consists of the following steps:

[0122] A. System initialization

[0123] (A1) The order of the private key generator is selected as a large prime number q is 2 224 -2 96 A Cyclic Additive Group G of +1 1 and a cyclic multiplicative group G 2 , let P be the cyclic addition group G 1 A generator of , e is G 1 ×G 1 →G 2 A bilinear map of .

[0124] (A2) The private key generator selects a cryptographically secure Hash function h 1 、h 2 、h 3 、h 4 :h 1 is {0,1} * →G 1 , h 2 yes h 3 is {0,1} t ×G 1 ×G 2 →{0,1} l , h 4 yes in is {1,2,...,2 224 -2 96}, l is the length of the message, and t is the length of the authorization certificate.

[0125] (A3) The private key generator randomly selects the master key s∈Z q * And determine the system public key y:

[0126] y=sP.

[0127] (A4) The private key gene...

Embodiment 3

[0131] In this embodiment, the large prime number q is 2 256 -2 224 +2 192 +2 96 +1 as an example, the general and composable identity proxy signcryption method consists of the following steps:

[0132] A. System initialization

[0133] (A1) The order of the private key generator is selected as a large prime number q is 2 256 -2 224 +2 192 +2 96 A Cyclic Additive Group G of +1 1 and a cyclic multiplicative group G 2 , let P be the cyclic addition group G 1 A generator of , e is G 1 ×G 1 →G 2 A bilinear map of .

[0134] (A2) The private key generator selects a cryptographically secure Hash function h 1 、h 2 、h 3 、h 4 :h 1 is {0,1} * →G 1 , h 2 yes h 3 is {0,1} t ×G 1 ×G 2 →{0,1} l , h 4 yes in is {1,2,...,2 256 -2 224 +2 192 +2 96}, l is the length of the message, and t is the length of the authorization certificate.

[0135] (A3) The private key generator randomly selects the master key s∈Z q * And determine the system public key y:

...

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 invention relates to a universally composable identity proxy signcryption method. The method includes the steps of system initialization, public and private key generation, proxy key generation, proxy signcryption, decryption, and verification. According to the universally composable identity proxy signcryption method, the public key of a user is determined according to the identity information of the user; and the private key of the user is generated through a private key generator. With the universally composable identity proxy signcryption method adopted, the problem of calculation costs for certificate generation, storage, distribution, revocation and verification of traditional public key infrastructure can be solved; with no secure channels required, confidentiality and authentication can be realized. The method of the invention has the advantages of universal composite security, low computational complexity, and the like, and is suitable for technical fields such as mobile agents and electronic conferences.

Description

technical field [0001] The invention belongs to the technical field of network information security, and in particular relates to public key cryptography or a general composite security framework or proxy signcryption. Background technique [0002] The general composable security framework was proposed by Ran Canetti in 2001. The general and composable security framework meets the modular design requirements of the protocol and can be used to design the protocol alone. If a protocol satisfies general composability security, the protocol can guarantee the security of running concurrently with other protocols. To design a secure protocol, the first step is to abstract the desired function of the protocol into an ideal function, which is equivalent to an unbreakable trusted third party in the real world. The general composable security framework is composed of realistic model, ideal model and hybrid model. In the general composable framework, an interactive Turing machine (I...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/06H04L9/08H04L9/30H04L9/32
CPCH04L9/0631H04L9/0643H04L9/0869H04L9/3033H04L9/3247
Inventor 俞惠芳王之仓
Owner XIAN UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap