CN102035846A - Social network user identity authentication method based on relation statement - Google Patents

Social network user identity authentication method based on relation statement Download PDF

Info

Publication number
CN102035846A
CN102035846A CN 201010601818 CN201010601818A CN102035846A CN 102035846 A CN102035846 A CN 102035846A CN 201010601818 CN201010601818 CN 201010601818 CN 201010601818 A CN201010601818 A CN 201010601818A CN 102035846 A CN102035846 A CN 102035846A
Authority
CN
China
Prior art keywords
relation
statement
user
resource
depth
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.)
Granted
Application number
CN 201010601818
Other languages
Chinese (zh)
Other versions
CN102035846B (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.)
Beihang University
Original Assignee
Beihang University
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 Beihang University filed Critical Beihang University
Priority to CN2010106018180A priority Critical patent/CN102035846B/en
Publication of CN102035846A publication Critical patent/CN102035846A/en
Application granted granted Critical
Publication of CN102035846B publication Critical patent/CN102035846B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a social network user identity authentication method based on a relation statement, comprising the following three steps of: 1. issuing a relation statement; 2. defining an access rule; and 3. implementing relation authentication. A user determines the relation type between the user and a friend by issuing the relation statement to the direct-relation friend of the user; a relation server builds a relation path for the user according to the relation statement issued by the user; because each level of relation is signed by a relation statement publisher, the reliability of the level of relation can be effectively guaranteed so as to integrally improve the reliability of the relation path. The method is simple and convenient for operation and convenient for verification and has better practical value and wide application prospect in the technical field of network security.

Description

A kind of social network method for authenticating user identity based on the relation statement
(1) technical field
The present invention relates to a kind of social network method for authenticating user identity based on the relation statement, it is used for solving the problem that social network relies on relation realization access control between the member, belongs to the network security technology field.
(2) background technology
Along with being widely current of social network and increasing of customer group, the safety problem in the social network has caused that people more and more pay close attention to.Wherein, access control problem is an important content in the social network safety problem.
In social network, the user creates data resource and shares with other people, and in some cases, the user may wish that the private data resource created only shares with the good friend of particular kind of relationship.But problem is, is not direct good friend's relation between access requestor and owner, but when having indirect relation, how we go to verify the authenticity of this relation.
Current social network sites is based on the Design Mode of centralization mostly, and the relation between the member generally is to set up for it by the attribute that Website server provides according to the user, but there is serious potential safety hazard in such method for designing.At first, the user is difficult to the behavior of Website server is exercised supervision; Secondly, this method is from causing impersonation attack in essence easily, and promptly when the lawless person utilized injured party's personally identifiable information of its grasp to pretend to be the injured party, the user was difficult to lawless person's identity is discerned.
Document " Lockr: " (Amin Tootoonchian in order to realize the better privacy of social networks, Stefan Saroiu, Yashar Ganjali, " Lockr:Better privacy for socia1 networks ", CoNEXT ' 09, December1-4,2009, Rome, the title that Ita1y. " Lockr " gets for its scheme for the author) in a kind of certificate scheme based on pass thought has been proposed.This scheme requires the both sides of opening relationships mutually for the other side issues the relation proof, proves clear and definite both social relationships by relation.When the requestor applied for the resource of access destination object, showing corresponding relation proved, access control actuating station is verified the relation proof, to determine requestor's identity.The weak point of this scheme is, can only verify direct good friend's relation, can't to and the user between have an indirect relation the good friend concern authentication.
(3) summary of the invention
1, purpose: in order to overcome above problem, realization is to the authentication of user identity with indirect relation, the invention provides a kind of social network method for authenticating user identity based on the relation statement, it can solve and rely on the problem that need concern authentication when relation is implemented access control between the member to access requestor in the social network.
2, technical scheme: a kind of social network method for authenticating user identity of the present invention based on the relation statement, these method concrete steps are as follows:
Step 1: issue the relation statement
The user at first issues the relation statement for its direct good friend, comprises this Several Parameters in the relation statement: { publisher of relation statement, recipient, relationship type, timestamp }.Wherein, the publisher of relation statement is meant the promulgation person of this relation statement; The recipient is meant that relation statement publisher states the object of relation with it; Relationship type refers to concern the relation that is had between statement publisher and the recipient; The time of timestamp indexical relation statement signature.The relation statement of extensible markup language form is as follows:
<relation statement 〉
<publisher〉publisher public key</publisher 〉
<recipient〉recipient's PKI</recipient 〉
<relationship type〉relationship type</relationship type 〉
<timestamp〉current time</timestamp 〉
</relation statement 〉
For example in Fig. 2, A wants B is issued the relation statement with Peer Relationships, and this relation statement can be expressed as: Sig A(P A, P B, CollegueOf, TS), wherein TS refers to timestamp.In this programme, the user issues relation statement for its all direct good friends, and relation statement result is signed, and will concern at last to state to be saved in and concern on the server.Concern that server for each user reserves a relation statement storage directory, is used for depositing its relation of issuing statement.
Step 2: definition access rule
We utilize relationship type to specify authorization object, introduce simultaneously and authorize the degree of depth as the access control parameter.An access control rule also comprises four parameters: { authorization object is authorized the degree of depth for owner, resource identifier }.Wherein, the owner is meant the founder of resource; Resource identifier is represented the resource id of certain resource correspondence, and authorization object both can be that certain relation also can be certain individuality, authorizes the degree of depth to refer to the distance in the path set up according to certain relation between the user.Such as the path of setting up by Peer Relationships between A and the F is A-〉C-〉F, then the degree of depth between this moment F and A is 2.The access control rule of extensible markup language form is as follows:
<access rule 〉
<owner〉owner's PKI</owner 〉
<resource identifier〉resource identifier</resource identifier 〉
<authorization object〉relationship type of authorizing or individuality</authorization object 〉
<authorize the degree of depth〉depth value of authorizing</authorize the degree of depth 〉
</access rule 〉
At last, the user signs to the resource access rule that defines, and the access control rule after will signing is kept in the local third-party server.
Step 3: implement the relation authentication
For example to have created identifier be the resource of rid to user A, and set this resource and share to the colleague, and sharing the degree of depth is 2.
We suppose that user F wants to visit this resource, then identifying procedure as shown in Figure 3, each step is described as follows:
1) F sends the application of access resources rid to A, and shows the PKI of oneself;
2) A a string random number of public key encryption and the session key of F, and return to F;
3) F returns the random number that decrypts to A with after the session key that decrypts;
4) A transfers the access rule AR=Sig of this resource correspondence to home server A(P A, rid, CollegueOf, 2);
5) A according to access rule to concerning that server submits to the path to set up application, to concern the server transmission: { relationship type and the degree of depth of own PKI, requestor's PKI, requirement }, and encrypt with the PKI that concerns server can be expressed as:
Figure BDA0000039987210000031
6) concern the requirement searching path of server according to A, find A-C-this paths of F, to using the public key encryption of A behind result's signature again.That is,
Figure BDA0000039987210000032
7) the A checking concerns whether result and decision that server returns authorize the F access rights.
3, advantage and effect:
The present invention comes clearly and the relation between the person of being declared for its direct good friend issues the relation statement by the user, concerns that server then comes to make that for to concern that both sides set up the path this path that concerns is more firmly credible according to the relation statement of user's signature approval.Simultaneously, introduce the visit degree of depth has also better been agreed with social networks as parameter social characteristic during mandate.All in all, the present invention has following advantage:
1) autonomous customization: in this programme, user oneself concerns statement to its direct good friend and upgrades, and the access control policy of definition resource, and all relation statement results and access control rule are by user's signature, and other people can't change.Social networks itself is only as the network application service provider, the not management of participating user data resource, thus realized that user data resource management and network service are separated, and have given prominence to the control of user to own resource.
2) convenient checking: concern that each link is all signed by different relation statement promulgation persons in the path that server returns, the user can use relation to state that promulgation person's PKI verifies relationship type.
3) behavior constraint: because the relation of each link all concerns the responsibility of signatory to this part direct relation by concerning that the publisher carries out signature authentication, farthest having retrained.
4) easy and simple to handle: the user mainly carries out two operations as client, that is: to direct good friend concern the statement and to the access control policy of resources definition based on relationship type; The object that access requestor only need provide the PKI of oneself and want to visit; All the other most of work are finished by server.
(4) description of drawings
Fig. 1 flow chart of the present invention.
Fig. 2 social network member relation schematic diagram.
The once concrete identifying procedure schematic diagram of Fig. 3.
Symbol description is as follows among the figure:
A among Fig. 2, B, C, D, E, F, G represent the user, and arrow is represented the sensing that concerns between two users, and both relationship types indicated in the literal on the arrow.
AR among Fig. 3 is meant access rule (Access Rule), nonce refers to a string random number, object feeling the pulse with the finger-tip mark object, terminate refers to session stop, and CS is the code name that concerns server, and session key refers to session key, College Of refers to Peer Relationships, depth refers to the degree of depth, and rid refers to the identifier of resource, P XThe PKI that refers to user X, E X(Y) refer to encrypt Y, Sig with key X X(Y||Z) refer to that user X carries out digital signature to the content in the bracket, || refer to data are connected in series.
(5) embodiment:
See Fig. 1, the present invention is a kind of social network method for authenticating user identity based on the relation statement, and these method concrete steps are as follows:
Step 1: issue the relation statement
The user at first issues the relation statement for its direct good friend, comprises this Several Parameters in the relation statement: { publisher of relation statement, recipient, relationship type, timestamp }.Wherein the timestamp indexical relation is stated the time of signature.The extensible markup language form is that the relation statement of XML form is as follows:
<relation statement 〉
<publisher〉publisher public key</publisher 〉
<recipient〉recipient's PKI</recipient 〉
<relationship type〉relationship type</relationship type 〉
<timestamp〉current time</timestamp 〉
</relation statement 〉
For example in Fig. 2, A wants B is issued the relation statement with Peer Relationships, and this relation statement can be expressed as: Sig A(P A, P B, CollegueOf, TS), wherein TS refers to timestamp.In this programme, the user issues relation statement for its all direct good friends, and relation statement result is signed, and will concern at last to state to be saved in and concern on the server.Concern that server for each user reserves a relation statement storage directory, is used for depositing its relation of issuing statement.
Step 2: definition access rule
We utilize relationship type to specify authorization object, introduce simultaneously and authorize the degree of depth as the access control parameter.An access control rule also comprises four parameters: { authorization object is authorized the degree of depth for owner, resource identifier }.Wherein, resource identifier is represented the resource id of certain resource correspondence, and authorization object both can be that certain relation also can be certain individuality, authorizes the degree of depth to refer to the distance in the path set up according to certain relation between the user.Such as the path of setting up by Peer Relationships between A and the F is A-〉C-〉F, then the degree of depth between this moment F and A is 2.The access control rule of XML form is as follows:
<access rule 〉
<owner〉owner's PKI</owner 〉
<resource identifier〉resource identifier</resource identifier 〉
<authorization object〉relationship type of authorizing or individuality</authorization object 〉
<authorize the degree of depth〉depth value of authorizing</authorize the degree of depth 〉
</access rule 〉
At last, the user signs to the resource access rule that defines, and the access control rule after will signing is kept in the local third-party server.
Step 3: implement the relation authentication
For example to have created identifier be the resource of rid to user A, and set this resource and share to the colleague, and sharing the degree of depth is 2.
We suppose that user F wants to visit this resource, then identifying procedure as shown in Figure 3, each step is described as follows:
1) F sends the application of access resources rid to A, and shows the PKI of oneself;
2) A a string random number of public key encryption and the session key of F, and return to F;
3) F returns the random number that decrypts to A with after the session key that decrypts;
4) A transfers the access rule AR=Sig of this resource correspondence to home server A(P A, rid, CollegueOf, 2);
5) A according to access rule to concerning that server submits to the path to set up application, to concern the server transmission: { relationship type and the degree of depth of own PKI, requestor's PKI, requirement }, and encrypt with the PKI that concerns server can be expressed as:
Figure BDA0000039987210000051
6) concern the requirement searching path of server according to A, find A-C-this paths of F, to using the public key encryption of A behind result's signature again.That is,
7) the A checking concerns whether result and decision that server returns authorize the F access rights.

Claims (1)

1. social network method for authenticating user identity based on relation statement, it is characterized in that: these method concrete steps are as follows: step 1: issue the relation statement
The user at first issues the relation statement for its direct good friend, comprises this Several Parameters in the relation statement: { publisher of relation statement, recipient, relationship type, timestamp }; Wherein, the publisher of relation statement is meant the promulgation person of this relation statement; The recipient is meant that relation statement publisher states the object of relation with it; Relationship type refers to concern the relation that is had between statement publisher and the recipient; The time of timestamp indexical relation statement signature; The relation statement of extensible markup language form is as follows:
<relation statement 〉
<publisher〉publisher public key</publisher 〉
<recipient〉recipient's PKI</recipient 〉
<relationship type〉relationship type</relationship type 〉
<timestamp〉current time</timestamp 〉
</relation statement 〉
If A wants B is issued the relation statement with Peer Relationships, this relation statement can be expressed as: Sig A(P A, P B, CollegueOf, TS), wherein TS refers to timestamp, at this, the user issues relation statement for its all direct good friends, and relation statement result is signed, and will concern at last to state to be saved in and concern on the server; Concern that server for each user reserves a relation statement storage directory, is used for depositing its relation of issuing statement;
Step 2: definition access rule
We utilize relationship type to specify authorization object, introduce simultaneously and authorize the degree of depth as the access control parameter; An access control rule also comprises four parameters: { authorization object is authorized the degree of depth for owner, resource identifier }; Wherein, the owner is meant the founder of resource; Resource identifier is represented the resource id of certain resource correspondence, and authorization object both can be that certain relation also can be certain individuality, authorizes the degree of depth to refer to the distance in the path set up according to certain relation between the user; As the path of setting up by Peer Relationships between A and the F is A-〉C-〉F, then the degree of depth between this moment F and A is 2; The access control rule of extensible markup language form is as follows:
<access rule 〉
<owner〉owner's PKI</owner 〉
<resource identifier〉resource identifier</resource identifier 〉
<authorization object〉relationship type of authorizing or individuality</authorization object 〉
<authorize the degree of depth〉depth value of authorizing</authorize the degree of depth 〉
</access rule 〉
At last, the user signs to the resource access rule that defines, and the access control rule after will signing is kept in the local third-party server;
Step 3: implement the relation authentication
If it is the resource of rid that user A has created identifier, and sets this resource and share to the colleague, sharing the degree of depth is 2;
We suppose that user F wants to visit this resource, and then identifying procedure is that implementation procedure is as follows:
1) F sends the application of access resources rid to A, and shows the PKI of oneself;
2) A a string random number of public key encryption and the session key of F, and return to F;
3) F returns the random number that decrypts to A with after the session key that decrypts;
4) A transfers the access rule AR=Sig of this resource correspondence to home server A(P A, rid, CollegueOf, 2);
5) A according to access rule to concerning that server submits to the path to set up application, to concern the server transmission: { relationship type and the degree of depth of own PKI, requestor's PKI, requirement }, and encrypt with the PKI that concerns server can be expressed as:
Figure FDA0000039987200000021
6) concern the requirement searching path of server according to A, find A-C-this paths of F, to using the public key encryption of A behind result's signature again; That is,
Figure FDA0000039987200000022
7) the A checking concerns whether result and decision that server returns authorize the F access rights.
CN2010106018180A 2010-12-22 2010-12-22 Social network user identity authentication method based on relation statement Active CN102035846B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010106018180A CN102035846B (en) 2010-12-22 2010-12-22 Social network user identity authentication method based on relation statement

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010106018180A CN102035846B (en) 2010-12-22 2010-12-22 Social network user identity authentication method based on relation statement

Publications (2)

Publication Number Publication Date
CN102035846A true CN102035846A (en) 2011-04-27
CN102035846B CN102035846B (en) 2012-07-04

Family

ID=43888169

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010106018180A Active CN102035846B (en) 2010-12-22 2010-12-22 Social network user identity authentication method based on relation statement

Country Status (1)

Country Link
CN (1) CN102035846B (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103036869A (en) * 2011-10-08 2013-04-10 美国博通公司 Social device service and support via automatic group association
CN103220315A (en) * 2012-01-19 2013-07-24 北京千橡网景科技发展有限公司 Method and device for calculating user distances in social network service website
CN103248483A (en) * 2013-03-22 2013-08-14 张经纶 Real-name authentication apparatus
CN103312757A (en) * 2012-03-15 2013-09-18 深圳市腾讯计算机系统有限公司 Picture sharing method and system
CN104081799A (en) * 2012-01-26 2014-10-01 脸谱公司 Social hotspot
CN104333530A (en) * 2013-07-22 2015-02-04 深圳市腾讯计算机系统有限公司 Information credibility verifying method and apparatus
CN104487993A (en) * 2012-07-03 2015-04-01 律商联讯风险解决方案佛罗里达公司 Systems and methods for identity authentication using a social network
WO2015063729A1 (en) * 2013-11-01 2015-05-07 International Business Machines Corporation Anonymously sharing resources based on social network user data
CN106534041A (en) * 2015-09-09 2017-03-22 腾讯科技(深圳)有限公司 Verification method, verification platform and client
CN106941475A (en) * 2016-01-04 2017-07-11 阿里巴巴集团控股有限公司 A kind of authentication method and device based on trusting relationship
CN107079002A (en) * 2014-10-17 2017-08-18 三星电子株式会社 Terminal and its operating method for Internet of Things
CN108881666A (en) * 2017-05-11 2018-11-23 柯尼卡美能达株式会社 Permission authorizes device and permission authorizes the control program of device
CN111475841A (en) * 2020-04-07 2020-07-31 腾讯科技(深圳)有限公司 Access control method, related device, equipment, system and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101552784A (en) * 2009-04-30 2009-10-07 浙江大学 Combined identity certification method of Web service chain
CN101707594A (en) * 2009-10-21 2010-05-12 南京邮电大学 Single sign on based grid authentication trust model

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101552784A (en) * 2009-04-30 2009-10-07 浙江大学 Combined identity certification method of Web service chain
CN101707594A (en) * 2009-10-21 2010-05-12 南京邮电大学 Single sign on based grid authentication trust model

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103036869A (en) * 2011-10-08 2013-04-10 美国博通公司 Social device service and support via automatic group association
CN103220315A (en) * 2012-01-19 2013-07-24 北京千橡网景科技发展有限公司 Method and device for calculating user distances in social network service website
CN103220315B (en) * 2012-01-19 2018-01-05 北京千橡网景科技发展有限公司 The method and apparatus that user distance is calculated in social
CN104081799A (en) * 2012-01-26 2014-10-01 脸谱公司 Social hotspot
CN104081799B (en) * 2012-01-26 2016-04-20 脸谱公司 Social focus
CN103312757B (en) * 2012-03-15 2017-01-25 深圳市腾讯计算机系统有限公司 Picture sharing method and system
CN103312757A (en) * 2012-03-15 2013-09-18 深圳市腾讯计算机系统有限公司 Picture sharing method and system
CN104487993A (en) * 2012-07-03 2015-04-01 律商联讯风险解决方案佛罗里达公司 Systems and methods for identity authentication using a social network
CN104487993B (en) * 2012-07-03 2018-03-13 律商联讯风险解决方案佛罗里达公司 The system and method for authentication is carried out using social networks
CN103248483B (en) * 2013-03-22 2016-12-28 张经纶 A kind of real name verification device
CN103248483A (en) * 2013-03-22 2013-08-14 张经纶 Real-name authentication apparatus
CN104333530A (en) * 2013-07-22 2015-02-04 深圳市腾讯计算机系统有限公司 Information credibility verifying method and apparatus
CN104333530B (en) * 2013-07-22 2019-02-22 深圳市腾讯计算机系统有限公司 Information credibility verification method and device
US10225258B2 (en) 2013-11-01 2019-03-05 International Business Machines Corporation Anonymously sharing resources based on social network user data
WO2015063729A1 (en) * 2013-11-01 2015-05-07 International Business Machines Corporation Anonymously sharing resources based on social network user data
CN107079002A (en) * 2014-10-17 2017-08-18 三星电子株式会社 Terminal and its operating method for Internet of Things
US10645089B2 (en) 2014-10-17 2020-05-05 Samsung Electronics Co., Ltd. Terminal for internet of things and operation method of the same
CN107079002B (en) * 2014-10-17 2021-02-02 三星电子株式会社 Electronic equipment for Internet of things, Internet of things device, method and system thereof
US11477206B2 (en) 2014-10-17 2022-10-18 Samsung Electronics Co., Ltd. Terminal for internet of things and operation method of the same
CN106534041A (en) * 2015-09-09 2017-03-22 腾讯科技(深圳)有限公司 Verification method, verification platform and client
CN106534041B (en) * 2015-09-09 2020-08-07 腾讯科技(深圳)有限公司 Verification method, verification platform and client
CN106941475A (en) * 2016-01-04 2017-07-11 阿里巴巴集团控股有限公司 A kind of authentication method and device based on trusting relationship
CN108881666A (en) * 2017-05-11 2018-11-23 柯尼卡美能达株式会社 Permission authorizes device and permission authorizes the control program of device
US10409969B2 (en) 2017-05-11 2019-09-10 Konica Minolta, Inc. Authorization device that grants authority to guest users
CN108881666B (en) * 2017-05-11 2020-03-17 柯尼卡美能达株式会社 Authority granting device and control program for authority granting device
CN111475841A (en) * 2020-04-07 2020-07-31 腾讯科技(深圳)有限公司 Access control method, related device, equipment, system and storage medium

Also Published As

Publication number Publication date
CN102035846B (en) 2012-07-04

Similar Documents

Publication Publication Date Title
CN102035846B (en) Social network user identity authentication method based on relation statement
CN105991278B (en) A kind of ciphertext access control method based on CP-ABE
US11122047B2 (en) Invitation links with enhanced protection
CN112688927B (en) Block chain-based distributed access control method
CN106254324A (en) A kind of encryption method storing file and device
US20160269416A1 (en) Anonymously sharing resources based on social network user data
CN110069918A (en) A kind of efficient double factor cross-domain authentication method based on block chain technology
CN102333096B (en) Creditworthiness control method and system for anonymous communication system
Guo et al. Proposed security mechanism for XMPP-based communications of ISO/IEC/IEEE 21451 sensor networks
CN106911627B (en) A kind of true identity method of controlling security and its system based on eID
CN109687965A (en) The real name identification method of subscriber identity information in a kind of protection network
CN102223420A (en) Digital content distribution method for multimedia social network
CN114008968A (en) System, method and storage medium for license authorization in a computing environment
US8793773B2 (en) System and method for providing reputation reciprocity with anonymous identities
Ernest et al. Privacy enhancement scheme (PES) in a blockchain-edge computing environment
Xue et al. A blockchain based user subscription data management and access control scheme in mobile communication networks
Ahmed et al. Turning trust around: smart contract-assisted public key infrastructure
Niu et al. An effective and secure access control system scheme in the cloud
Ahmed et al. Toward fine‐grained access control and privacy protection for video sharing in media convergence environment
Halpin Semantic insecurity: security and the semantic web
Schulz et al. d 2 Deleting Diaspora: Practical attacks for profile discovery and deletion
Buccafurri et al. Implementing advanced electronic signature by public digital identity system (SPID)
Zhang et al. Protocol derivation system for the Needham–Schroeder family
Halunen et al. Context-aware systems and adaptive user authentication
US20190068573A1 (en) Detection of the network logon protocol used in pass-through authentication

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant