Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
DETAILED ACTION
This Office Action is in response to the Amendment filed on 05/06/2026.
In the instant Amendment, claims 8, 13, 18 and 20 have been amended and claim 1-7 and 9 have been cancelled. Claims 1, 18 and 20 are independent claims. Claims 8, 10-18 and 20 have been examined and are pending. This Action is made FINAL.
Response to Arguments
The rejection of claim 18 under 35 U.S.C. 112(d) or pre-AIA 35 U.S.C. 112, 4th paragraph, are withdrawn as the claims have been amended.
Applicants’ arguments with respect to claims 8-18 and 20 have been considered but are moot in view of the new ground(s) of rejection.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(a):
(a) IN GENERAL.—The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor or joint inventor of carrying out the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), first paragraph: The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same and shall set forth the best mode contemplated by the inventor of carrying out his invention.
Claims 8-18 and 20 are rejected under 35 U.S.C. 112(a) or 35 U.S.C. 112 (pre-AIA ), first paragraph, as failing to comply with the written description requirement. The claim(s) contains subject matter which was not described in the specification in such a way as to reasonably convey to one skilled in the relevant art that the inventor or a joint inventor, or for pre-AIA the inventor(s), at the time the application was filed, had possession of the claimed invention. Examiner searched the whole document and could not identify support for the terms: “the communication destination identification information includes identification information of the another terminal apparatus and identification information of another management apparatus accommodating the another terminal apparatus.”
Claim Rejections - 35 USC § 103
In the event the determination of the status of the application as subject to AIA 35 U.S.C.
102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 8, 10-18 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Maeda (US 2009/0316910), in view of Zheng (US 2016/0315765) and further in view of Kobayashi (US 2007/0091838).
Regarding claim 8, Maeda discloses a management apparatus comprising:
at least one memory storing instructions, and
at least one processor configured to execute the instructions stored in the at least one memory to (Maeda par. 0047; The control section 203 carries out generation of shared random numbers, encryption/decryption using a part of the shared random numbers, and the like with the center node 10. The control section 203 can be a program-controlled processor, and the above-mentioned shared random number generation function and encryption/decryption function can be implemented by reading respective programs from a memory (not shown) and executing them on the program-controlled processor);
manage a plurality of cryptographic keys distributed by using a QKD technology (Maeda par. 0043; For example, in a N:M QKD network, cryptographic key management for each remote node can be easily performed only by monitoring the amounts of quantum keys stored at a center node 10. See also par. 0082 and 0122); and
distribute a cryptographic key to a terminal apparatus, the terminal apparatus being configured to perform cryptographic communication with another terminal apparatus, the cryptographic key being specified from among the plurality of managed cryptographic keys based on a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated (Maeda abstract, par. 0102-0103 and claim 15; A cryptographic key management method and device are provided by which cryptographic keys of multiple nodes can be managed easily and stably. A system includes at least one first node and a plurality of second nodes connected to the first node, and the first node individually generates and consumes a cryptographic key with each of the second nodes connected to the first node itself. Upon receipt of this request for a remote key, the key management server 30 checks stored key amounts (remaining amounts) with respect to all the remote nodes present along a path between the remote nodes RN-A1 and RN-C (Step S302). In the present exemplary embodiment, checked are the stored key amounts (remaining amounts) of random number sequences K1a, K2a, and Kc of the remote nodes RN-A1, RN-A2, and RN-C. If at least one of the remaining amounts of the random number sequences K1a, K2a, and Kc is not larger than a required amount of a remote key (Step 302: NO), the key management server 30 instructs the center node 10a/10c to start a key generation process for the remote node corresponding to the insufficient stored key amount (Step S303). At this instruction, the control section 105 of the center node 10a/10c carries out the key generation process for the remote node in question. Wherein the first node notifies the one of the different second nodes of information identifying the to-be-shared cryptographic key, and transmits the other of the different second nodes the to-be-shared cryptographic key encrypted using a cryptographic key generated with the other of the different second nodes. See also par. 0035, 0039-0040 and 0122).
Maeda teaches, upon receipt of this request for a remote key, the key management server checks stored key amounts (remaining amounts) with respect to all the remote nodes and the first node notifies the one of the different second nodes of information identifying the to-be-shared cryptographic key, and transmits the other of the different second nodes the to-be-shared cryptographic key encrypted using a cryptographic key generated with the other of the different second nodes (Maeda par. 0102-0103). However, Maeda does not explicitly disclose a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated.
However, in an analogous art, Zheng teaches a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated (Zheng par. 0060 and 0085; A cryptographic key that begins at step 70 where a cryptographic client issues a request to access a cryptographic key of the cryptographic keys stored in the key store section 50. The request should be in a specific format that includes, in this example, a read/write indication, an address of the at least a portion of the cryptographic key, a source or destination of the cryptographic result. The method continues at step 165 where the arbitration module 54 accesses the rule set section 162 based on the interpreted request to retrieve a rule of the set of rules. Note that a rule of the set of rules includes an algorithm section that identifies one or more valid algorithms, a destination section that identifies a valid destination, and a content section that identifies a valid privileged data type. See also par. 0073).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Zheng with the method and system of Maeda, wherein a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated to provide users with a means for securing data and, more particularly, techniques for storing and providing access to cryptographic keys and other secret values used to secure data (Zheng par. 0004).
Maeda and Zheng teaches, upon receipt of this request for a remote key, the key management server checks stored key amounts (remaining amounts) with respect to all the remote nodes and the first node notifies the one of the different second nodes of information identifying the to-be-shared cryptographic key (Maeda par. 0102-0103) and communication source identification information and communication destination identification information are designated (Zheng par. 0060 and 0085). However, Maeda and Zhen do not explicitly disclose wherein the communication source identification information includes identification information of the terminal apparatus and identification information of the management apparatus, and the communication destination identification information includes identification information of the another terminal apparatus and identification information of another management apparatus accommodating the another terminal apparatus.
However, in an analogous art, Kobayashi teaches wherein the communication source identification information includes identification information of the terminal apparatus and identification information of the management apparatus, and the communication destination identification information includes identification information of the another terminal apparatus and identification information of another management apparatus accommodating the another terminal apparatus (Kobayashi par.0015; A topology management device according to the present invention is a topology management device in a situation in which a communication network is comprised of a set of mobile terminal devices, the topology management device, and a location management device, the topology management device comprising: topology registration receiving means for receiving representative terminal identification information to identify a location on the communication network of a representative mobile terminal device as a representative of the set, and other representative terminal identification information to identify a location on the communication network of another representative mobile terminal device as a representative of another set adjacent to the set on the communication network, from the representative mobile terminal device; topology information storing means for storing the representative terminal identification information and the other representative terminal identification information received by the topology registration receiving means; location information receiving means for receiving source representative terminal identification information to identify a location on the communication network of a source representative mobile terminal device as a representative of a set to which a source mobile terminal device as a source of transmitted data belongs, and destination terminal identification information to identify a location on the communication network of a destination mobile terminal device as a destination of the transmitted data, from the source representative mobile terminal device and for receiving destination representative terminal identification information to identify a location on the communication network of a destination representative mobile terminal device as a representative of a set to which the destination mobile terminal device belongs, from the location management device; and topology calculating means for calculating topology information to indicate a route on the communication network from the source representative mobile terminal device to the destination representative mobile terminal device, based on the source representative terminal identification information and the destination representative terminal identification information received by the location information receiving means, with reference to the representative terminal identification information and the other representative terminal identification information stored in the topology information storing means, and for transmitting the calculated topology information to the source representative mobile terminal device. See also par. 0023).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Kobayashi with the method and system of Maeda and Zheng, wherein the communication source identification information includes identification information of the terminal apparatus and identification information of the management apparatus, and the communication destination identification information includes identification information of the another terminal apparatus and identification information of another management apparatus accommodating the another terminal apparatus to provide users with a means for transmitting the calculated topology information to the source representative mobile terminal device (Kobayashi par. 0015).
Regarding claim 10, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 8,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to manage the cryptographic key management information in which the cryptographic key is associated with the communication source identification information and the communication destination identification information (Maeda abstract, par. 0102-0103 and claim 15; A cryptographic key management method and device are provided by which cryptographic keys of multiple nodes can be managed easily and stably. A system includes at least one first node and a plurality of second nodes connected to the first node, and the first node individually generates and consumes a cryptographic key with each of the second nodes connected to the first node itself. Upon receipt of this request for a remote key, the key management server 30 checks stored key amounts (remaining amounts) with respect to all the remote nodes present along a path between the remote nodes RN-A1 and RN-C (Step S302). In the present exemplary embodiment, checked are the stored key amounts (remaining amounts) of random number sequences K1a, K2a, and Kc of the remote nodes RN-A1, RN-A2, and RN-C. If at least one of the remaining amounts of the random number sequences K1a, K2a, and Kc is not larger than a required amount of a remote key (Step 302: NO), the key management server 30 instructs the center node 10a/10c to start a key generation process for the remote node corresponding to the insufficient stored key amount (Step S303). At this instruction, the control section 105 of the center node 10a/10c carries out the key generation process for the remote node in question. Wherein the first node notifies the one of the different second nodes of information identifying the to-be-shared cryptographic key, and transmits the other of the different second nodes the to-be-shared cryptographic key encrypted using a cryptographic key generated with the other of the different second nodes. See also par. 0035, 0039-0040 and 0122).
Regarding claim 11, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 10,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to, when there is, in the cryptographic key management information, no cryptographic key corresponding to the communication source identification information and the communication destination identification information designated in the request, specify (Maeda par. 0043; For example, in a N:M QKD network, cryptographic key management for each remote node can be easily performed only by monitoring the amounts of quantum keys stored at a center node 10. See also par. 0082 and 0122).
Zheng further discloses a cryptographic key to be distributed to the terminal apparatus by associating the communication source identification information and the communication destination identification information with a cryptographic key selected from the plurality of cryptographic keys (Zheng par. 0085; The method continues at step 165 where the arbitration module 54 accesses the rule set section 162 based on the interpreted request to retrieve a rule of the set of rules. Note that a rule of the set of rules includes an algorithm section that identifies one or more valid algorithms, a destination section that identifies a valid destination, and a content section that identifies a valid privileged data type. See also par. 0073).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Zheng with the method and system of Maeda and Kobayashi, wherein a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated to provide users with a means for securing data and, more particularly, techniques for storing and providing access to cryptographic keys and other secret values used to secure data (Zheng par. 0004).
Regarding claim 12, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 10,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to, when there is, in the cryptographic key management information, a cryptographic key corresponding to the communication source identification information and the communication destination identification information designated in the request, specify the corresponding cryptographic key as a cryptographic key to be distributed to the terminal apparatus (Maeda par. 0043; For example, in a N:M QKD network, cryptographic key management for each remote node can be easily performed only by monitoring the amounts of quantum keys stored at a center node 10. See also par. 0082 and 0122).
Zheng further discloses a cryptographic key to be distributed to the terminal apparatus by associating the communication source identification information and the communication destination identification information with a cryptographic key selected from the plurality of cryptographic keys (Zheng par. 0085; The method continues at step 165 where the arbitration module 54 accesses the rule set section 162 based on the interpreted request to retrieve a rule of the set of rules. Note that a rule of the set of rules includes an algorithm section that identifies one or more valid algorithms, a destination section that identifies a valid destination, and a content section that identifies a valid privileged data type. See also par. 0073).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Zheng with the method and system of Maeda and Kobayashi, wherein a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated to provide users with a means for securing data and, more particularly, techniques for storing and providing access to cryptographic keys and other secret values used to secure data (Zheng par. 0004).
Regarding claim 13, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 10,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to share the cryptographic key management information with the another management apparatus accommodating another terminal apparatus (Maeda abstract; A cryptographic key management method and device are provided by which cryptographic keys of multiple nodes can be managed easily and stably. A system includes at least one first node and a plurality of second nodes connected to the first node, and the first node individually generates and consumes a cryptographic key with each of the second nodes connected to the first node itself).
Regarding claim 14, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 13,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to, when the cryptographic key management information is updated, notify the other management apparatus of the updating of the cryptographic key management information (Maeda par. 0009; It is required to update a cryptographic key shared between a sending side and a receiving side. When updating a key, it is absolutely necessary that the key to be updated should not be intercepted or broken. To this end, there are two broad types of methods: (1) a method by which a key is encrypted by means of public key encryption and then transmitted, and (2) a method by which a key is encrypted by using a master key, which is a common key preset for key update, and then transmitted).
Regarding claim 15, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 14,
Maeda further discloses wherein in the cryptographic key management information, the cryptographic key is associated with cryptographic key identification information, and the at least one processor is further configured to execute the instructions stored in the at least one memory to transmit, as the notification, the cryptographic key identification information ((Maeda par. 0043; For example, in a N:M QKD network, cryptographic key management for each remote node can be easily performed only by monitoring the amounts of quantum keys stored at a center node 10. See also par. 0082 and 0122).
Zheng further discloses the communication source identification information, and the communication destination identification information (Zheng par. 0085; The method continues at step 165 where the arbitration module 54 accesses the rule set section 162 based on the interpreted request to retrieve a rule of the set of rules. Note that a rule of the set of rules includes an algorithm section that identifies one or more valid algorithms, a destination section that identifies a valid destination, and a content section that identifies a valid privileged data type. See also par. 0073).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Zheng with the method and system of Maeda, wherein a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated to provide users with a means for securing data and, more particularly, techniques for storing and providing access to cryptographic keys and other secret values used to secure data (Zheng par. 0004).
Regarding claim 16, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 15,
Maeda further discloses wherein the at least one processor is further configured to execute the instructions stored in the at least one memory to, when the sharing means receives the notification, update the cryptographic key management information according to the cryptographic key identification information (Maeda par. 0009; It is required to update a cryptographic key shared between a sending side and a receiving side. When updating a key, it is absolutely necessary that the key to be updated should not be intercepted or broken. To this end, there are two broad types of methods: (1) a method by which a key is encrypted by means of public key encryption and then transmitted, and (2) a method by which a key is encrypted by using a master key, which is a common key preset for key update, and then transmitted).
Zheng further discloses the communication source identification information, and the communication destination identification information (Zheng par. 0085; The method continues at step 165 where the arbitration module 54 accesses the rule set section 162 based on the interpreted request to retrieve a rule of the set of rules. Note that a rule of the set of rules includes an algorithm section that identifies one or more valid algorithms, a destination section that identifies a valid destination, and a content section that identifies a valid privileged data type. See also par. 0073).
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine the teachings of Zheng with the method and system of Maeda and Kobayashi, wherein a request for the cryptographic key issued from the terminal apparatus, in which request, communication source identification information and communication destination identification information are designated to provide users with a means for securing data and, more particularly, techniques for storing and providing access to cryptographic keys and other secret values used to secure data (Zheng par. 0004).
Regarding claim 17, Maeda, Zheng and Kobayashi disclose the management apparatus according to claim 10,
Maeda further discloses wherein in the cryptographic key management information, the cryptographic key is associated with a history of distribution of a communication source and a communication destination to the terminal apparatus (Maeda par. 0037; Alternatively, with a key management table storing the stored key amounts monitored by the stored key amount monitor 31, the key management control section 32 may perform key generation control while referring to the key management table).
Regarding claim 18; claim 18 is directed to a system associated with the apparatus claimed in claim 8. Claim 18 is similar in scope to claim 8, and is therefore rejected under similar rationale respectively.
Meada further discloses acquire a cryptographic key from the management apparatus by designating communication source identification information and communication destination identification information, and requesting the cryptographic key to the management apparatus; and perform cryptographic communication with another terminal apparatus by using the acquired cryptographic key (Maeda abstract, par. 0102-0103 and claim 15; A cryptographic key management method and device are provided by which cryptographic keys of multiple nodes can be managed easily and stably. A system includes at least one first node and a plurality of second nodes connected to the first node, and the first node individually generates and consumes a cryptographic key with each of the second nodes connected to the first node itself. Upon receipt of this request for a remote key, the key management server 30 checks stored key amounts (remaining amounts) with respect to all the remote nodes present along a path between the remote nodes RN-A1 and RN-C (Step S302). In the present exemplary embodiment, checked are the stored key amounts (remaining amounts) of random number sequences K1a, K2a, and Kc of the remote nodes RN-A1, RN-A2, and RN-C. If at least one of the remaining amounts of the random number sequences K1a, K2a, and Kc is not larger than a required amount of a remote key (Step 302: NO), the key management server 30 instructs the center node 10a/10c to start a key generation process for the remote node corresponding to the insufficient stored key amount (Step S303). At this instruction, the control section 105 of the center node 10a/10c carries out the key generation process for the remote node in question. Wherein the first node notifies the one of the different second nodes of information identifying the to-be-shared cryptographic key, and transmits the other of the different second nodes the to-be-shared cryptographic key encrypted using a cryptographic key generated with the other of the different second nodes. See also par. 0035, 0039-0040 and 0122).
Regarding claim 20; claim 20 is directed to a method associated with the apparatus claimed in claim 8. Claim 20 is similar in scope to claim 8, and is therefore rejected under similar rationale respectively.
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to SANCHIT K SARKER whose telephone number is (571)270-7907. The examiner can normally be reached M-F 8:30 AM-5:30 PM.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, FARID HOMAYOUNMEHR can be reached at 571-272-3739. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/SANCHIT K SARKER/Primary Examiner, Art Unit 2495
Prosecution Insights