Unlock instant, AI-driven research and patent intelligence for your innovation.

Non-forgeable knowledge proof and message signature authentication method based on bilinear pairings

A message signature and knowledge proof technology, applied in the field of cryptography, can solve the problems of not being able to provide unforgeable security, not being able to provide identity authentication functions, not being able to prove the security of signatures, etc.

Inactive Publication Date: 2012-08-01
丁素芬
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0023] The disadvantage of the Boneh-Boyen scheme is that it cannot prove complete signature security. In order to obtain complete signature security, the public key of the Boneh-Boyen scheme needs to add a DH-component and the signature must be random (that is, the signature itself contains a random string); in addition, the Boneh-Boyen scheme cannot provide sufficient unforgeable security, such as given A malicious adversary can forge it into a where H 1 (m') = cH 1 (m)
In addition, the invented identity-based key exchange method-2 provides an explicit identity authentication function, while the Smart protocol cannot provide an explicit identity authentication function

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
  • Non-forgeable knowledge proof and message signature authentication method based on bilinear pairings
  • Non-forgeable knowledge proof and message signature authentication method based on bilinear pairings
  • Non-forgeable knowledge proof and message signature authentication method based on bilinear pairings

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach

[0155] given in are public, e A Is a Efficient bilinear pairmaps (note that The elements in represent more than is shorter, so the signature obtained below is correspondingly shorter). based on Efficient bilinear pairwise mappings can be obtained accordingly. and It can be either the same cyclic group or different groups ( and Different takes precedence). like and same, and Can be either equal or unequal. Record m as the information to be signed. The identity of the signer is

Embodiment approach -1

[0157] Public Key: The signer's public key consists of: The signer's public key can also contain values ​​that the verifier can compute beforehand: and / or and / or δ, where is x 1 The x-axis coordinate value, or δ is from A randomly chosen constant c in , or h δ is an output belonging to the hash function, yes A subset of. In some interactive application environments, δ can be determined by interacting with the user Interactive other users generate and send to

[0158] private key: x 1 , where x 1 From randomly selected from.

[0159] Signature: the signer calculates where H 1 is a domain of {0, 1} * output belongs to a hash function for . τ A as a signature on message m. Note: The computational complexity of the signer is equivalent to an exponential operation. In some applications, the identity of the signer can also be as H 1 One of the input parameters. if x 1 h 1 (X 1 , m)+δ=0, let or order where r is a random number and (...

Embodiment approach -2

[0163] Public Key: The signer's public key consists of: and The signer's public key can also contain values ​​that the verifier can compute beforehand.

[0164] private key: x 1 , x 2 , where x 1 , x 2 From randomly selected from.

[0165] Signature: the signer calculates where H 1 is an output belonging to a hash function for . δ is 0 (δ=0 is a preferred implementation), or δ is a A randomly chosen constant in , or δ is X 1 , X 2 One of the x-axis coordinate values ​​for N A modulo of , or where H δ is an output belonging to the hash function, yes A subset of. In some interactive application environments, δ can be determined by interacting with the user Interactive other users generate and send to τ A as a signature on message m. In some applications, the identity of the signer can also be as H 1 One of the input parameters.

[0166] Verification: get (m, τ A ), the signature verifier calculates and verifies whether The verification o...

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 provides a non-forged knowledge proof and message signature authentication method based on bilinear pairings. The objective of the invention is the concurrency of Non-forgeable security and knowledge extraction resistance capacity. With the method provided by the invention, a valid knowledge proof or message signature authentication is provided only when corresponding secret knowledge is known. Through regarding user identities and / or fixed DH elements as a public key, the method of the invention comprises an efficient numerical signature method and an identity-based or certificate-free signature method. Through operating the method of the invention, each side which operates the method of the invention proves the respective secret DH-knowledge knowledge. A key exchange method for authentication and an identity-based or certificate-free key exchange method for authentication are derived by the method of the invention.

Description

technical field [0001] The invention belongs to the technical field of cryptography, in particular to a method for unforgeable knowledge proof and message signature authentication based on bilinear pairing (without interaction). The purpose of the invented method is concurrent unforgeable security and knowledge extractability. Specifically, only knowing the corresponding secret knowledge can give a legal knowledge proof or message signature authentication. By treating the user's identity and / or fixed DH components as public keys, the inventive method implies efficient numerical signature methods and identity-based signature methods; parties (running the inventive method) prove their secret DH- Knowledge knowledge and invention methods lead to authenticated key exchange methods and authenticated identity-based key exchange methods. Background technique [0002] Preliminary Knowledge and Notation [0003] The methods and operations described in the present invention are bas...

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/32H04L9/30
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

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