CN106452784B - A kind of mutual card method of anonymity equity of digital asset primitive attribute - Google Patents
A kind of mutual card method of anonymity equity of digital asset primitive attribute Download PDFInfo
- Publication number
- CN106452784B CN106452784B CN201610861292.7A CN201610861292A CN106452784B CN 106452784 B CN106452784 B CN 106452784B CN 201610861292 A CN201610861292 A CN 201610861292A CN 106452784 B CN106452784 B CN 106452784B
- Authority
- CN
- China
- Prior art keywords
- data
- digital asset
- primitive attribute
- participant
- digital
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3271—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using challenge-response
- H04L9/3273—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using challenge-response for mutual authentication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/0869—Network architectures or network communication protocols for network security for authentication of entities for achieving mutual authentication
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of mutual card methods of the anonymity equity of digital asset primitive attribute, the steps include: that 1) digital asset owner x calculates the primitive attribute mark H of its digital asset [Data] xx；Digital asset owner broadcasts anonymous mutually card in a network and invites, and determines each participant for generating mutually card voucher；2) each participant i in each participant is by the mark H of oneselfiAnd the mark that other participants provide in each participant merges into overall data [D]all；3) each participant is by the overall data [D]allMutual card voucher as [Data] x；4) when need to verify the primitive attribute of digital asset [Data] x, digital asset holder x shows the mutual card voucher and [Data] x to authentication；5) authentication determines the primitive attribute of digital asset [Data] x according to the mutual card voucher.The present invention can be realized the mutual card in the case where not influencing anonymous state to digital asset primitive attribute.
Description
Technical field
The invention belongs to field of computer technology, and in particular to as digital content [Data]AOwner A wish with anonymity
Another anonymity side B that recognizes each other of mode equity be its held digital content [Data]BPrimitive attribute (mutually card after do not usurp
Change) method, this method can extend to n group [Data]nWith the mutual card between corresponding n owner.
Background technique
Digital asset is a kind of data being present in storaging medium, is very easy to be tampered and falsely use, in order to keep and
The primitive attribute (confirming that the digital asset is original work and was not tampered with) for verifying digital asset attribute, generallys use with lower section
Method:
Digital digest
It is the short message that the message of random length is become to regular length, it is similar to the letter that an independent variable is message
Number, that is, Hash function.Digital digest is exactly using individual event Hash function that the plaintext " abstract " for needing to encrypt is solid at a string
This string of ciphertexts of the ciphertext of measured length (128) are also known as digital finger-print, it has fixed length, and different plaintext abstracts
At ciphertext, result is always different, and similarly its abstract must be consistent in plain text.Original is verified by way of digital digest
Text, it is necessary to carry out, in no determining purpose and determine in individual open environment, digital digest is only between determining individual
It can determine that data correctness, and be difficult from the primitiveness for demonstrate,proving digital asset.
Digital signature
Digital signature technology is most common data integrity protection's mechanism, can generate " the number more more reliable than mankind fingerprint
According to fingerprint ".It sends the summary info private key encryption of signatory to recipient together with original text.Recipient is to receiving
Original text generates summary info, and the summary info come out with signatory's public key decryptions compares, the integrality of verification information.Number label
Name technology does not solve the problems, such as that mutual trust between signatory and recipient, the guarantee of this data integrity are built upon signatory
On the basis of having existed mutual trust relationship with recipient, therefore this method can not be discriminated and distinguish the malicious act from signatory.
Authoritative institution's registration/CA registration
Digital asset original work are carried out by traditional authoritative institution such as copyright registration mechanism, intellectual property registration body
The verifying needs of primitive attribute can preferably be met by putting on record and (modes such as endorsing including the use of the technology of CA mechanism).These modes
In contrast more complex and inefficient.
Peer-to-peer network
Utilize the digital finger-print that digital asset is recorded based on the digital cash bill system of peer-to-peer network technology, Ke Yishi
Now to the preservation and verifying of digital asset primitive attribute, the problem of this mode preferably resolves anonymous authentication, but simultaneously
There is must rely on the shortcomings that certain digital coin systems could use.
Summary of the invention
For the technical problems in the prior art, the purpose of the present invention is to provide a kind of method that anonymity is mutually demonstrate,proved,
Suitable for network environment, to digital asset primitive attribute between any individual under the open applications scene of no specific objective group
Anonymity mutually card.Key step of the invention includes:
1, digital asset owner x calculate its digital asset [Data]xPrimitive attribute mark, such as digital finger-print Hx；
2, n (n > 1) bit digital assets owners keep anonymous in a network, and by broadcasting discovery mutually, participant is free
Group is combined into mutual card group, prepares for mutually demonstrate,proving voucher；
3, participant in mutual card group is by common data anchor point (public data that anonym approves jointly) or common data
The digital finger-print of anchor point, the primitive attribute of oneself identify HxAnd other anonym i provide respectively digital asset is corresponding with its
Primitive attribute identify HiMerge into [D]all, and respectively calculate overall data [D] respectivelyallDigital finger-print HR, and result is sent out
Give other anonymous participants；
4, participate in the anonymity side contrast conting result H calculatedRIf result is consistent, [D]allAnd HRAs [Data]xIt is legal
Mutually card voucher is respectively taken care of by the anonym for participating in calculating；
5, digital asset [Data] need to be verifiedxPrimitive attribute when, digital asset holder by show mutually card voucher and
[Data] that can be coincide with digital finger-print contained in voucherxTo determine that the data that holder is held are the numbers for uniquely corresponding to the voucher
Word assets, authentication can determine the primitive attribute of the digital asset (mutually by obtaining same mutual card voucher at other anonyms
Do not distorted after card), common data anchor is shown by corresponding anonym to confirm the legal mutual card relationship of the mutual card voucher.
Positive effect of the invention are as follows:
(or half anonymity theoretical based on 6 degree of connections) may be implemented between anonymous without authenticating authority in the present invention
The help at center, it will be able to which the data assets respectively held mutually are approved and authenticated.User can send out in actual verification behavior
Anonymous state was always maintained at before raw, while the content of digital asset discloses before actual verification behavior occurs without external.
Detailed description of the invention
Fig. 1 illustrates the data structure in the present invention.
Fig. 2 illustrates the voucher in embodiment 1 and generates process.
Fig. 3 illustrates the voucher verification process in embodiment 1.
Fig. 4 illustrates the voucher in embodiment 2 and generates process.
Fig. 5 illustrates the voucher verification process in embodiment 2.
Specific embodiment
The present invention is explained in further detail in the following with reference to the drawings and specific embodiments.
Embodiment 1:
It suppose there is 5 independent anonymous individuals to mutually demonstrate,prove and respectively hold a digital asset respectively, respectively [Data]1,
[Data]2,[Data]3,[Data]4,[Data]5。
Whole process is divided into anonymity and puts on record stage, Qualify Phase.
Anonymity is put on record the stage:
1) 5 owners keep anonymous in a network environment, disclose the anonymous mutually card of sending by network and invite, wherein mutually
Card invite in can only comprising mutually card invite mark, can also simultaneously comprising more details invitation definition (number of such as digital asset refers to
Line, desired assembling rule, desired public anchor point etc.) to improve communication efficiency；
2) 5 anonyms know that other people mutual card is invited by monitoring (system matches or Web broadcast), in anonymous environment
Middle response and determine common data anchor point (data be the public data for having time attribute approved jointly of all participants or
Data rule, or automatically generated by match system), (assembling rule defines the data fingerprint group in mutually card voucher to assembling rule
Dress sequence, verification mode, the packed data mode that can customize)；
3) 5 owners use the original for each self-generating digital asset of digital fingerprint algorithms (such as digital digest) arranged jointly
Beginning attribute-bit H1, H2, H3, H4, H5, and the primitive attribute mark respectively held mutually is disclosed；
4) 5 owners generate the digital digest H of common data anchor point using the digital fingerprint algorithms arranged jointlya；
5) as shown in Figure 1,5 owners become one by all primitive attribute marks of assembling compatible rule merging and digital digest
Array [D], to generate data structure [D] after array [D] the adeditive attribute informationall, generate [D]allDigital digest HR；
6) as shown in Fig. 2, 5 owners are compared HR, success of putting on record is indicated if consistent, 5 be each self-insurance of owner
Deposit [D]allAnd HRAs following validating documents.
Qualify Phase:
Assuming that needing [Data]2Holder need to verifying promoter confirm [Data]2It is original work, and [Data]2Holder
Its originality can not be demonstrate,proved certainly, and anonymous mutually card side is needed to give side evidence.
1)[Data]2Holder provide the H that generates in the mutual card stage to verifying promoterR, verify promoter and be somebody's turn to do
HRAfterwards, check whether oneself has locally possessed the same HR；
2) as shown in figure 3, if verifying promoter has possessed HR, then directly in corresponding [D] oneself heldallMiddle comparison H2
Consistency, be proved to be successful if consistent；Verify [D] of the promoter from oneselfallIn find H2, then it is counted with oneself
[Data] calculated2Fingerprint be compared, be proved to be successful if consistent.
3) if verifying promoter does not have HR, then to Web broadcast HRChecking request includes checking request mark in the checking request
Will and HR, possess HRNode response after, verifier can select trusted node in the node of all responses, and section is trusted in selection
Point mode include:
A) trusted node is selected in responsive node according to 6 degree of connections are theoretical；
B) all anonymous replies are compared, consistency highest result will be replied and be considered as reliable result；
Trusted node must be tested by the original text of common data anchor point, can be shown corresponding with digital finger-print public
Data anchor point original text, to show mutually to demonstrate,prove the legitimacy of voucher provided by it；
4) there are two types of modes to complete [Data] using third party's (i.e. trusted node of step 3 selection) is trusted by verifier2
Primitive attribute verifying:
A) [D] is obtained from trust third partyallIt is verified afterwards according to the method for step 2；
B) by [Data]2Primitive attribute mark (i.e. digital finger-print) be sent to trusted node, commission trusted node is by step
Rapid 2 are verified；
5) as shown in figure 3, if verifying promoter does not hold HR, do not find trusted node, verification process failure yet.
Embodiment 2:
It suppose there is 5 independent anonymous individuals to mutually demonstrate,prove and respectively hold a digital asset respectively, respectively [Data]1,
[Data]2,[Data]3,[Data]4,[Data]5。
Whole process is divided into anonymity and puts on record stage, Qualify Phase.
Anonymity is put on record the stage:
1) 5 owners keep anonymous in a network environment, disclose the anonymous mutually card of sending by network and invite, wherein mutually
Card includes mutually to demonstrate,prove to invite mark in inviting；
2) 5 anonyms know that other people mutual card is invited by monitoring (system matches or Web broadcast), in anonymous environment
Middle response and determine assembling rule (assembling rule define data fingerprint assembling sequence in mutually card voucher, verification mode, can be from
The packed data mode of definition)；
3) 5 owners use the original for each self-generating digital asset of digital fingerprint algorithms (such as digital digest) arranged jointly
Beginning attribute-bit H1, H2, H3, H4, H5, and the primitive attribute mark respectively held mutually is disclosed；
4) 5 owners become an array [D] by all primitive attribute marks of assembling compatible rule merging, for the array [D]
Data structure [D] is generated after adeditive attribute informationall；
5) as shown in figure 4,5 owners are compared [D]all, indicate success of putting on record if consistent, 5 for owner respectively
It saves [D]allAs following validating documents.
Qualify Phase:
Assuming that needing [Data]2Holder need to verifying promoter confirm [Data]2It is original work, and [Data]2Holder
Its originality can not be demonstrate,proved certainly, and anonymous mutually card side is needed to give side evidence.
1)[Data]2Holder provide [D] that generates in the mutual card stage to verifying promoterall, verify promoter and obtain
[D] must be somebody's turn to doallAfterwards, check whether oneself has locally possessed same [D]all；
2) as shown in figure 5, if verifying promoter has possessed corresponding [D]all, then directly in [D] oneself heldallIn
Compare H2Consistency, be proved to be successful if consistent；Verify [D] of the promoter from oneselfallIn find H2, then by itself and oneself
[Data] that oneself calculates2Fingerprint be compared, be proved to be successful if consistent.
3) if verifying promoter does not have [D]all, then to Web broadcast [D]allChecking request includes testing in the checking request
Demonstrate,prove request flag and [D]all, possess [D]allNode response after, verifier can select in the node of all responses trust
Node, selects the mode of trusted node to include:
A) trusted node is selected in responsive node according to 6 degree of connections are theoretical；
B) all anonymous replies are compared, consistency highest result will be replied and be considered as reliable result；
Trusted node must be tested by the original text of common data anchor point, can be shown corresponding with digital finger-print public
Data anchor point original text, to show mutually to demonstrate,prove the legitimacy of voucher provided by it；
4) there are two types of modes to complete [Data] using third party's (i.e. trusted node of step 3 selection) is trusted by verifier2
Primitive attribute verifying:
A) [D] is obtained from trust third partyallIt is verified afterwards according to the method for step 2；
B) by [Data]2Primitive attribute mark (i.e. digital finger-print) be sent to trusted node, commission trusted node is by step
Rapid 2 are verified；
5) as shown in figure 5, if verifying promoter does not hold [D]all, trusted node is not found yet, verification process loses
It loses.
Claims (11)
1. a kind of anonymity equity of digital asset primitive attribute mutually demonstrate,proves method, the steps include:
1) digital asset owner x calculates its digital asset [Data]xPrimitive attribute identify Hx；Digital asset owner is in net
Anonymous mutually card is broadcasted in network to invite, and determines each participant for generating mutually card voucher；Wherein, it is mutually only invited comprising mutually card in card invitation
The primitive attribute comprising digital asset identifies H in mark or mutually card invitationx, desired assembling rule and desired common data
Anchor；
2) primitive attribute of oneself is identified H by each participant i in each participantiAnd other in each participant
The primitive attribute mark that participant provides merges into overall data [D]all；
3) each participant is by the overall data [D]allAs [Data]xMutual card voucher；
4) digital asset [Data] need to be verifiedxPrimitive attribute when, digital asset holder x shows [Data]xWith correspond
Mutual card voucher to authentication；
5) authentication is according to can be with [Data]xCorresponding mutual card voucher determines the digital asset [Data]xPrimitive attribute；
Wherein, the primitive attribute of digital asset, which refers to, confirms that the digital asset is original work and the attribute that was not tampered with, primitive attribute mark
Know the identification information for referring to primitive attribute.
2. the method as described in claim 1, which is characterized in that in step 2), each participant determines a public number first
According to anchor point, then each participant i in each participant is by the number of the common data anchor point or the common data anchor point
Fingerprint, the primitive attribute mark H of oneselfiAnd the primitive attribute mark that other participants provide in each participant is merged into
Overall data [D]all。
3. method according to claim 1 or 2, which is characterized in that in step 2), each participant i calculates the overall data
[D]allDigital finger-print HR, and by digital finger-print HROther participants being sent in each participant；In step 3), institute
State the digital finger-print H that each participant will receiveRWith the calculated result H of oneselfRIt is compared, if unanimously, by the overall data
[D]allWith the HRAs [Data]xMutual card voucher.
4. method according to claim 2, which is characterized in that the method for determining the common data anchor point are as follows: each participation
Person negotiates the public data for having time attribute that one approves jointly or data rule as the common data anchor point；Or by brining together
System automatically generates the common data anchor point.
5. method according to claim 1 or 2, which is characterized in that in step 2), each participant also determines an assembling rule
Then；The assembling rule defines the data fingerprint assembling sequence mutually demonstrate,proved in voucher, verification mode, packed data mode.
6. method as claimed in claim 3, which is characterized in that the authentication determines the digital asset according to the mutual card voucher
[Data]xPrimitive attribute method are as follows: the authentication obtains [D] from the mutual card voucherallOr digital finger-print HRAfterwards, it examines
Look into whether oneself has locally possessed the digital finger-print HR；If a) possessing the digital finger-print HR, then judge oneself to hold with
The digital finger-print HRCorresponding overall data [D]allIn primitive attribute identify HxThe digital asset calculated with oneself
[Data]xPrimitive attribute identify HxIt is whether consistent, it is proved to be successful if consistent；If b) authentication oneself is locally without described
Digital finger-print HRCorresponding [D]all, then to Web broadcast checking request, in the checking request include checking request mark and described
Digital finger-print HR；The authentication selects a node as trusted node in all nodes for responding the checking request；The verifying
Side the digital asset [Data] is verified by the trusted nodexPrimitive attribute.
7. method as claimed in claim 6, which is characterized in that the authentication verifies the digital asset by the trusted node
[Data]xPrimitive attribute method are as follows: the authentication first is obtained and the digital finger-print H from the trusted nodeRCorresponding entirety
Data [D]all；Then determine the overall data [D]allIn primitive attribute identify HxThe digital asset calculated with oneself
[Data]xPrimitive attribute identify HxIt is whether consistent, it is proved to be successful if consistent.
8. method as claimed in claim 6, which is characterized in that the authentication verifies the digital asset by the trusted node
[Data]xPrimitive attribute method are as follows: the authentication is by the digital asset [Data]xPrimitive attribute identify HxIt is sent to letter
Appoint node；Then the trusted node judges oneself holding with the digital finger-print HRCorresponding overall data [D]allIn number
Word fingerprint HxThe digital asset [Data] calculated with oneselfxPrimitive attribute identify HxIt is whether consistent, if consistent verifying at
Function.
9. method as claimed in claim 6, which is characterized in that the method for selecting the trusted node are as follows: managed according to six degree of connections
By selected in responsive node a node as the trusted node；Or all anonymous replies of authentication comparison, from reply one
A node is chosen as the trusted node in the highest node of cause property.
10. method according to claim 1 or 2, which is characterized in that the participant keeps anonymous during mutual card, i.e.,
The participant is anonymous participant.
11. method according to claim 1 or 2, which is characterized in that the primitive attribute identifies HxFor digital asset [Data]x
Digital finger-print, primitive attribute identify HiFor digital asset [Data]iDigital finger-print.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610861292.7A CN106452784B (en) | 2016-09-28 | 2016-09-28 | A kind of mutual card method of anonymity equity of digital asset primitive attribute |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610861292.7A CN106452784B (en) | 2016-09-28 | 2016-09-28 | A kind of mutual card method of anonymity equity of digital asset primitive attribute |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106452784A CN106452784A (en) | 2017-02-22 |
| CN106452784B true CN106452784B (en) | 2019-07-23 |
Family
ID=58170233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610861292.7A Active CN106452784B (en) | 2016-09-28 | 2016-09-28 | A kind of mutual card method of anonymity equity of digital asset primitive attribute |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106452784B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107527203A (en) * | 2017-07-24 | 2017-12-29 | 湖南搜云网络科技股份有限公司 | Subrogation method, central server and the storage medium of digital asset |
| CN111090700B (en) * | 2019-12-13 | 2023-07-18 | 北京阿尔山区块链联盟科技有限公司 | Data management method and device and electronic equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102362268A (en) * | 2008-12-05 | 2012-02-22 | 社会传播公司 | Pervasive realtime framework |
| CN105354747A (en) * | 2015-10-09 | 2016-02-24 | 徐蔚 | Information processing network and method based on uniform code sending, and sensing access equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20130010911A (en) * | 2008-12-05 | 2013-01-29 | 소우셜 커뮤니케이션즈 컴퍼니 | Realtime kernel |
-
2016
- 2016-09-28 CN CN201610861292.7A patent/CN106452784B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102362268A (en) * | 2008-12-05 | 2012-02-22 | 社会传播公司 | Pervasive realtime framework |
| CN105354747A (en) * | 2015-10-09 | 2016-02-24 | 徐蔚 | Information processing network and method based on uniform code sending, and sensing access equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106452784A (en) | 2017-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10333705B2 (en) | Methods and apparatus for providing attestation of information using a centralized or distributed ledger | |
| CN108876374B (en) | Block chain network identity document authentication method and system | |
| US5638447A (en) | Compact digital signatures | |
| US5610982A (en) | Compact certification with threshold signatures | |
| Lai et al. | Applying semigroup property of enhanced Chebyshev polynomials to anonymous authentication protocol | |
| US7117368B2 (en) | Anonymous participation authority management system | |
| US20160191513A1 (en) | Binding a data transaction to a person's identity using biometrics | |
| JP4692284B2 (en) | Group signature system, method, apparatus, and program | |
| CN108646983A (en) | The treating method and apparatus of storage service data on block chain | |
| CN101317360A (en) | Physical secret sharing and proofs of vicinity using PUFs | |
| US9438589B2 (en) | Binding a digital file to a person's identity using biometrics | |
| KR102332226B1 (en) | Blockchain network system being capable of verifying a blockchain ledger and method for verifying a blockchain ledger | |
| CN102238146A (en) | Authentication method, device, authentication center and system | |
| JP2002026899A (en) | Verification system for ad hoc wireless communication | |
| CN109102404B (en) | Privacy protection method and system for block chain real-name communication | |
| Zhu et al. | Anonymous voting scheme for boardroom with blockchain | |
| CN106452784B (en) | A kind of mutual card method of anonymity equity of digital asset primitive attribute | |
| US20220147986A1 (en) | Method and system for single purpose public keys for public ledgers | |
| Xu et al. | Secure fuzzy identity-based public verification for cloud storage | |
| CN103858377A (en) | Method for managing and checking data from different identity domains organized into a structured set | |
| CN113761578A (en) | Document true checking method based on block chain | |
| Mark et al. | A secured online voting system by using blockchain as the medium | |
| Chiou et al. | Design and implementation of a mobile voting system using a novel oblivious and proxy signature | |
| CN110851804A (en) | Alliance chain identity authentication method based on electronic contract | |
| Byun | PDAKE: a provably secure PUF-based device authenticated key exchange in cloud setting |
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 |