Secure authenticated channel
Abstract
The protocol (ie, method) for calculating the session key and the corresponding device. The two peers have a common Diffie-Hellman permanent key KpermAnd know the identity and public key of the other peer. The first peer selects the first ephemeral private key x and the first corresponding ephemeral public key g sent to the second peer.xTo calculate. The second peer is similarly the second ephemeral public key gyAnd ephemeral sharing key KephCalculate and gy, Keph, KpermAnd its identity hashed and gyAnd the hash to the first peer. The first peer is KephCalculate, validate the hash, gx, Keph, KpermAnd its identity is hashed and sent to a second peer that validates the hash. After that, both peers are KephGet the session key by hashing. These devices then use the session key to establish a secure authentication channel (SAC).
Term
Term ended
Projected expiry passed 29 October 2024, 1.9 years ago.
- Priority and filed
- Published
- Projected expiry
- Today
3 claims: 3 independent, 0 dependent
- 1第1装置と第2装置とによって共有されるセッションキーを計算する方法であって、 第1装置は、パブリックキーと該第1装置に対応するアイデンティティとから構成される証明書を有し、前記アイデンティティと、プライベートキーと、前記パブリックキーとを知っており、 第2装置は、パブリックキーと該第2装置に対応するアイデンティティとから構成される証明書を有し、前記アイデンティティと、プライベートキーと、前記パブリックキーとを知っており、当該方法は、前記第1装置において、 第1エフェメラルプライベートキーを選択するステップと、 第1エフェメラルパブリックキーを計算するステップと、 前記第1装置の証明書と前記第1エフェメラルパブリックキーとを前記第2装置に送信するステップと、前記第2装置において、 前記第1装置の証明書と前記第1エフェメラルパブリックキーとを受信するステップと、 前記第1装置の証明書を検証するステップと、 第2エフェメラルプライベートキーを選択するステップと、 第2エフェメラルパブリックキーを計算するステップと、 前記第1エフェメラルパブリックキーと前記第2エフェメラルプライベートキーとからエフェメラル共有キーを計算するステップと、 前記第1装置のパブリックキーと前記第2装置のプライベートキーとからパーマネントキーを計算するステップと、 前記第2エフェメラルパブリックキーと、前記エフェメラル共有キーと、前記パーマネントキーと、前記第2装置に対応するアイデンティティとから第1の値を計算するステップと、 前記第2装置の証明書と、前記第2エフェメラルパブリックキーと、前記第1の値とを前記第1装置に送信するステップと、前記第1装置において、 前記第2装置の証明書と、前記第2エフェメラルパブリックキーと、前記第1の値とを前記第2装置から受信するステップと、 前記第2装置の証明書を検証するステップと、 前記第2エフェメラルパブリックキーと前記第1エフェメラルプライベートキーとから前記エフェメラル共有キーを計算するステップと、 前記第1装置のパブリックキーとプライベートキーとから前記パーマネントキーを計算するステップと、 前記第1の値を検証するステップと、 前記第1エフェメラルパブリックキーと、前記エフェメラル共有キーと、前記パーマネントキーと、前記第1装置に対応するアイデンティティとから第2の値を計算するステップと、 前記第2の値を前記第2装置に送信するステップと、前記第2装置において、 前記第2の値を受信するステップと、 前記第2の値を検証するステップと、 前記エフェメラル共有キーの関数としてセッションキーを計算するステップと、 前記エフェメラル共有キーの関数として前記セッションキーを計算するステップと、を有する方法。
- 2第2装置と共に共有セッションキーの計算に参加する第1装置であって、 当該第1装置は、パブリックキーと当該第1装置に対応するアイデンティティとから構成される証明書を有し、前記アイデンティティと、プライベートキーと、前記パブリックキーとを知っており、当該第1装置は、 エフェメラルプライベートキーを選択し、 第1エフェメラルパブリックキーを計算し、 前記証明書と前記第1エフェメラルパブリックキーとを前記第2装置に送信し、 前記第2装置のパブリックキーとアイデンティティとから構成される前記第2装置の証明書と、第2エフェメラルパブリックキーと、前記第2エフェメラルパブリックキー、エフェメラル共有キー、パーマネントキー及び前記第2装置に対応するアイデンティティから計算される第1の値とを、前記第2装置から受信し、 前記第2装置の証明書を検証し、 前記第2エフェメラルパブリックキーと前記エフェメラルプライベートキーとから前記エフェメラル共有キーを計算し、 当該第1装置のパブリックキーとプライベートキーとから前記パーマネントキーを計算し、 前記第1の値を検証し、 前記第1エフェメラルパブリックキーと、前記エフェメラル共有キーと、前記パーマネントキーと、当該第1装置に対応するアイデンティティとから第2の値を計算し、 前記第2の値を前記第2装置に送信し、 前記エフェメラル共有キーの関数としてセッションキーを計算する、ためのプロセッサを有する第1装置。
- 3第1装置と共に共有セッションキーの計算に参加する第2装置であって、 当該第2装置は、パブリックキーと当該第2装置に対応するアイデンティティとから構成される証明書を有し、前記アイデンティティと、プライベートキーと、前記パブリックキーとを知っており、当該第2装置は、 前記第1装置のパブリックキーとアイデンティティとから構成される前記第1装置の証明書と、第1エフェメラルパブリックキーとを受信し、 前記第1装置の証明書を検証し、 エフェメラルプライベートキーを選択し、 第2エフェメラルパブリックキーを計算し、 前記第1エフェメラルパブリックキーと前記エフェメラルプライベートキーとからエフェメラル共有キーを計算し、 前記第1装置のパブリックキーと当該第2装置のプライベートキーとからパーマネントキーを計算し、 前記第2エフェメラルパブリックキーと、前記エフェメラル共有キーと、前記パーマネントキーと、当該第2装置に対応するアイデンティティとから第1の値を計算し、 当該第2装置の証明書と、前記第2エフェメラルパブリックキーと、前記第1の値とを前記第1装置に送信し、 前記第1エフェメラルパブリックキーと、前記エフェメラル共有キーと、前記パーマネントキーと、前記第1装置に対応するアイデンティティとから計算される第2の値を前記第1装置から受信し、 前記第2の値を検証し、 前記エフェメラル共有キーの関数として前記セッションキーを計算する、ためのプロセッサを有する第2装置。
Independent claims3
28 paragraphs, as filed
Detailed description of the invention
[Technical field of invention]
The present invention relates generally to secure authentication channels, and more particularly to the calculation of session keys for establishing such channels for the protection of digital content in digital television systems and the like.
[Background of invention]
Secure authentication channels, well known in the field of cryptography, are established to allow two mutually authenticated devices (often referred to as peers) to exchange information in secret. The secure authentication channel should preferably have the following characteristics: -Mutual authentication of peers-Key verification That is, a common secret is established, and it is possible for at least one peer to prove that the secret is actually common. -Forward secrecy That is, old session keys cannot be calculated even when the private key (such as the authentication private key) is known for a long period of time.
These properties are formally mathematically provable, and the entire protocol may be broken relatively easily if there is a way around one of the above properties for a given cryptographic protocol. ..
Over the years, the crypto community has proposed a number of protocols for secure authentication channels. Only some of these channels have been shown to satisfy the above characteristics.
All protocols that provide the channel with the required characteristics are several different cryptographic primitives, namely at least one asymmetric cryptographic primitive (such as asymmetric cryptography or digital signature), a hash function, a message authentication code (MAC), and some of the above. Use other primitives such as symmetric encryption in. The problem with these protocols is that they are very resource consuming and difficult to implement in devices with limited computing power, such as portable security modules such as smart cards. Another problem is that the use of many crypto primitives makes it difficult to prove that the protocol is secure.
The present invention provides a secure access channel protocol that has the required properties and is particularly suitable for implementation in devices with limited computing power.
Throughout this description, it is assumed that the basic concept is well known, as encryption is a mature technique. For the sake of simplicity, these concepts will not be described beyond what is necessary for an understanding of the present invention.
[Outline of Invention]
In the first feature, the present invention relates to a method of calculating a session key common to the first and second devices (11, 21). The first device is the public key (g<sup>a</sup>) And the identity (ID) that corresponds to itself<sub>a</sub>) And a certificate (C)<sub>a</sub>) And their corresponding identity (ID)<sub>a</sub>), Private key (a), public key (g)<sup>a</sup>) And know. The second device has the corresponding certificate and knowledge. The first device selects the first ephemeral private key (x) and the first ephemeral public key (g).<sup>x</sup>) And its certificate (C<sub>a</sub>) And the 1st ephemeral public key (g)<sup>x</sup>) And is sent to the second device. Certificate of the first device (C<sub>a</sub>) And the 1st ephemeral public key (g)<sup>x</sup>) And, the second device receives the certificate of the first device (C<sub>a</sub>), Select the 2nd ephemeral private key (y), and select the 2nd ephemeral public key (g)<sup>y</sup>) Is calculated and the first ephemeral public key (g)<sup>x</sup>) And the second ephemeral private key (y) and the ephemeral shared key (K)<sub>eph</sub>) Is calculated, and the public key (g) of the first device is calculated.<sup>a</sup>) And its own private key (b) to the permanent key (K)<sub>perm</sub>) Is calculated and the second ephemeral public key (g)<sup>y</sup>) And the ephemeral shared key (K)<sub>eph</sub>) And the permanent key (K)<sub>perm</sub>) And the identity (ID) that corresponds to itself<sub>b</sub>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) Calculate and certificate of it (C<sub>b</sub>) And the second ephemeral public key (g<sup>y</sup>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) And is transmitted to the first device. Certificate of the second device (C<sub>b</sub>) And the second ephemeral public key (g<sup>y</sup>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) And is received from the second device, the first device receives the certificate of the second device (C<sub>b</sub>), And the second ephemeral public key (g)<sup>y</sup>) And the first ephemeral private key (x) and the ephemeral shared key (K)<sub>eph</sub>) Is calculated, and the public key (g) of the first device is calculated.<sup>y</sup>) And its own private key (a) to the permanent key (K)<sub>perm</sub>) Is calculated and the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) Validate the 1st ephemeral public key (g)<sup>x</sup>) And the ephemeral shared key (K)<sub>eph</sub>) And the permanent key (K)<sub>perm</sub>) And the identity (ID) that corresponds to itself<sub>a</sub>) And the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) And the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) Is sent to the second device. Second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)), The second device receives the second value (H (g)).<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) Validate the ephemeral shared key (K)<sub>eph</sub>Session key (K) as a function of)<sub>sess</sub>) Is calculated. The first device is also the ephemeral shared key (K)<sub>eph</sub>Session key (K) as a function of)<sub>sess</sub>) Is calculated.
In the second feature, the present invention relates to a first device (11) that participates in session key calculation together with a second device (21). The first device is the public key (g<sup>a</sup>) And the identity (ID) that corresponds to itself<sub>a</sub>) And the corresponding identity (ID)<sub>a</sub>), Private key (a), public key (g)<sup>a</sup>) And know. The first device selects the ephemeral private key (x) and the first ephemeral public key (g).<sup>x</sup>) And the public key (g)<sup>b</sup>) And the identity of the second device (ID)<sub>b</sub>) And its certificate (C)<sub>a</sub>) And the 1st ephemeral public key (g<sup>x</sup>) And to the second device, and the second device (C)<sub>b</sub>) Certificate and 2nd ephemeral public key (g)<sup>y</sup>) And the second ephemeral public key (g<sup>y</sup>), Ephemeral shared key (K<sub>eph</sub>), Permanent key (K)<sub>perm</sub>), And the identity (ID) corresponding to the second device<sub>b</sub>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) And is received from the second device, and the certificate of the second device (C)<sub>b</sub>), And the second ephemeral public key (g)<sup>y</sup>) And the ephemeral private key (x) and the ephemeral shared key (K)<sub>eph</sub>) Is calculated, and the public key (g) of the first device is calculated.<sup>b</sup>) And its own private key (a) to the permanent key (K)<sub>perm</sub>) Is calculated and the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) Validate the 1st ephemeral public key (g)<sup>x</sup>) And the ephemeral shared key (K)<sub>eph</sub>) And the permanent key (K)<sub>perm</sub>) And the identity (ID) that corresponds to itself<sub>a</sub>) And the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) And the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) Is sent to the second device, and the ephemeral shared key (K)<sub>eph</sub>Session key (K) as a function of)<sub>sess</sub>) Has a processor (12) to calculate.
In a third feature, the present invention relates to a second device (21) that participates in the calculation of the session key together with the first device (11). The second device is the public key (g<sup>b</sup>) And the corresponding identity (C)<sub>b</sub>) And the corresponding identity (ID)<sub>b</sub>), Private key (b), public key (g)<sup>b</sup>) And know. The second device is the public key of the first device (g)<sup>a</sup>) And identity (ID<sub>a</sub>) And the certificate of the first device (C)<sub>a</sub>) And the 1st ephemeral public key (g<sup>x</sup>) And select the ephemeral private key (y) and the second ephemeral public key (g)<sup>y</sup>) Is calculated and the first ephemeral public key (g)<sup>x</sup>) And the ephemeral private key (y) from the ephemeral shared key (K)<sub>eph</sub>) Is calculated, and the public key (g) of the first device is calculated.<sup>a</sup>) And its own private key (b) to the permanent key (K)<sub>perm</sub>) Is calculated and the second ephemeral public key (g)<sup>y</sup>) And the ephemeral shared key (K)<sub>eph</sub>) And the permanent key (K)<sub>perm</sub>) And the identity (ID) that corresponds to itself<sub>b</sub>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) Calculate and certificate of it (C<sub>b</sub>) And the second ephemeral public key (g<sup>y</sup>) And the first value (H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>)) And is sent to the 1st device, and from the 1st device, the 1st ephemeral public key (g)<sup>x</sup>) And the ephemeral shared key (K)<sub>eph</sub>) And the permanent key (K)<sub>perm</sub>) And the identity (ID) corresponding to the first device<sub>a</sub>) And the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) Is received and the second value (H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>)) Validate the ephemeral shared key (K)<sub>eph</sub>Session key (K) as a function of)<sub>sess</sub>) Has a processor (22) to calculate.
[Detailed description of the invention]
FIG. 1 shows a session key exchange according to an embodiment of the present invention.
Prior to the start of this method, the first device 11 is its identity ID.<sub>a</sub>And its own private key a and public key g<sup>a</sup>I know that. g<sup>a</sup>Is g<sup>a</sup> Abbreviation for mod p, as is well known in the art, a is the private key of the first device, g is a known generator, and p is a known prime number. The second device 21 has the corresponding ID<sub>b</sub>, B, g<sup>b</sup>know. Certificates for these devices are public keys and identities, namely C<sub>a</sub>(g<sup>a</sup>, ID<sub>a</sub>) And C<sub>b</sub>(g<sup>b</sup>, ID<sub>b</sub>) Each. Devices 11 and 12 also have processors (CPUs) 12 and 22 configured to perform each step of the method.
In step 252, the first device 11 preferably randomly selects the first ephemeral private key x, which is its certificate C by message 254.<sub>a</sub>(g<sup>a</sup>, ID<sub>a</sub>) Send with ephemeral public key g<sup>x</sup>To calculate.
Upon receiving message 254, the second device 21 receives the certificate C of the first device 11 in step 256.<sub>a</sub>(g<sup>a</sup>, ID<sub>a</sub>) Is verified. If the verification is unsuccessful, the second device 21 abandons this method. However, if the validation is successful, it preferably randomly selects the second ephemeral private key y and the second ephemeral public key g.<sup>y</sup>And ephemeral sharing key K<sub>eph</sub>= g<sup>xy</sup>And Diffie-Hellman permanent key K<sub>perm</sub>= g<sup>ab</sup>Is calculated in step 258.
In step 260, the second device 21 is the second ephemeral public key g.<sup>y</sup>, Ephemeral shared key K<sub>eph</sub>, Diffie-Hellman Permanent Key K<sub>perm</sub>And its identity ID<sub>b</sub>And the first hash value H (g) using an appropriate hash function, such as one of many functions known in the art.<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>) Is calculated. Appropriate functions other than the hash function may be used for this purpose and in the calculation of the following hash values in this embodiment. The second device 21 is then the second ephemeral public key g<sup>y</sup>, It's certificate C<sub>b</sub>(g<sup>b</sup>, ID<sub>b</sub>) And the first hash value H (g)<sup>y</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>b</sub>) Is transmitted to the first device 11 by message 262.
Upon receiving message 262, the first device 11 receives the certificate C of the second device 21 in step 264.<sub>b</sub>(g<sup>b</sup>, ID<sub>b</sub>) Is verified. If the verification is unsuccessful, the first device 11 abandons this method. However, if the verification is successful, the first apparatus 11 will have the ephemeral sharing key K in step 266.<sub>eph</sub>And Diffie-Hellman Permanent Key K<sub>perm</sub>And calculate. In step 268, the first device 11 verifies the first hash value using the same hash function as the second device 21 used in step 260. If the first hash value is not authenticated, the first device 11 interrupts the method, but if the first hash value is authenticated, the first device 11 in step 270, the first ephemeral public key g.<sup>x</sup>, Ephemeral shared key K<sub>eph</sub>, Diffie-Hellman Permanent Key K<sub>perm</sub>And its identity ID<sub>a</sub>2nd hash value H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>) Is calculated. The first device 11 receives the message 272 and the second hash value H (g).<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>) Is transmitted to the second device 21.
Upon receiving message 272, the second device 21 uses the same hash function used by the first device 10 in step 270 in step 274 to use the second hash value H (g).<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>) Is verified. If the second hash value is not authenticated, the second device 21 interrupts the protocol, and if the second hash value is authenticated, the second device 21 performs the ephemeral sharing key K in step 276.<sub>eph</sub>Session key K by calculating the hash value of<sub>sess</sub>To calculate. Then it has a second hash value H (g)<sup>x</sup>, K<sub>eph</sub>, K<sub>perm</sub>, ID<sub>a</sub>) Is successfully authenticated and the session key K<sub>sess</sub>Is sent to the first device 11 with a ready message 278 to indicate that has been calculated.
Upon receiving the ready message 278 from the second device 21, the first device 11 uses the same hash function used by the second device 21 in step 276 in step 280 to use the ephemeral shared key K.<sub>eph</sub>Same session key K by calculating the hash value of<sub>sess</sub>To calculate. Then the first device 11, it is also the session key K<sub>sess</sub>A ready message 282 is sent to the second device 21 to indicate that it has calculated.
At this point, the first device 11 and the second device 21 can use the session key K to protect the information transmitted between them.<sub>sess</sub>Own. According to the protocol of the present invention, the confidentiality of the private key is guaranteed, and authentication and key verification are reciprocal. In addition, low bustness and forward confidentiality against previous session key leaks are also guaranteed. Those skilled in the art will appreciate that the three hash functions described for steps 212, 220 and 226 may be different, identical, or two of them may be identical and the other one may be different. Will.
When this description refers to random numbers, it should be noted that these numbers are often in fact pseudo-random.
The expression "security module" refers to devices such as smart cards, PC cards (formerly known as PCMCIA cards), televisions that have processors and can be used to establish secure authentication channels according to the invention. Includes any type of portable or fixed security module, such as an integrated circuit coupled to a printed circuit board.
The above-described embodiment is particularly suitable for implementation in digital television sets and security modules. However, those skilled in the art will appreciate that the present invention is feasible and available by any type of device having the required resources, i.e., a processor and preferably a memory for storing the required information. Will do. Non-limiting examples of other devices include DVD players, computers that interact with external accessories, ATMs (Automatic Teller Machines), and bank cards.
<figref num="1">FIG. 1 shows a session key exchange according to an embodiment of the present invention.</figref>
Every citation, both waysCites: the store holds 3 of 4
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US11128478B2 | Cited by | United States of America | Applicant |
| JP2011019042A | Cited by | Japan | Search report |
| JP2011109709A | Cited by | Japan | Examiner |
| JP2020511069A | Cited by | Japan | Search report |
| US11888594B2 | Cited by | United States of America | Applicant |
| JP2000502553A | Cites | Japan | Search report |
| JP2001313634A | Cites | Japan | Search report |
| US2004081321A1 | Cites | United States of America | Search report |
| JPN6010062265, 安齋 潤, 松本 勉, "”対話鍵とその生成法”", 2003年 暗号と情報セキュリティシンポジウム 予稿集, 20030126, Volume I, pp. 227−−232 | Non-patent | – | Examiner |
25 members in 12 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 2004052722 | European Patent Office (EPO) | W | |
| 2004052722 | European Patent Office (EPO) | W | |
| 2004052722 | – | – | – |
| WO2004EP52722 | – | – | – |
Members25
| Document | Office | Kind | |
|---|---|---|---|
| AU2004324546A1 | Australia | A1 | |
| WO2006048043A1 | World Intellectual Property Organization (WIPO) | A1 | |
| MX2007005037A | Mexico | A | |
| KR20070070198A | Republic of Korea | A | |
| EP1805929A1 | European Patent Office (EPO) | A1 | |
| CN101048970A | China | A | |
| BRPI0419162A | Brazil | A | |
| EP1906587A2 | European Patent Office (EPO) | A2 | |
| EP1906587A3 | European Patent Office (EPO) | A3 | |
| AU2008201456A1 | Australia | A1 | |
| JP2008518530AThis record | Japan | A | |
| KR20090119791A | Republic of Korea | A | |
| AU2004324546B2 | Australia | B2 | |
| AU2008201456B2 | Australia | B2 | |
| RU2009102230A | Russian Federation | A | |
| EP1805929B1 | European Patent Office (EPO) | B1 | |
| AT477636T | Austria | T | |
| ATE477636T1 | Austria | T1 | |
| DE602004028670D1 | Germany | D1 | |
| ES2348240T3 | Spain | T3 | |
| JP4719749B2 | Japan | B2 | |
| KR101075316B1 | Republic of Korea | B1 | |
| KR101075334B1 | Republic of Korea | B1 | |
| CN101048970B | China | B | |
| RU2488226C2 | Russian Federation | C2 |
8 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Cancellation because of no payment of annual feesLAPS | LAPS | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| First payment of annual fees (during grant procedure)JAPANESE INTERMEDIATE CODE: A61A61 | A61 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Written amendmentJAPANESE INTERMEDIATE CODE: A523A521 | A521 | |
| Notification of reasons for refusalJAPANESE INTERMEDIATE CODE: A131A131 | A131 |
Numbers
- Publication
- 2008518530
- Publication, DOCDB
- 2008518530
- Publication, EPODOC
- JP2008518530
- Application
- 2007538278
- Application, DOCDB
- 2007538278
- Application, EPODOC
- JP20070538278
Titles2
- Japanese
- セキュア認証チャネル
- English
- Secure authentication channel
Classification
- CPC, 2
- H04L9/0841
- H04L9/30
- IPC, 1
- H04L9 08
Designated states4
- Regional, 4
- Zimbabwe
- Turkmenistan
- Türkiye
- Togo