Divisible electronic cash construction method based on ternary tree
A technology of electronic cash and construction method, applied in the field of information security, can solve the problems of reduced payment efficiency and large payment times, and achieve the effects of reducing the number, saving resources, and improving payment efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0015] Step 1: Public parameter setting of the electronic cash system. Let S n is a collection of strings of length less than n. For any s∈S n , |s| indicates the length of the bit string s, and the set Y n (s)={y||y|=n, y is formed by adding a character string at the end of s}. Let G 1 , G 2 is a group whose order is a prime number p, {G 1 , G 2 , G T , e} is a bilinear group, G=e(g, h) is G T A generator of , g, h are respectively G 1 , G 2 The generator of , e is a bilinear map.
[0016] Step 2: Construct face value 3 n electronic cash. Use a ternary tree of depth n to construct the face value 3 n electronic cash. The root node is GS, which contains parameters such as the issuance time of the electronic cash and the bank information that issued the electronic cash. The non-root and non-leaf nodes of the ternary tree are s∈S n , where the number of bits of s is equal to its depth.
[0017] For each non-root non-leaf node of the ternary tree, s∈S n , choose...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com