CN104517019B - Simple and convenient recent time authentication method and implementation - Google Patents

Simple and convenient recent time authentication method and implementation Download PDF

Info

Publication number
CN104517019B
CN104517019B CN201310458810.7A CN201310458810A CN104517019B CN 104517019 B CN104517019 B CN 104517019B CN 201310458810 A CN201310458810 A CN 201310458810A CN 104517019 B CN104517019 B CN 104517019B
Authority
CN
China
Prior art keywords
value
random number
main program
time
assigns
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201310458810.7A
Other languages
Chinese (zh)
Other versions
CN104517019A (en
Inventor
涂先锋
涂平昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201310458810.7A priority Critical patent/CN104517019B/en
Publication of CN104517019A publication Critical patent/CN104517019A/en
Application granted granted Critical
Publication of CN104517019B publication Critical patent/CN104517019B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Storage Device Security (AREA)

Abstract

A simple and convenient recent time authentication method and implementation, an effective and simple and convenient certification method and implementation for certifying that an action or an information occurrence is after a certain time. The invention utilizes true randomThe unit threshold value is combined to generate a threshold value by the unit threshold value corresponding to the time unit value of each time, and forms an ordered array (t) together with the current time0,v0) Finally, the ordered array at each moment is released at the current moment, so that the occurrence of the behavior or the information is proved to be positioned at the moment t by declaring the array0And then.

Description

Simple and convenient recent time authentication method and implementation
Technical Field
The invention relates to an efficient and simple proof method for proving that an activity or a message is located after a certain time.
Background
The rapid development of human society information transmission technology enables information transmission and propagation to be convenient and rapid, the information transmission also enables the distance between information expression and the real content of the information to be longer and longer, the information expression is easier to separate from the real content, and therefore the information receiver is more difficult to judge the authenticity of the information. The timeliness and instantaneity of information play an important role in various elements of information, but because the information expression is separated from the actual content, the information publisher is difficult to fetch the time elements of the information to the audience, and the audience of the information cannot judge the timeliness of the published information.
The invention aims to create a time valve, and the freshness and instantaneity of information can be effectively proved through the time valve. Moreover, the method for proving is simple and easy to implement and has high credibility.
Disclosure of Invention
The present invention relates to the following concept:
1. a set of times. For determining the range of the time valve, expressed in terms of a determined time interval, expressed as:
T={t|t∈[t1,t2]},t1,t2for a given determined moment, it uses a daily timing method, such as: 14 o 25 min 12 s 70 ms at 9/4/2013.
2. A unit of time. The time units are year, month, day, hour, minute, second and millisecond, which are respectively recorded as: y, m, d, h, min, s, ms.
3. A set of time units. According to the time sets in 1, corresponding time sets are formed under each time unit, and the sets are respectively expressed as follows:
Y={y,y∈[y1,y2]},y1,y2are each t1,t2Corresponding year
M={m|m∈(1,2,3,…,12)}
D={d|d∈(1,2,3,…,31)}
H={h|h∈(0,1,2,3,…,23)}
MIN={min|min∈(0,2,3,…,59)}
S={s|s∈(0,2,3,…,59)}
MS={ms|ms∈(0,1,2,3,…,99)}
Thus, any one t can be represented as: t is y + m + d + h + min + s + ms
4. And (4) collecting unit valves. Any element in each time unit valve set can be associated with an element in the time unit set with a certain probability, and the unit valve set is respectively recorded as: v1、V2、V3、V4、V5、V6、V7
For the elements in the unit valve set, we can arbitrarily adopt different representation methods, for example, a specified number of english letter combinations can be used, and a set of 26 english letters is represented by L, that is:
L={l|l∈(a,b,c,…,z)}
Figure GDA0002625020940000011
the ∑ operation here is string merging, and the following meaning is the same.
Figure GDA0002625020940000012
5. And (4) valve sets. Each element of the set may be a corresponding indication of a time in the time set with a certain probability. Expressed as:
Figure GDA0002625020940000013
wherein, VkIs a time unit valve set.
6. And (4) corresponding relation. By a rule of correspondenceAt each instant we will note that instant as t0Will be at that time t0The corresponding mark in the time set corresponds to the element of the valve set weight, namely, a functional relation is established, and the functional relation meets the following condition:
(1) the corresponding ground rules are definitively explicit.
(2) The correspondence is established at t0Made at a time.
(3) The establishment of the pairs is random, i.e. before the establishment of the correspondence, at time t0The elements corresponding to the valve set are not accurately predictable.
(4) The probability of an accurate prediction is small enough to be a small probability event.
7. And (4) performing a random algorithm. The correspondence method of the correspondence relationship is determined by a random algorithm generated by a computer. The random algorithm depends on a computer generated true random number. The random numbers are generated from physical random variables and are not derived mathematically. Such random values have the following characteristics:
(1) none of the generated random values are independent and have no correlation with previous random values.
(2) The generated random values are subject to a uniform distribution over the whole given interval, i.e. the chance of being chosen is the same for each of the assigned possible values.
(3) Anyone can not predict accurately at any time before random values are generated.
Examples of random algorithms are:
the random value can be obtained using the Bull Mountain random number generation solution provided by Intel corporation. Bull Mountain is new to Intel
Figure GDA0002625020940000023
The 64 architecture instruction RdRand and its underlying Digital Random Number Generator (DRNG) hardware implement the named code. Bull Mountain provides a RNG solution based on a processor, and has the characteristics of high quality, high performance, high availability, high safety and the like.
Get a 32-bit random number program code example:
Figure GDA0002625020940000021
example program code for repeatedly taking 32-bit random numbers:
Figure GDA0002625020940000022
Figure GDA0002625020940000031
the above is only an example of a random algorithm, and there are many available methods for generating random numbers, which do not relate to the key content of the present invention, so that only an example is given to illustrate that a true random number value can be obtained reliably and easily.
8. Correspondence and designation
For the element T in the time set T corresponding to the current time standard time0The decomposition can be according to the time unit set as:
t0=y0+m0+d0+h0+min0+s0+ms0
(1) the basic correspondence relationship.
Using rand () to represent the corresponding relationship associated with the random number generated in 7, let
y0→v1=rand(V1) Is shown in valve set V1Wherein an element and y are randomly assigned0Corresponding, i.e. using v1To mark y0
m0→v2=rand(V2) Is shown in valve set V2Wherein an element and m are randomly assigned0Corresponding, i.e. using v2To mark m0
d0→v3=rand(V3) Is shown in valve set V3Wherein an element and d are randomly assigned0Corresponding, i.e. using v3To mark d0
h0→v4=rand(V4) Is shown in valve set V4Wherein an element and h are randomly assigned0Corresponding, i.e. using v4To mark h0
min0→v5=rand(V5) Is shown in valve set V5Wherein randomly assigning an element and min0Corresponding, i.e. using v5To mark min0
s0→v6=rand(V6) Is shown in valve set V6Wherein an element and s are randomly assigned0Corresponding, i.e. using v6To mark s0
ms0→v7=rand(V7) Is shown in valve set V7Wherein an element and ms are randomly assigned0Corresponding, i.e. using v7To mark ms0
(2) Improved correspondence
With the corresponding algorithm in (1) above, there is a possibility that different times and the same mark are available, that is, the mark is not unique, and in order to make the mark unique, the element that has been used in the corresponding valve is removed in the same unit time period, and for this reason, we use WiTo indicate that V has been used within the same unit time periodiA set of elements in (1). When a unit time period is finished and a new period is started, corresponding W is addediRemoval of elements from the earth, i.e. WiPsi is an empty set. The correspondence of (1) becomes the following form
y0→v1=rand(V1-W1) Is shown in valve set V1Wherein an element and y are randomly assigned0Corresponding, i.e. using v1To mark y0
m0→v2=rand(V2-W2) Is shown in valve set V2Wherein an element and m are randomly assigned0Corresponding, i.e. using v2To mark m0
d0→v3=rand(V3-W3) Is shown in valve set V3Wherein an element and d are randomly assigned0Corresponding, i.e. using v3To mark d0
h0→v4=rand(V4-W4) Is shown in valve set V4Wherein an element and h are randomly assigned0Corresponding, i.e. using v4To mark h0
min0→v5=rand(V5-W5) Is shown in valve set V5Wherein randomly assigning an element and min0Corresponding, i.e. using v5To mark min0
s0→v6=rand(V6-W6) Is shown in valve set V6Wherein an element and s are randomly assigned0Corresponding, i.e. using v6To mark s0
ms0→v7=rand(V7-W7) Is shown in valve set V7Wherein an element and ms are randomly assigned0Corresponding, i.e. using v7To mark ms0
(3) Sign
Thus, v can be used0=v1+v2+v3+v4+v5+v6+v7To indicate t at the current moment0
9. Issue a publication
When each time unit is changed, a random algorithm program is triggered to randomly derive the corresponding element in the time threshold set for that time unit, such that for any time value t in a given time period0Will have a threshold value v0And correspondingly. The data set (t)0,v0) The information is distributed through a certain information channel, and the channel can be an information propagation channel such as a network.
10. Characteristics and meanings
Array of time values and threshold values (t)0,v0) Has the following characteristics and meanings:
(1) for any one time, there will be a unique array (t)0,v0)。
(2) Threshold v in the array0At time t0It was unpredictable by anyone until arrival.
(3) Anyone declares this array (t)0,v0) It proves to be located at t in time series when it is declared0And then.
(4) An effective and simple proving method is provided for proving that a certain behavior or a certain information is located after a certain time.
Drawings
FIG. 1 is a block diagram of a main program for time valve generation and release
FIG. 2 is a diagram of a millisecond processing subroutine
FIG. 3 is a block diagram of a second processing subroutine
FIG. 4 is a minute processing subroutine block diagram
FIG. 5 is a block diagram of an hour processing subroutine
FIG. 6 is a block diagram of a daily processing subroutine
FIG. 7 is a block diagram of a month processing subroutine
FIG. 8 is a block diagram of a year processing subroutine
Detailed Description
As shown in figure 1, the system obtains an accurate standard time stamp through a network and a system clock, and converts the time stamp into a common time format t0And decomposing the real-time value y of each time unit of millisecond, second, minute, hour, day, month and year0、m0、d0、h0、min0、s0、ms0
In the main routine, the even number ms of milliseconds is set0To the millisecond processing subroutine of figure 2, which processes this value ms0Value ms from the previous time0-1Make a comparison if ms0>ms0-1The system generates or obtains a random number and assigns a set V based on the random number7-W7A member of (5) element v7The system will element v7Merge set W7In ms, in combination0Numerical value ofReplacement of ms0-1The original value in (1); if ms0<ms0-1The system generates or obtains a random number and assigns a set V based on the random number7A member of (5) element v7The system will aggregate W7Make empty and put element v7Incorporating W7In ms, in combination0Value of (2) replaces ms0-1The original value in (1); finally, the subroutine returns v7The values are given to the main program.
The main program compares the second's even value s0Passes to the seconds processing subroutine of FIG. 3, which processes this value s0The value s from the previous moment0-1Making a comparison if s0>s0-1The system generates or obtains a random number and assigns a set V based on the random number6-W6A member of (5) element v6The system will element v6Merge set W6In, use of s in combination0Replacing s with the value of0-1The original value in (1); if s is0<s0-1The system generates or obtains a random number and assigns a set V based on the random number6A member of (5) element v6The system will aggregate W6Make empty and put element v6Incorporating W6In, use of s in combination0Replacing s with the value of0-1The subroutine returns v6Giving the value to the main program; if s is0=s0-1If so, the subroutine is ended and the main program is directly returned.
The subroutine calls for minutes, hours, days, months, years and seconds are identical.
V obtained by each subprogram in the main program1、v2、v3、v4、v5、v6、v7Are combined to obtain v0The value is compared with the time value t at the current moment0Corresponding to form an ordered array (t)0,v0) Finally, the array is published through various information channels.

Claims (1)

1. An effective, simple and convenient method for authenticating latest information by using a random value corresponding to a time value at a current time to prove that a behavior is located after a certain time, the method comprising: the method comprises the following steps:
(1) the computer system is used to obtain the current time t expressed by the conventional timing method in units of year, month, day, hour, minute, second and millisecond through the network and the system clock0
(2) Obtaining a random number by a computer system through a physical or computer system built-in random number function, and comparing the random number with the current time t0Corresponding to obtain the corresponding relation (t)0,v0);
(3) The correspondence relation (t) is expressed by the network0,v0) Releasing;
wherein the random number is a true random number that cannot be predicted before generation; at the same time, the corresponding relation is at the time t0Cannot be predicted before coming;
the realization of the authentication method comprises the following steps: a time valve generates and issues a main program, and the time valve is used for proving the freshness and instantaneity of information;
the main program includes the steps of:
s (1) acquiring a standard timestamp;
decomposition of S (2) into time units y0、m0、d0、h0、min0、s0、ms0
S (3) a millisecond processing subprogram;
s (4) a second processing subprogram;
s (5) a minute processing subroutine;
s (6) an hour processing subroutine;
s (7) a daily processing subroutine;
s (8) a month processing subroutine;
s (9) a year processing subroutine;
s (10) generating time valve v0
S (11) issuing a data set (t)0,v0);
Wherein, step S (1) is that the system passes through the network and the clock of the system,obtaining accurate standard time stamp and converting the time stamp into common time format t0(ii) a Step S (2) is specifically based on the common time format t0Decomposing the instantaneous value y of time unit millisecond, second, minute, hour, day, month and year0、m0、d0、h0、min0、s0、ms0
The calling of the millisecond processing subprogram specifically comprises the following steps: the main program converts the instantaneous value ms of millisecond0To a millisecond processing subroutine that processes the instantaneous value ms0Value ms from the previous time0-1Make a comparison if ms0>ms0-1The system generates or obtains a random number and assigns a set V based on the random number7-W7An element v in7The system will element v7Merge set W7In ms, in combination0Value of (2) replaces ms0-1The original value in (1); if ms0<ms0-1The system generates or obtains a random number and assigns a set V based on the random number7Element v in (1)7The system will aggregate W7Make empty and put element v7Incorporating W7In ms, in combination0Value of (2) replaces ms0-1The original value in (1); finally, the subroutine returns v7Giving the value to the main program;
the second processing subprogram is specifically called as follows: the main program compares the instantaneous value s of the second0To the seconds processing subroutine which processes the instantaneous value s0The value s from the previous moment0-1Making a comparison if s0>s0-1The system generates or obtains a random number and assigns a set V based on the random number6-W6An element v in6The system will element v6Merge set W6In, use of s in combination0Replacing s with the value of0-1The original value in (1); if s is0<s0-1The system generates or obtains a random number and assigns a set V based on the random number6Element v in (1)6The system willSet W6Make empty and put element v6Incorporating W6In, use of s in combination0Replacing s with the value of0-1The subroutine returns v6Giving the value to the main program; if s is0=s0-1If yes, the subprogram is ended, and the main program is directly returned;
wherein, V7Representing a set of millisecond unit valves, V6Denotes the set of second units, W7Indicating that V has been used within the same unit time period7Set of elements in (1), W6Indicating that V has been used within the same unit time period6A set of elements of (1);
the calling of the minute processing subprogram specifically comprises the following steps: the main program calculates the instantaneous value min of the second0To the second processing subroutine, which processes the instantaneous value min0The value min from the previous moment0-1Make a comparison if min0>min0-1The system generates or obtains a random number and assigns a set V based on the random number5-W5An element v in5The system will element v5Merge set W5In combination with min0Value of (c) replaces min0-1The original value in (1); if min0<min0-1The system generates or obtains a random number and assigns a set V based on the random number5Element v in (1)5The system will aggregate W5Make empty and put element v5Incorporating W5In combination with min0Value of (c) replaces min0-1The subroutine returns v5Giving the value to the main program; if min0=min0-1If yes, the subprogram is ended, and the main program is directly returned;
the calling of the hour processing subprogram specifically comprises the following steps: the main program calculates the instantaneous value h of the second0To the second processing subroutine which processes the instantaneous value h0The value h from the previous moment0-1Making a comparison if h0>h0-1The system generates or obtains a random number and assigns a set V based on the random number4-W4An element v in4The system will element v4Merge set W4In combination with h0Replacing h with the value of0-1The original value in (1); if h is0<h0-1The system generates or obtains a random number and assigns a set V based on the random number4Element v in (1)4The system will aggregate W4Make empty and put element v4Incorporating W4In combination with h0Replacing h with the value of0-1The subroutine returns v4Giving the value to the main program; if h is0=h0-1If yes, the subprogram is ended, and the main program is directly returned;
the calling of the daily processing subprogram specifically comprises the following steps: the main program compares the instantaneous value d of the second0To the second processing subroutine which processes the instantaneous value d0The value d from the previous moment0-1Making a comparison if d0>d0-1The system generates or obtains a random number and assigns a set V based on the random number3-W3An element v in3The system will element v3Merge set W3In combination with d0Replacing d with the value of0-1The original value in (1); if d is0<d0-1The system generates or obtains a random number and assigns a set V based on the random number3Element v in (1)3The system will aggregate W3Make empty and put element v3Incorporating W3In combination with d0Replacing d with the value of0-1The subroutine returns v3Giving the value to the main program; if d is0=d0-1If yes, the subprogram is ended, and the main program is directly returned;
the calling of the month processing subprogram specifically comprises the following steps: the main program compares the instantaneous value m of the second0To the second processing subroutine, which processes the instantaneous value m0And the value m of the previous moment0-1Make a comparison if m0>m0-1The system generates or obtains a random number and assigns a set V based on the random number2-W2An element v in2The system will element v2Merge set W2M in combination0Replacing m with the value of0-1The original value in (1); if m is0<m0-1The system generates or obtains a random number and assigns a set V based on the random number2Element v in (1)2The system will aggregate W2Make empty and put element v2Incorporating W2M in combination0Replacing m with the value of0-1The subroutine returns v2Giving the value to the main program; if m is0=m0-1If yes, the subprogram is ended, and the main program is directly returned;
the calling of the annual processing subprogram specifically comprises the following steps: the main program compares the instantaneous value y of the second0To the seconds processing subroutine which processes the instantaneous value y0With the value y of the previous moment0-1Making a comparison if y0>y0-1The system generates or obtains a random number and assigns a set V based on the random number1-W1An element v in1The system will element v1Merge set W1In combination with y0Replacing y with the value of0-1The original value in (1); if y is0<y0-1The system generates or obtains a random number and assigns a set V based on the random number1Element v in (1)1The system will aggregate W1Make empty and put element v1Incorporating W1In combination with y0Replacing y with the value of0-1The subroutine returns v1Giving the value to the main program; if y is0=y0-1If yes, the subprogram is ended, and the main program is directly returned;
wherein, V5Denotes minute Unit valvetrain, V4Represents the hourly unit valvetrain, V3Means daily unit valve set, V2Represents a monthly unit valve set, V1Representing annual unit valve set, W5Indicating that V has been used within the same unit time period5Set of elements in (1), W4Indicating that V has been used within the same unit time period4Chinese character of (1)Set of elements, W3Indicating that V has been used within the same unit time period3Set of elements in (1), W2Indicating that V has been used within the same unit time period2Set of elements in (1), W1Indicating that V has been used within the same unit time period1A set of elements of (1);
the main program is to process the v obtained by the millisecond processing subroutine, the second processing subroutine, the minute processing subroutine, the hour processing subroutine, the day processing subroutine, the month processing subroutine, and the year processing subroutine1Said v2Said v3Said v4Said v5Said v6Said v7Combining to obtain the v0V is to be measured0And the time value t of the current moment0Corresponding to form an ordered array (t)0,v0) The ordered array (t) is0,v0) And publishing through an information channel.
CN201310458810.7A 2013-10-07 2013-10-07 Simple and convenient recent time authentication method and implementation Active CN104517019B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310458810.7A CN104517019B (en) 2013-10-07 2013-10-07 Simple and convenient recent time authentication method and implementation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310458810.7A CN104517019B (en) 2013-10-07 2013-10-07 Simple and convenient recent time authentication method and implementation

Publications (2)

Publication Number Publication Date
CN104517019A CN104517019A (en) 2015-04-15
CN104517019B true CN104517019B (en) 2020-09-22

Family

ID=52792313

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310458810.7A Active CN104517019B (en) 2013-10-07 2013-10-07 Simple and convenient recent time authentication method and implementation

Country Status (1)

Country Link
CN (1) CN104517019B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106204873B (en) * 2016-07-20 2018-10-12 兰州智豆信息科技有限公司 Based on the lucky user's abstracting method and system for participating in the time

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588413A (en) * 2004-10-22 2005-03-02 刘向华 Time anti-fake method and its anti-fake system
CN1972237A (en) * 2006-12-06 2007-05-30 胡祥义 VPN system based on dynamic encryption algorithm
US20090235349A1 (en) * 2008-03-12 2009-09-17 Intuit Inc. Method and apparatus for securely invoking a rest api

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1642077B (en) * 2004-01-13 2011-07-06 国际商业机器公司 Credible digital time stamp generating and verifying method and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588413A (en) * 2004-10-22 2005-03-02 刘向华 Time anti-fake method and its anti-fake system
CN1972237A (en) * 2006-12-06 2007-05-30 胡祥义 VPN system based on dynamic encryption algorithm
US20090235349A1 (en) * 2008-03-12 2009-09-17 Intuit Inc. Method and apparatus for securely invoking a rest api

Also Published As

Publication number Publication date
CN104517019A (en) 2015-04-15

Similar Documents

Publication Publication Date Title
ZA201805050B (en) Cryptographic method and system for secure extraction of data from a blockchain
CN107181797B (en) Block compression method and system of block chain
KR102603069B1 (en) System architecture and data processing methods in system architecture
CN114372296B (en) Block chain-based user behavior data auditing method and system
CN109327311B (en) Hash timestamp creating method and device and readable storage medium
Doornik et al. Modeling and forecasting the COVID‐19 pandemic time‐series data
Garfinkel et al. Randomness concerns when deploying differential privacy
CN104517019B (en) Simple and convenient recent time authentication method and implementation
CN109831479A (en) The data processing method and system of block chain
CN115686437A (en) Random number generation method and device, computer equipment and storage medium
CN113256038B (en) Data processing method, data processing equipment and computer readable storage medium
Akhmetzhanov et al. Real time forecasting of measles using generation-dependent mathematical model in Japan, 2018
AU2023202016A1 (en) Method for identifying a device using attributes and location signatures from the device
Leung et al. Effectiveness of containment strategies in preventing SARS-CoV-2 transmission
Wang et al. A blockchain-based human-to-infrastructure contact tracing approach for COVID-19
CN116682543A (en) Sharing method and system of regional rehabilitation information
CN110088756B (en) Concealment apparatus, data analysis apparatus, concealment method, data analysis method, and computer-readable storage medium
Pham et al. Beating Social Pulse: Understanding Information Propagation via Online Social Tagging Systems.
US20200213095A1 (en) Method and device for the computer aided processing of a random bit pattern
CN115643047A (en) Block chain identity authentication method based on honest rewards
CN115225265A (en) Log management method and device, electronic equipment and storage medium
Ferrari et al. Does COVID-19 mass testing work? The importance of accounting for the epidemic dynamics
CN113516199A (en) Image data generation method based on differential privacy
Pandey et al. Covidbloc: a blockchain powered exposure database for contact tracing
JP2014035570A (en) Event occurrence point extraction device, method, and program

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant