US20100180119A1

Key exchanging apparatus

Claim Score by NHIP

Abstract

A key exchanging apparatus transmits the contribution data to the plurality of counterpart apparatuses, generates a signer contribution confirmation signature with respect to a contribution data set including all the contribution data received from the plurality of counterpart apparatuses, generates auxiliary data and auxiliary data validity certification sentence from the contribution data set and the contribution random number, transmits the auxiliary data, the auxiliary data validity certification sentence and the contribution confirmation signature to the plurality of counterpart apparatuses, verifies validity of auxiliary data by using the counterpart identifier set, the counterpart public key set, the contribution confirmation signature set including the data received from the plurality of counterpart apparatuses, the auxiliary data set and the auxiliary data validity certification sentence set, and generates a public key from the contribution data set and the auxiliary data received from the plurality of counterpart apparatuses.

US20100180119A1, drawing sheet 1 — Sheet 1 of 5

Term

4.4 yearsto projected expiry

Projected expiry 27 February 2031, counted from filing; an application has no term until it is granted.

7 claims: 4 independent, 3 dependent

6
A key exchanging apparatus which receives a public key, a secret key, an identifier, a counterpart public key set, a counterpart identifier set, a session number, and a random number inputted thereto, performs communication with a plurality of counterpart apparatuses identified by identifiers belonging to the counterpart identifier set, and generates and outputs a public key, the apparatus comprising:a contribution random number generating unit that generates a contribution random number by using the random number;a contribution data generating unit that generates contribution data from the contribution random number generated by the contribution random number generating unit;a communication unit that transmits the contribution data to the plurality of counterpart apparatuses;a signing unit that generates a signer contribution confirmation signature with respect to a contribution data set including every contribution data received by the communication unit from the plurality of counterpart apparatuses by using the secret key and the public key;a verifiable auxiliary data generating unit that generates auxiliary data and an auxiliary data validity certification sentence from the contribution data set and the contribution random number, the auxiliary data, the auxiliary data validity certification sentence and the contribution confirmation signature being transmitted to the plurality of counterpart apparatuses by the communication unit;a validity verifying unit that verifies validity of the auxiliary data by using the counterpart identifier set and the counterpart public key set, the contribution confirmation signature set, the auxiliary data set and the auxiliary data validity certification sentence including data received by the communication unit from the plurality of counterpart apparatus;and a key generating unit that generates the public key from the contribution data set and the auxiliary data received by the communication unit from the plurality of counterpart apparatus.
9
Broadest claimClaim Score 35, narrow(NHIP)A key exchanging method in which a public key, a secret key, an identifier, a counterpart public key set, a counterpart identifier set, a session number and a random number are assigned, communication with a plurality of counterpart apparatuses identified by identifiers belonging to the counterpart identifier set is performed, and a public key is generated and outputted, the method comprising:generating a contribution random number by using the random number;generating contribution data from the contribution random number;transmitting the contribution data to the plurality of counterpart apparatuses;generating a signer contribution confirmation signature with respect to a contribution data set including all the contribution data received from the plurality of counterpart apparatuses by using the secret key and the public key;generating auxiliary data and an auxiliary data validity certification sentence from the contribution data set and the contribution random number, transmitting the auxiliary data, the auxiliary data validity certification sentence and the contribution confirmation signature to the plurality of counterpart apparatuses;verifying validity of the auxiliary data by using the counterpart identifier set and the counterpart public key set, the contribution confirmation signature set the auxiliary data set and the auxiliary data validity certification sentence including data received from the plurality of counterpart apparatus;and generating the public key by the contribution data set and the auxiliary data received from the plurality of counterpart apparatus.
10
A record medium storing a program for a key exchanging apparatus which receives a public key, a secret key, an identifier, a counterpart public key set, a counterpart identifier set, a session number, and a random number inputted thereto, performs communication with a plurality of counterpart apparatuses identified by identifiers belonging to the counterpart identifier set, and generates and outputs a public key, said program comprising:the order of generating a contribution random number by using the random number;the order of generating contribution data from the contribution random number;the order of transmitting the contribution data to the plurality of counterpart apparatuses;the order of generating a signer contribution confirmation signature with respect to a contribution data set including every contribution data received by from the plurality of counterpart apparatuses by using the secret key and the public key;the order of generating auxiliary data and an auxiliary data validity certification sentence by the contribution data set and the contribution random number, the order of transmitting the auxiliary data, the auxiliary data validity certification sentence, and the contribution confirmation signature to the plurality of counterpart apparatuses;the order of verifying validity of the auxiliary data by using the counterpart identifier set and the counterpart public key set, and the contribution confirmation signature set the auxiliary data set and the auxiliary data validity certification sentence including data received from the plurality of counterpart apparatus;and the order of generating the public key from the contribution data set and the auxiliary data received from the plurality of counterpart apparatuses.

Independent claims3

82 paragraphs in 6 sections, as filed

FIELD OF THE INVENTION

0001The present invention relates to a key exchanging apparatus and a key exchanging method capable of exchanging the same key through communications.

DESCRIPTION OF THE PRIOR ART

0002A group key exchanging apparatus is disclosed in “Jonathan Katz, Ji Sun Shin: Modeling insider attacks on group key-exchange protocols. ACM Conference on Computer and Communications Security 2005:180-189”.

0003A method disclosed in the above document will now be described.

0004First, it shows a notation. p is a prime number, GT is a cyclic group of order q. The number of apparatuses for exchanging a key is n, and a number i is attached to each apparatus. An identifier indicating an apparatus i is U[i]. G is a constructor of GT. v and w are randomly selected integers. F and F′ are pseudo-random number generating apparatuses.

0005<figref idref="DRAWINGS">FIG. 1</figref> shows a key exchanging apparatus.

0006As shown in <figref idref="DRAWINGS">FIG. 1</figref>, a group exchanging apparatus according to the present exemplary embodiment includes verification data verifying unit 311, verification data generating unit 312, temporary key generating unit 313, auxiliary data generating unit 314, contribution random number generating unit 315, contribution data generating unit 316, and communication unit 317.

0007Thus configured key exchanging apparatus 300(i) receives counterpart identifier set 301, i.e., a set of identifiers corresponding to each apparatus j of j={1, . . . , n}¥i, and counterpart public key set 302, i.e., a set of public keys pk[j]. Also, secret key 305 (sk[i]) corresponding to public key 304 (pk[i]) and identifier 303 (U[i]) is inputted to the key exchanging apparatus. In addition, key-specific session number 306 (sid) generated from it is also inputted to the key exchanging apparatus.

0008In key exchanging apparatus 300(i), contribution random number generating unit 315 randomly generates a contribution random number 324 (r[i]εZ/qZ) by using input random number 307.

0009Contribution data generating unit 316 generates contribution data 325 (y[i]=gr[i]) by using 324 (r[i]εZ/qZ), and also generates signature sign(i, 1) with respect to sid, 1, U[i], y[i]. Contribution data generating unit 316 transmits (sid, 1, U[i], y[i], sig(i, 1)) to the (n−1) number of apparatuses from communication unit 317.

0010In key exchanging apparatus 300(i), regarding j={1, . . . , n}¥i, communication unit 317 waits for the apparatus j to receive the contribution data y[j] via communication line 309.

0011When contribution data set 323 including all contribution data y[j] is formed, key exchanging apparatus 300(i) verifies each signature.

0012Auxiliary data generating unit 314 generates auxiliary data 322 (x[i]=(y[i+1]/y[i−1])r[i]) by using contribution data set 323, and generates signature sig(i,2) with respect to (sid, 2, U[i], x[i]).

0013Communication unit 317 transmits (sid, 2, U[i], x[i], sig(i, 2)) to the other (n−1) number of apparatuses.

0014When every x[j] is received via communication unit 317, forming data set 321 including every x[j], key exchanging apparatus 300(i) verifies each signature.

0015Next, temporary key generating unit 313 generates k[i]=(y[i−1]r[i])nx[i+1]nx[i+2]n−1 . . . x[n]i+1x[1]1 . . . x[i−1]2x[i].

0016Thereafter, verification data generating unit 312 generates ack[i]=F(k[i], v), and temporary key generating unit 313 generates public key 308 (sk[i]=F′(k[i], w)). Also, it generates a signature sign(i, 3) with respect to (sid[i], 3, U[i], ack[i]).

0017Communication unit 317 transmits (sid, 3, U[i], ack[i], sig(i, 3)) to the other (n−1) number of apparatuses.

0018Every ack[j] is received via communication unit 317, and when the ack[j] are all set, verification data verifying unit 311 of key exchanging apparatus 300(i) verifies each signature.

0019When verification data verifying unit 311 verifies ack[j]=ack[i] with respect to every j={1, . . . , n}¥i, temporary key generating unit 313 outputs public key 308 (sk[i]).

0020In the above-described technique, when the public key is exchanged, each apparatus needs to distribute data to all of other apparatuses three times. Until every apparatus completes their distribution of data to other apparatuses, each apparatus cannot perform the next step, so the amount of time required for data distribution is significantly lengthened compared to the amount of time required for calculating each data item. Here, much time is taken to process of matching synchronization in communications, making it difficult to terminate communication within a short time compared with a simple code calculation. Thus, in order to quickly perform key exchanging among the plurality of apparatuses, the number of data distributions needs to be reduced.

SUMMARY OF THE INVENTION

0021An object of the present invention is to provide a key exchanging apparatus capable of quickly exchanging a key among a plurality of apparatuses.

0022To achieve the above object, there is provided a key exchanging apparatus which receives a public key, a secret key, an identifier, a counterpart public key set, a counterpart identifier set, a session number, and a random number inputted thereto, performs communication with a plurality of counterpart apparatuses identified by identifiers belonging to the counterpart identifier set, and generates and outputs a public key, including a contribution random number generating unit that generates a contribution random number by using the random number; a contribution data generating unit that generates contribution data from the contribution random number generated by the contribution random number generating unit; a communication unit that transmits the contribution data to the plurality of counterpart apparatuses, a signing unit that generates a signer contribution confirmation signature with respect to a contribution data set including all contribution data received by the communication unit from the plurality of counterpart apparatuses by using the secret key and the public key; a verifiable auxiliary data generating unit that generates auxiliary data and an auxiliary data validity certification sentence by the contribution data set and the contribution random number, the auxiliary data, the auxiliary data validity the certification sentence and the contribution confirmation signature being transmitted to the plurality of counterpart apparatuses by the communication unit; a validity verifying unit that verifies validity of the auxiliary data by using the counterpart identifier set and the counterpart public key set, and the contribution confirmation signature set, the auxiliary data set and the auxiliary data validity certification sentence including data received by the communication unit from the plurality of counterpart apparatuses; and a key generating unit that generates the public key from the contribution data set and the auxiliary data that are received by the communication unit from the plurality of counterpart apparatuses.

0023According to the invention, with such a configuration as described above, when a secret key is shared among a plurality of apparatuses, the number of data distribution items by the apparatuses is merely two times, smaller by one time than the related art, so a key can be more quickly exchanged.

BRIEF DESCRIPTION OF THE DRAWINGS

0024<figref idref="DRAWINGS">FIG. 1</figref> illustrates an example of a key exchanging apparatus;

0025<figref idref="DRAWINGS">FIG. 2</figref> illustrates a key exchanging apparatus according to a first exemplary embodiment of the present invention; and

0026<figref idref="DRAWINGS">FIG. 3</figref> illustrates a key exchanging apparatus according to a second exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

0027Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings.

0028Notation Used in Exemplary Embodiments

0029p is prime number, G and GT are a circular group of an order p, and e is a bilinear mapping non-degenerative from G×G to GT. Here, the bilinearity refers to the face that e(gα,gβ)=e(g,g)αβ is established for every α, βεZ/qZ and gεG. In addition, non-degeneration refers to the fact that when g is a generator of G, e(g,g) becomes a generator of GT.

0030The number of key exchanging apparatuses is n, and number i is attached to each apparatus. An identifier indicating the apparatus i is U[i]. g and h are generators of GT.

First Exemplary Embodiment

0031<figref idref="DRAWINGS">FIG. 2</figref> shows a key exchanging apparatus according to a first exemplary embodiment of the present invention.

0032As shown in <figref idref="DRAWINGS">FIG. 2</figref>, the key exchanging apparatus according to the first exemplary embodiment of the present invention includes input unit 110, calculation unit 140, output unit 120, and communication unit 130. The calculation unit 140 includes validity verifying unit 141, key generating unit 142, verifiable auxiliary data generating unit 143, signing unit 144, contribute random number generating unit 145, and contribution data generating unit 146.

0033Input unit 110 receives counterpart identifier set 101, counterpart public key set 102, identifier 103, pubic key 104, secret key 105, session number 106, and random number 107.

0034Calculation unit 140 is means for calculating two groups G and GT the orders of which are identical to each other and in which there is bilinear mapping from two elements belonging to the group G to the group GT. Calculation unit 140 generates public key 108 by using counterpart identifier set 101, counterpart public key set 102, identifier 103, public key 104, secret key 105, session number 106, and random number 107 inputted via input unit 110, and data received by communication unit 130.

0035Output unit 120 outputs public key 108 generated by calculation unit 140.

0036Contribution random number generating unit 145 generates contribute random number 156, a random number for generating contribution data 157, by using random number 107 inputted via input unit 110.

0037Contribution data generating unit 146 generates contribution data 157 from contribution random number 156 generated by contribution random number generating unit 145.

0038Signing unit 144 generates contribution confirmation signature 153 used as a signature for contribution data set 155 including all the contribution data received from all counterpart apparatus, by using secret key 105 and public key 104 inputted via input unit 110.

0039Verifiable auxiliary data generating unit 143 generates auxiliary data 154 from contribution data set 155 and contribution random number 156.

0040Validity verifying unit 141 verifies validity of auxiliary data by using counterpart identifier set 101 and counterpart public key set 102 inputted via the input unit 110, contribution confirmation signature set 151 and auxiliary data set 152 including data received from each counterpart apparatus via communication unit 130.

0041Key generating unit 142 generates public key 108 from contribution data set 155 and auxiliary data set 152 received from each counterpart apparatus via communication unit 130.

0042Communication unit 130, configured to exchange data with a counterpart apparatus via communication line 109, transmits contribution data 157 generated by contribution data generating unit 146, auxiliary data 154 generated by verifiable auxiliary data generating unit 143, and contribution confirmation signature 153 generated by signing unit 144 to each counterpart apparatus via communication line 109.

0043The operation of key exchanging apparatus 100 configured as described above will now be described.

0044Counterpart identifier set 101, a set of identifiers U[j] corresponding to each apparatus j of j={1, . . . , n}¥i, and a counterpart public key set, a set of public key pk[j] corresponding to each apparatus j of j={1, . . . , n}¥i, are inputted to each key exchanging apparatus 100(i) via input unit 110. In addition, identifier 103 corresponding to its own apparatus, its public key 104 (pk[i]), and secret key 105 (sk[i]) corresponding to public key 104 (pk[i]) are also inputted to each key exchanging apparatus 100(i) via input unit 110. Also, public key 108-specific session number 106 (sid) generated therefrom and random number 107 are inputted to each key exchanging apparatus 100(i) via input unit 110.

0045In key exchanging apparatus 100(i), first, contribution random number generating unit 145 randomly generates 156 (r[i] εZ/qZ), a contribution random number for generating contribution data 157, by using random number 107 inputted via input unit 110.

0046Next, contribution data generating unit 146 generates contribution data 157 (y[i]=gr[i]) from contribution random number 156 generated by contribution random number generating unit 145, and transmits contribution data 157 (y[i]=gr[i]) to the other (n−1) number of apparatuses via communication unit 130.

0047Regarding j={1, . . . , n}¥i, key exchanging apparatus 100(i) waits for receiving contribution data y[j] from apparatus j by communication unit 130.

0048When contribution data y[j] is received by communication unit 130 from each apparatus, forming contribution data set 155 including all the contribution data y[j], verifiable auxiliary data generating unit 143 generates auxiliary data 154 (x[i]=(y[i+1]/y[i−1])r[i]) via contribution data set 155 and contribution random number 145, and signing unit 144 generates signer contribution confirmation signature 153 (sig) with respect to contribution data set 155 (sid, y[1], . . . , y[n]) including all the contribution data received from each counterpart apparatus by using secret key 105 and public key 104 inputted via input unit 110.

0049Communication unit 130 transmits (sid, x[i], sig) to the other (n−1) number of apparatuses.

0050When auxiliary data x[j] is received by communication unit 130 from each apparatus, forming auxiliary data set 152 including all auxiliary data x[j], validity verifying unit 141 verifies each signature of contribution confirmation signature set 151 by using counterpart identifier set 101 and counterpart public key set 102 inputted via input unit 110, contribution confirmation signature set 151 and auxiliary data set 152 including data received, by communication unit 130, which has been transferred from a different apparatus.

0051Next, key generating unit 142 generates k[i]=(y[i−1]r[i])nx[i+1]nx[i+2]n−1 . . . x[n]i+1x[1]i . . . x[i−1]2x[i] from candidate data set 155 and auxiliary set 152 received by communication unit 130 from each counterpart apparatus.

0052Validity verifying unit 141 checks whether or not e(k[i], g)=e(y[n], y[1]Πjn−1e(y[j], y[j+1]) has been established. If e(k[i], g)=e(y[n], y[1]Πjn−1e(y[j], y[j+1]) has been established, public key 108 (sk[i]=e(g, h)) is outputted from key generating unit 142 via output unit 120.

Second Exemplary Embodiment

0053This exemplary embodiment is different from the first exemplary embodiment in that there is no bilinear mapping.

0054<figref idref="DRAWINGS">FIG. 3</figref> illustrates a key exchanging apparatus according to a second exemplary embodiment of the present invention.

0055As shown in <figref idref="DRAWINGS">FIG. 3</figref>, the key exchanging apparatus according to the second exemplary embodiment includes input unit 210, calculation unit 240, output unit 220, and communication unit 230. Calculation unit 240 includes validity verifying unit 241, key generating unit 242, verifiable auxiliary data generating unit 243, signing unit 244, contribution random number generating unit 245, and contribution data generating unit 246.

0056Input unit 210 receives counterpart identifier set 201, counterpart public key set 202, identifier 203, pubic key 204, secret key 205, session number 206, and random number 207.

0057Calculation unit 240 generates public key 208 by using counterpart identifier set 201, counterpart public key set 202, identifier 203, public key 204, secret key 205, session number 206, and random number 207 inputted via input unit 210, and data received by communication unit 230.

0058Output unit 220 outputs public key 208 generated by calculation unit 240.

0059Contribution random number generating unit 245 generates contribute random number 256, a random number for generating contribution data 257, by using random number 207 inputted via input unit 210.

0060Contribution data generating unit 246 generates contribution data 257 from contribution random number 256 generated by contribution random number generating unit 245.

0061Signing unit 244 generates contribution confirmation signature 253 used as a signature for contribution data set 255 including all the contribution data received from each counterpart apparatus, by using secret key 205 and public key 204 inputted via input unit 210.

0062Verifiable auxiliary data generating unit 243 generates auxiliary data 254 from contribution data set 255 and contribution random number 256.

0063Validity verifying unit 241 verifies validity of auxiliary data by using counterpart identifier set 201 and counterpart public key set 202 inputted via input unit 210, contribution confirmation signature set 251 including data received from each counterpart apparatus via communication unit 230, auxiliary data set 252 and auxiliary data validity certification sentence set 258.

0064Key generating unit 242 generates public key 208 from contribution data set 255 and auxiliary data set 252 received from every counterpart apparatus via communication unit 230.

0065Communication unit 230, configured to exchange data with a counterpart apparatus via communication line 209, transmits contribution data 257 generated by contribution data generating unit 246, auxiliary data 254 and auxiliary data validity certification sentence 259 generated by verifiable auxiliary data generating unit 243, and contribution confirmation signature 253 generated by signing unit 244, to each counterpart apparatus via communication line 209.

0066The operation of key exchanging apparatus 200 configured as described above will now be explained.

0067Counterpart identifier set 201, a set of identifiers U[j] corresponding to each apparatus j of j={1, . . . , n}¥i, and a counterpart public key set, a set of public key pk[j] corresponding to each apparatus j of j={1, . . . , n}¥i, are inputted to each key exchanging apparatus 200(i) via input unit 210. In addition, identifier 203 corresponding to its own apparatus, its public key 204 (pk[i]), and secret key 205 (sk[i]) corresponding to public key 204 (pk[i]) are also inputted to each key exchanging apparatus 200(i) via input unit 210. Also, public key 208-specific session number 206 (sid) generated therefrom and random number 207 are inputted to each key exchanging apparatus 200(i) via input unit 210.

0068In key exchanging apparatus 200(i), first, contribution random number generating unit 245 randomly generates 256 (r[i]εZ/qZ), a contribution random number for generating contribution data 257, by using random number 207 inputted via input unit 210.

0069Next, contribution data generating unit 246 generates contribution data 257 (y[i]=gr[i]) from contribution random number 256 generated by contribution random number generating unit 245, and transmits contribution data 257 (y[i]=gr[i]) to the other (n−1) number of apparatuses via communication unit 230.

0070Regarding j={1, . . . , n}¥i, key exchanging apparatus 200(i) waits for receiving contribution data y[j] from apparatus j by communication unit 230.

0071When contribution data y[j] is received by communication unit 230 from every apparatus, forming contribution data set 255 including all the contribution data y[j], verifiable auxiliary data generating unit 243 generates auxiliary data 254 (x[i]=(y[i+1]/y[i−1])r[i]) from contribution data set 255 and contribution random number 245, and signing unit 244 generates signer contribution confirmation signature 253(sig) with respect to contribution data set 255 (sid, y[1], . . . , y[n]) including every contribution data received from every counterpart apparatus by using secret key 205 and public key 204 input via input unit 210. Verifiable auxiliary data generating unit 243 verifies that x[i] has been properly created by using y[i+1], y[i−1], r[i] with a non-interactive zero knowledge by indicating only y[i+1], y[i−1], r[i], g. This certification sentence is assumed as an auxiliary data validity certification sentence 259 (proof[i]).

0072Communication unit 230 transmits (sid, proof[i], sig) to the other (n−1) number of apparatuses.

0073When auxiliary data x[j] is received by communication unit 230 from each apparatus, forming auxiliary data set 252 including all auxiliary data x[j], validity verifying unit 241 verifies each signature of contribution confirmation signature set 251 and each auxiliary data validity certification sentence (proof[j]) of auxiliary data validity certification sentence set 258 by using counterpart identifier set 201 and counterpart public key set 202 inputted via input unit 210, contribution confirmation signature set 251 including data received, by communication unit 230, which has been transferred from a different apparatus, and auxiliary data set 252.

0074Next, key generating unit 242 generates k[i]=(y[i−1]r[i])nx[i+1]nx[i+2]n−1 . . . x[n]i+1x[1]i . . . x[i−1]2x[i] from candidate data set 255 and auxiliary set 252 received by communication.

0075Public key 208 (sk[i]=e(g, h)) is outputted from key generating unit 242 via output unit 220.

0076In the two exemplary embodiments as described above, the sentences of subjects, for which each apparatus generates a signature, are all the same. In this case, the amount of calculation required for verification can be reduced by using an aggregate signature.

0077Meanwhile, in the present invention, processing within the key exchanging apparatus is realized by the above-described dedicated hardware. Besides, a program for realizing the function may be recorded in a recording medium that can be recorded by the key exchanging apparatus, can be read by the key exchanging apparatus so as to be executed. The key exchanging apparatus-readable recording medium may be an HDD installed within the key exchanging apparatus in addition to a movable recording medium such as floppy disks, optical magnetic disks, DVDs, or CDs. The program recorded in the recording medium may be read and controlled by, for example, a control block to perform the processing as described above.

INDUSTRIAL AVAILABILITY

0078Key exchanging among a plurality of apparatuses can be effective for a case where many users hold a conference through a network. Participating members can be checked, and a secret key shared by the conference members can be previously determined by using the key exchanging apparatus according to the present invention in order to prevent someone else, not members, from participating in the conference or wiretapping content of the conference.

0079While the invention has been shown and described with reference to the exemplary embodiments and examples, it will be understood by those skilled in the art that the invention is not limited thereto and that various changes may be made thereto without departing from the spirit and scope of the invention as defined by the following claims.

0080This application claims the priority of Japanese Patent Application No. 2007-138940 filed on May 25, 2007, the disclosures of which are incorporated herein by reference.

Contents6

Every citation, both ways

Citations
Document	Relation	Office	Cited during
US2010169656A1	Cited by	United States of America	Pre-grant
US8200977B2	Cited by	United States of America	Search report
US12273466B2	Cited by	United States of America	Search report
US11411744B2	Cited by	United States of America	Search report
US2005246533A1	Cites	United States of America	Pre-grant
US2007162750A1	Cites	United States of America	Pre-grant
US7650494B2	Cites	United States of America	Pre-grant

6 members in 4 offices

This recordMember, by publication datePriority claim

Priority claims9

Priority claims
Document	Office	Kind	Date
2007138940	Japan	–	2007-05-25
2007138940	Japan	A	2007-05-25
2007138940	Japan	A	2007-05-25
2008057507	Japan	W	2008-04-17
2008057507	Japan	W	2008-04-17
2007138940	–	–	–
JP20070138940	–	–	–
PCTJP2008057507	–	–	–
WO2008JP57507	–	–	–

Members6

Family members, oldest first
Document	Office	Kind
WO2008146547A1	World Intellectual Property Organization (WIPO)	A1	2008-12-04
EP2154667A1	European Patent Office (EPO)	A1	2010-02-17
US2010180119A1	United States of America	A1	2010-07-15
JPWO2008146547A1	Japan	A1	2010-08-19
US8638928B2	United States of America	B2	2014-01-28
EP2154667A4	European Patent Office (EPO)	A4	2015-11-11

53 transactions on the USPTO file

Allowed after 1 non-final rejection.

Non-final rejections: 1
Final rejections: 0
RCEs: 0
Appeals: 0

Over time

Point at a mark for the transaction

Transactions

Prosecution transactions, newest first
	Event	Code
2022-03-07	Expire PatentEXP.	EXP.
2021-09-20	Maintenance Fee Reminder MailedREM.	REM.
2014-10-09	Mail Post CardPST_CRD	PST_CRD
2014-10-01	Email NotificationEML_NTF	EML_NTF
2014-09-29	Mail-Record a Petition Decision of Granted for Patent Term Adjustment after AllowanceMP025	MP025
2014-09-29	Record a Petition Decision of Granted for Patent Term Adjustment after AllowanceP025	P025
2014-09-29	Mail O.P. Petition DecisionMOPPT	MOPPT
2014-09-29	O.P. Petition DecisionOPPT	OPPT
2014-07-26	Petition EnteredPET2	PET2
2014-01-28	Recordation of Patent Grant MailedPGM/	PGM/
2014-01-28	Patent Issue Date Used in PTA CalculationAllowedPTAC	PTAC
2014-01-09	Email NotificationEML_NTR	EML_NTR
2014-01-08	Issue Notification MailedAllowedWPIR	WPIR
2013-12-27	Email NotificationEML_NTR	EML_NTR
2013-12-27	Printer Rush- No mailingTCPB	TCPB
2013-12-27	Mail Response to 312 Amendment (PTO-271)MN271	MN271
2013-12-26	Dispatch to FDCD1935	D1935
2013-12-19	Application Is Considered Ready for IssuePILS	PILS
2013-12-19	Response to Amendment under Rule 312N271	N271
2013-12-16	Pubs Case Remand to TCPUBTC	PUBTC
2013-12-13	Issue Fee Payment VerifiedN084	N084
2013-12-13	Issue Fee Payment ReceivedIFEE	IFEE
2013-11-22	Amendment after Notice of Allowance (Rule 312)AllowedA.NA	A.NA
2013-09-18	Electronic ReviewELC_RVW	ELC_RVW
2013-09-18	Email NotificationEML_NTF	EML_NTF
2013-09-18	Mail Notice of AllowanceAllowedMN/=.	MN/=.
2013-09-13	Notice of Allowance Data Verification CompletedAllowedN/=.	N/=.
2013-09-13	Reasons for AllowanceEX.R	EX.R
2013-02-14	Date Forwarded to ExaminerFWDX	FWDX
2013-02-08	Response after Non-Final ActionA...	A...
2012-11-08	Electronic ReviewELC_RVW	ELC_RVW
2012-11-08	Email NotificationEML_NTF	EML_NTF
2012-11-08	Mail Non-Final RejectionNon-final rejectionMCTNF	MCTNF
2012-11-02	Non-Final RejectionNon-final rejectionCTNF	CTNF
2012-04-06	Case Docketed to Examiner in GAUDOCK	DOCK
2011-11-18	Case Docketed to Examiner in GAUDOCK	DOCK
2011-04-15	Case Docketed to Examiner in GAUDOCK	DOCK
2010-07-16	Email NotificationEML_NTR	EML_NTR
2010-07-15	PG-Pub Issue NotificationPG-ISSUE	PG-ISSUE
2010-04-29	Application Dispatched from OIPEOIPE	OIPE
2010-04-06	Email NotificationEML_NTR	EML_NTR
2010-04-06	Email NotificationEML_NTR	EML_NTR
2010-04-06	Filing ReceiptFLRCPT.O	FLRCPT.O
2010-04-06	Notice of DO/EO Acceptance MailedM903	M903
2010-04-05	Sent to Classification ContractorPGPC	PGPC
2009-11-25	Information Disclosure Statement consideredIDSC	IDSC
2009-11-25	Request for Foreign Priority (Priority Papers May Be Included)RQPR	RQPR
2009-11-25	Preliminary AmendmentA.PE	A.PE
2009-11-25	Electronic Information Disclosure StatementEIDS.	EIDS.
2009-11-25	371 Completion Date371COMP	371COMP
2009-11-25	Information Disclosure Statement (IDS) FiledWIDS	WIDS
2009-11-25	Cleared by OIPE CSRL194	L194
2009-11-25	Initial Exam Team nnIEXX	IEXX

4 legal events, as the office reported them to INPADOC

Over the term

Point at a mark for the event

Events

Legal events, newest first
	Event	Code
2021-09-20	Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP	FEPP
2017-07-13	Fee paymentFPAY	FPAY
2014-01-08	Information on status: patent grantGrantedPATENTED CASESTCF	STCF
2009-11-30	AssignmentAS	AS