# Implicit certificate

In cryptography, implicit certificates are a variant of public key certificate. A subject's public key is reconstructed from the data in an implicit certificate, and is then said to be "implicitly" verified. Tampering with the certificate will result in the reconstructed public key being invalid, in the sense that it is infeasible to find the matching private key value, as would be required to make use of the tampered certificate.

By comparison, traditional public-key certificates include a copy of the subject's public key, and a digital signature made by the issuing certificate authority (CA). The public key must be explicitly validated, by verifying the signature using the CA's public key. For the purposes of this article, such certificates will be called "explicit" certificates.

Elliptic Curve Qu-Vanstone (ECQV) is one kind of implicit certificate scheme. It is described in the document Standards for Efficient Cryptography 4 (SEC4).[1]
This article will use ECQV as a concrete example to illustrate implicit certificates.

## Comparison of ECQV with explicit certificates

Conventional explicit certificates are made up of three parts: subject identification data, a public key and a digital signature which binds the public key to the user's identification data (ID). These are distinct data elements within the certificate, and contribute to the size of the certificate: for example, a standard X.509 certificate is on the order of 1KB in size (~8000 bits).

An ECQV implicit certificate consists of identification data, and a single cryptographic value. This value, an elliptic curve point, combines the function of public key data and CA signature. ECQV implicit certificates can therefore be considerably smaller than explicit certificates, and so are useful in highly constrained environments such as Radio-frequency Identification RFID tags, where not a lot of memory or bandwidth is available.

ECQV certificates are useful for any ECC scheme where the private and public keys are of the form ( d, dG ). This includes key agreement protocols such as ECDH and ECMQV, or signing algorithms such as ECDSA. The operation will fail if the certificate has been altered, as the reconstructed public key will be invalid. Reconstructing the public key is fast (a single point multiplication operation) compared to ECDSA signature verification.

## Comparison with ID-based cryptography

Implicit certificates are not to be confused with identity-based cryptography. In ID-based schemes, the subject's identity itself is used to derive their public key; there is no 'certificate' as such. The corresponding private key is calculated and issued to the subject by a trusted third party.

In an implicit certificate scheme, the subject has a private key which is not revealed to the CA during the certificate-issuing process. The CA is trusted to issue certificates correctly, but not to hold individual user's private keys. Wrongly issued certificates can be revoked, whereas there is no comparable mechanism for misuse of private keys in an identity-based scheme.

## Description of the ECQV scheme

Initially the scheme parameters must be agreed upon. These are:

• The elliptic curve parameters, including a generating point ${\displaystyle G\,}$of order ${\displaystyle n\,}$.
• An encoding function ${\displaystyle {\textrm {Encode}}(ID,\gamma )}$ which encodes its arguments as a byte-block, and a corresponding ${\displaystyle {\textrm {Decode}}_{\gamma }(\cdot )}$ which extracts the ${\displaystyle \gamma }$ value from an encoding.
• A hash function ${\displaystyle H_{n}(\cdot )}$ which accepts a byte-block and yields a hash value as an integer in the range ${\displaystyle [0,n-1]}$

The certificate authority CA will have private key ${\displaystyle c\,}$ and public key ${\displaystyle Q_{CA}=cG}$

### Certificate request protocol

Here, Alice will be the user who requests the implicit certificate from the CA. She has identifying information ${\displaystyle ID_{A}}$.

1. Alice generates a random integer ${\displaystyle \alpha \,}$
2. Alice computes ${\displaystyle A=\alpha \,G\,}$ and sends ${\displaystyle A}$ and ${\displaystyle ID_{A}}$ to the CA.
3. CA selects a random integer ${\displaystyle k\,}$ from ${\displaystyle [1,n-1]\,}$ and computes ${\displaystyle kG\,}$.
4. CA computes ${\displaystyle \gamma =A+kG\,}$ (this is the public key reconstruction data)
5. CA computes ${\displaystyle Cert={\textrm {Encode}}(\gamma ,{\textrm {ID}}_{A})\,}$
6. CA computes ${\displaystyle e=H_{n}(Cert)}$
7. CA computes ${\displaystyle s=ek+c{\pmod {n}}\,}$ (${\displaystyle s\,}$ is the private key reconstruction data)
8. CA sends ${\displaystyle (s,Cert)\,}$ to Alice
9. Alice computes ${\displaystyle e'=H_{n}(Cert)}$ and her private key ${\displaystyle a=e'\alpha +s{\pmod {n}}\,}$
10. Alice computes ${\displaystyle \gamma '={\textrm {Decode}}_{\gamma }(Cert)}$ and her public key ${\displaystyle Q_{A}=e'\gamma '+Q_{CA}\,}$
11. Alice verifies that the certificate is valid, i.e. that ${\displaystyle Q_{A}=aG}$

### Using the certificate

Here, Alice wants to prove her identity to Bob, who trusts the CA.

1. Alice sends ${\displaystyle Cert}$ to Bob, and a ciphertext ${\displaystyle C}$ created using her private key ${\displaystyle a}$. The ciphertext can be a digital signature, or part of an Authenticated Key Exchange protocol.
2. Bob computes ${\displaystyle \gamma ''={\textrm {Decode}}_{\gamma }(Cert)}$ and ${\displaystyle e''=H_{n}(Cert)}$.
3. Bob computes Alice's alleged public key ${\displaystyle Q_{A}'=e''\gamma ''+Q_{CA}}$
4. Bob validates ciphertext ${\displaystyle C}$ using ${\displaystyle Q_{A}'}$. If this validation is successful, he can trust that the key ${\displaystyle Q_{A}'}$ is owned by the user whose identity information is contained in ${\displaystyle Cert}$.

### Proof of equivalence of private and public keys

Alice's private key is ${\displaystyle a=e'\alpha +s=e\alpha +ek+c{\pmod {n}}}$

The public key reconstruction value ${\displaystyle \gamma =A+kG=(\alpha +k)G}$

Alice's public key is ${\displaystyle Q_{A}=e\gamma +Q_{CA}=e(\alpha +k)G+cG=(e\alpha +ek+c)G}$

Therefore, ${\displaystyle Q_{A}=aG}$, which completes the proof.

## Security

A security proof for ECQV has been published by Brown et al.[2]