Unitary Reconstruction of Secret for Stabilizer Based Quantum Secret Sharing

TL;DR

This paper introduces a unitary method for reconstructing quantum secrets in stabilizer-based quantum secret sharing schemes, eliminating the need for adding missing shares during reconstruction.

Contribution

It presents a novel unitary reconstruction procedure that works without adding missing shares, improving efficiency over traditional erasure correction methods.

Findings

The proposed method successfully reconstructs quantum secrets without missing shares.

It simplifies the reconstruction process in stabilizer quantum secret sharing schemes.

The approach enhances the practicality of quantum secret sharing implementations.

Abstract

We propose a unitary procedure to reconstruct quantum secret for a quantum secret sharing scheme constructed from stabilizer quantum error-correcting codes. Erasure correcting procedures for stabilizer codes need to add missing shares for reconstruction of quantum secret while unitary reconstruction procedures for certain class of quantum secret sharing are known to work without adding missing shares. The proposed procedure also works without adding missing shares.

Equations

$$⟨\vec{x},\vec{y}⟩=\sum _{i=1}^n{a}_i{b}_i^{\prime }-a_i^{\prime }{b}_i.$$

$$\forall i,⟨\vec{e},{\vec{g}}_i⟩=0\Rightarrow \vec{e}\in C$$

$$C^{\perp }\cap {\mathbf{F}}_q^{\overline{J}}\subseteq C\cap {\mathbf{F}}_q^{\overline{J}}.$$

$$C^{\perp }\cap {\mathbf{F}}_q^{\overline{J}}\supseteq C\cap {\mathbf{F}}_q^{\overline{J}}.$$

$$C^{\perp }\cap {\mathbf{F}}_q^{\overline{J}}=C\cap {\mathbf{F}}_q^{\overline{J}}.$$

$$|J|-k-|\overline{J}|$$

$$\le$$

$$\underset{=n-k}{\underbrace{\dim C}}-2|\overline{J}|\le \dim C\cap {\mathbf{F}}_q^J$$

$$\dim P_{\overline{J}}(C)=(n-k)-\dim C\cap {\mathbf{F}}_q^J.$$

$$\dim C\cap {\mathbf{F}}_q^{\overline{J}}$$

$$\{|\overrightarrow{i^{(k)}}⟩\mid \overrightarrow{i^{(k)}}\in {\mathbf{F}}_q^k\}$$

$$\{|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩\mid \overrightarrow{i^{(\ell )}}\in {\mathbf{F}}_q^{\ell }\}$$

$$(|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩⟨{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})|\otimes I_J)|\psi (\overrightarrow{i^{(k)}})⟩$$

$$|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩|{\phi }_J(\overrightarrow{i^{(k)}},\overrightarrow{i^{(\ell )}})⟩=\frac{(|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩⟨{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})|\otimes I_J)|\psi (\overrightarrow{i^{(k)}})⟩}{\Vert (|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩⟨{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})|\otimes I_J)|\psi (\overrightarrow{i^{(k)}})⟩\Vert }.$$

$$\{|{\phi }_J(\overrightarrow{i^{(k)}},\overrightarrow{i^{(\ell )}})⟩\mid \overrightarrow{i^{(k)}}\in {\mathbf{F}}_q^k,\overrightarrow{i^{(\ell )}}\in {\mathbf{F}}_q^{\ell }\}$$

$$|\psi (\overrightarrow{i^{(k)}})⟩=\frac{1}{\sqrt{q^{\ell }}}\sum _{\overrightarrow{i^{(\ell )}}\in {\mathbf{F}}_q^{\ell }}|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩|{\phi }_J(\overrightarrow{i^{(k)}},\overrightarrow{i^{(\ell )}})⟩.$$

$$\sum _{\overrightarrow{i^{(k)}}\in {\mathbf{F}}_q^k}\alpha (\overrightarrow{i^{(k)}})|\overrightarrow{i^{(k)}}⟩,$$

$$\sum _{\overrightarrow{i^{(k)}}\in {\mathbf{F}}_q^k}\alpha (\overrightarrow{i^{(k)}})\frac{1}{\sqrt{q^{\ell }}}\sum _{\overrightarrow{i^{(\ell )}}\in {\mathbf{F}}_q^{\ell }}|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩|{\phi }_J(\overrightarrow{i^{(k)}},\overrightarrow{i^{(\ell )}})⟩.$$

$$\left(\frac{1}{\sqrt{q^{\ell }}}\sum _{\overrightarrow{i^{(\ell )}}\in {\mathbf{F}}_q^{\ell }}|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩|{\phi }_{\overline{J}}(\overrightarrow{i^{(\ell )}})⟩\right)\otimes \sum _{\overrightarrow{i^{(k)}}\in {\mathbf{F}}_q^k}\alpha (\overrightarrow{i^{(k)}})|\overrightarrow{i^{(k)}}⟩.$$

$$|\psi (0)⟩$$

$$|\psi (1)⟩$$

$${\vec{g}}_1$$

$${\vec{g}}_2$$

$${\vec{g}}_3$$

$${\vec{g}}_4$$

$$|{\phi }_J(0,00)⟩$$

$$|{\phi }_J(0,01)⟩$$

$$|{\phi }_J(0,10)⟩$$

$$|{\phi }_J(0,11)⟩$$

$$|{\phi }_J(1,00)⟩$$

$$|{\phi }_J(1,01)⟩$$

$$|{\phi }_J(1,10)⟩$$

$$|{\phi }_J(1,11)⟩$$

$$U_{\mathrm{rec}}|{\phi }_J(i_1,i_2{i}_3)⟩=|i_2{i}_3⟩|i_1⟩.$$

$$\frac{1}{2}(|0000⟩+|0101⟩+|1010⟩+|1111⟩)(\alpha (0)|0⟩+\alpha (1)|1⟩),$$

Full text

††journal: Quantum Information Processing

1 Introduction

Secret sharing (SS) shamir79 is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can reconstruct the original secret from their shares. Traditionally both secret and shares were classical information (bits). Several authors cleve99 ; gottesman00 ; hillery99 ; smith00 extended the traditional SS to quantum one so that a quantum secret can be encoded to quantum shares.

There was a difference between early pionieering works cleve99 ; gottesman00 ; hillery99 ; smith00 of quantum SS. The first quantum SS hillery99 was based on the controlled teleportation PhysRevA.58.4394 ; PhysRevA.70.022329 , whose reconstruction of quantum secret involved classical communication among participants. On the other hand, the others works cleve99 ; gottesman00 ; smith00 related reconstruction to quantum error correction calderbank96 ; steane96 , and their reconstruction procedures were generally unitary operations on quantum shares. This paper studies reconstruction in the second category.

When we require unqualified sets of participants to have zero information of the secret, the size of each share must be larger than or equal to that of secret. By tolerating partial information leakage to unqualified sets, the size of shares can be smaller than that of secret. Such SS is called ramp SS blakley85 ; yamamoto86 . The quantum ramp SS was proposed by Ogawa et al. ogawa05 . If an unqualified set has absolutely no information about quantum secret (see ogawa05 for a formal definition), it is called a forbidden set.

When we have a quantum error-correcting code (QECC) of length $n$, use it for quantum secret sharing and it can correct erasures in a set $\overline{J}\subset\{1$, …, $n\}$, it was shown cleve99 ; gottesman00 that $J=\{1$, …, $n\}\setminus\overline{J}$ is a qualified set and $\overline{J}$ is a forbidden set. The above statement also holds for quantum ramp SS ogawa05 . In such a situation, a straightforward method for the set $J$ of participants to reconstruct quantum secret is as follows: Firstly, initialize quantum systems in $\overline{J}$ to any quantum states and apply the erasure decoding procedure of QECC. This method is wasteful because decoding procedures usually involve measurement and they also need to attach $|\overline{J}|$ extra quantum systems. For example, if $|J|=70$ and $|\overline{J}|=30$, adding 30 quantum systems and performing measurement on 100 systems are wasteful.

To overcome this waste, unitary reconstruction methods were proposed for previous proposals of quantum SS cleve99 ; matsumoto14qss ; ogawa05 ; matsumoto14strong . On the other hand, while quantum SS constructed from the stabilizer QECC had been already studied marin13 ; markham08 ; sarvepalli12 , no unitary reconstruction procedure has been proposed for stabilizer based quantum SS. Stabilizer based quantum SS is important because it can realize access structures that cannot be realized by quantum SS based on CSS codes calderbank96 ; steane96 . For example, only the $[[5,1,3]]$ binary stabilizer QECC can realize quantum SS distributing 1 qubit of secret to 5 participants receiving 1-qubit shares and allowing only 3 or more participants to reconstruct secret. In addition, when sharing classical secret, it was recently shown that stabilizer QECC can realize an access structure that cannot be realized by classical information processing matsumoto17impossible .

In this paper, we propose a unitary reconstruction method that can be executed by a qualified set $J$ of participants without adding extra quantum systems. In Section 2, we introduce notations of stabilizer QECC and prove some properties of stabilizer QECC used later in the proposed reconstruction procedure. Section 3 describes the proposed procedure. Section 4 gives an explicit computational example of the proposed procedure applied to the well-known $[[5,1,3]]$ binary stabilizer QECC. In the Appendix, we discuss the security of quantum SS based on stabilizer QECCs.

2 Preliminaries

2.1 Notations for Stabilizer Codes

Let $q$ be a prime power, and we consider the $q$-dimensional complex linear space $\mathbf{C}_{q}$. A quantum system whose state is expressed by $\mathbf{C}_{q}$ is called a qudit in this paper. Each share is assumed to be a qudit, and quantum secret consists of one or more qudits. If quantum secret has two or more qudits, the quantum SS becomes a ramp scheme. We fix a $q$-ary stabilizer QECC encoding $k$ qudits to $n$ qudits. The materials in this subsection is not new at all, and can be found in, for example, ashikhmin00 ; grassl11 . Its stabilizer can be expressed as an $(n-k)$-dimensional $\mathbf{F}_{q}$-linear subspace $C$ of $\mathbf{F}_{q}^{2n}$, where $\mathbf{F}_{q}$ is the finite field with $q$ elements.

For two vectors $\vec{x}=(a_{1}$, $b_{1}$, …, $a_{n}$, $b_{n})$ and $\vec{y}=(a^{\prime}_{1}$, $b^{\prime}_{1}$, …, $a^{\prime}_{n}$, $b^{\prime}_{n})\in\mathbf{F}_{q}^{2n}$, we define its symplectic inner product as

[TABLE]

Let $C^{\perp}=\{\vec{x}\in\mathbf{F}_{q}^{2n}\mid\forall\vec{y}\in C$, $\langle\vec{x}$, $\vec{y}\rangle=0\}$. Then we have $C^{\perp}\supset C$ and $\dim C^{\perp}=n+k$.

2.2 Qualified Sets and Related Properties

To use any reconstruction procedure, the set $J$ of participants must be qualified to reconstruct the secret. In this subsection, we clarify a necessary and sufficient condition for qualified sets and related properties that are later used for the proposed reconstruction procedure.

For a set $J\subset\{1$, …, $n\}$ of participants to be qualified, the erasures in $\overline{J}$ must be decodable, where an erasure means a quantum error with known location. In other words, when the errors are only in $\overline{J}$, the stabilizer QECC defined by the stabilizer $C\subset\mathbf{F}_{q}^{2n}$ must be able to correct the error.

Let $\vec{g}_{1}$, …, $\vec{g}_{n-k}$ be a basis of $C$. A quantum error can also be identified with a vector $\vec{e}=(a_{1}$, $b_{1}$, …, $a_{n}$, $b_{n})\in\mathbf{F}_{q}^{2n}$ (see, for example, ashikhmin00 ; grassl11 ). Measurement in the standard decoding procedure gives the symplectic inner products $\langle\vec{e}$, $\vec{g}_{i}\rangle$ for $i=1$, …, $n-k$. Let $\mathbf{F}_{q}^{\overline{J}}=\{(a_{1}$, $b_{1}$, …, $a_{n}$, $b_{n})\in\mathbf{F}_{q}^{2n}\mid$ $j\in J\Rightarrow(a_{j}$, $b_{j})=(0$, $0)\}$ and $\mathbf{F}_{q}^{J}=\{(a_{1}$, $b_{1}$, …, $a_{n}$, $b_{n})\in\mathbf{F}_{q}^{2n}\mid$ $j\in\overline{J}\Rightarrow(a_{j}$, $b_{j})=(0$, $0)\}$. Observe that $\dim\mathbf{F}_{q}^{J}=2|J|$ and $\dim\mathbf{F}_{q}^{\overline{J}}=2|\overline{J}|$.

Under the assumption $j\in J\Rightarrow(a_{j}$, $b_{j})=(0,0)$ for $\vec{e}$, we can correct all errors $\vec{e}\in\mathbf{F}_{q}^{\overline{J}}$ if and only if the implication

[TABLE]

holds. The condition (2) implies (with the assumption that errors belong to $\overline{J}$)

[TABLE]

On the other hand, the assumption $C^{\perp}\supset C$ implies

[TABLE]

Therefore the condition (2) is equivalent to

[TABLE]

We will study the linear spaces consisting of qudits in $J$ or $\overline{J}$ of quantum codewords. Let $Q(C)\subset\mathbf{C}_{q}^{\otimes n}$, $Q(C\cap\mathbf{F}_{q}^{\overline{J}})\subset\mathbf{C}_{q}^{\otimes|\overline{J}|}$, $Q(C\cap\mathbf{F}_{q}^{J})\subset\mathbf{C}_{q}^{\otimes|J|}$ be stabilizer QECCs defined by $C$, $C\cap\mathbf{F}_{q}^{\overline{J}}$, and $C\cap\mathbf{F}_{q}^{J}$, respectively. When we consider qudits in $J$ (resp. $\overline{J}$) of codewords in $Q(C)$, their quantum states are density matrices whose row spaces are contained in $Q(C\cap\mathbf{F}_{q}^{J})$ (resp. $Q(C\cap\mathbf{F}_{q}^{\overline{J}})$).

In order to evaluate their dimensions, firstly we have to evaluate $\dim C\cap\mathbf{F}_{q}^{J}$ and $\dim C\cap\mathbf{F}_{q}^{\overline{J}}$, where $\dim C\cap\mathbf{F}_{q}^{J}$ denotes the dimension of the linear space $C\cap\mathbf{F}_{q}^{J}$. We have

[TABLE]

The linear space $C\cap\mathbf{F}_{q}^{J}$ consists of vectors in $C$ whose $(2j-1)$-th component and $2j$-th component are zero if $j\in\overline{J}$, which implies $\dim C-\dim C\cap\mathbf{F}_{q}^{J}\leq 2|\overline{J}|$. Eq. (4) holds because

[TABLE]

For $\vec{x}=(a_{1}$, $b_{1}$, …, $a_{n}$, $b_{n})\in\mathbf{F}_{q}^{2n}$, let $P_{\overline{J}}(\vec{x})=(a_{j},b_{j})_{j\in\overline{J}}$, that is, the projection to the index set $\overline{J}$. Then we have $C\cap\mathbf{F}_{q}^{J}=C\cap\ker(P_{\overline{J}})$ and $\dim C\cap\mathbf{F}_{q}^{J}+\dim P_{\overline{J}}(C)=\dim C$, which implies

[TABLE]

Suppose that Eq. (5) does not hold, then we have $\dim P_{\overline{J}}(C)<|\overline{J}|$ by Eq. (6) and the equality $n=|J|+|\overline{J}|$. Since $C^{\perp}\cap\mathbf{F}_{q}^{\overline{J}}=P_{\overline{J}}(C)^{\perp}$ ($\perp$ in $P_{\overline{J}}(C)^{\perp}$ is considered in $\mathbf{F}_{q}^{2|\overline{J}|}$), we have $\dim C^{\perp}\cap\mathbf{F}_{q}^{\overline{J}}=2|\overline{J}|-\dim P_{\overline{J}}(C)>|\overline{J}|$. The last inequality implies $\dim C^{\perp}\cap\mathbf{F}_{q}^{\overline{J}}>|\overline{J}|>\dim P_{\overline{J}}(C)\geq\dim C\cap\mathbf{F}_{q}^{\overline{J}}$ because $P_{\overline{J}}(C)\supseteq C\cap\mathbf{F}_{q}^{\overline{J}}$. The inequality $\dim C^{\perp}\cap\mathbf{F}_{q}^{\overline{J}}>\dim C\cap\mathbf{F}_{q}^{\overline{J}}$ contradicts with Eq. (3). So we see that Eq. (5) is true when $J$ is a qualified set.

In light of Eqs. (4) and (5), let $\dim C\cap\mathbf{F}_{q}^{J}=|J|-k-\ell$. Then $Q(C\cap\mathbf{F}_{q}^{J})$ encodes $k+\ell$ qudits to $|J|$ qudits.

We consider $\dim C\cap\mathbf{F}_{q}^{\overline{J}}$. By Eq. (3) we have

[TABLE]

which means that $Q(C\cap\mathbf{F}_{q}^{\overline{J}})$ encodes $\ell$ qudits to $|\overline{J}|$ qudits. Readers might wonder if $\ell=|\overline{J}|$ is always true. The equality $\ell=|\overline{J}|$ usually holds as we will see in Section 4 with an example. But $\ell=|\overline{J}|$ is sometimes false in general cases, for example, consider an unpractical stabilizer QECC whose codewords are always set to $|00\cdots 0\rangle$ in $\overline{J}$, which gives $\ell=0$.

3 Proposed Unitary Reconstruction

For ease of presentation, without loss of generality we may assume $\overline{J}=\{1$, …, $|\overline{J}|\}$ and $J=\{|\overline{J}|+1$, …, $n\}$, by reordering indices. Let

[TABLE]

be an orthonormal basis (ONB) of $\mathbf{C}_{q}^{\otimes k}$, let $|\psi(\vec{i^{(k)}})\rangle\in Q(C)$ the quantum codeword corresponding to $|\vec{i^{(k)}}\rangle$. Let

[TABLE]

be an ONB of $Q(C\cap\mathbf{F}_{q}^{\overline{J}})$. Then

[TABLE]

have the same nonzero length for all $\vec{i^{(k)}}$ and $\vec{i^{(\ell)}}$, where $I_{J}$ is the identity matrix on qudits in $J$. Because otherwise the Holevo information between classical information $\vec{i^{(k)}}$ and the qudits in $\overline{J}$ would have strictly positive value which contradicts by ogawa05 to our assumption that $J$ is a qualified set

Define a state vector $|\varphi_{J}(\vec{i^{(k)}},\vec{i^{(\ell)}})\rangle\in Q(C\cap\mathbf{F}_{q}^{J})$ by

[TABLE]

Then $|\varphi_{J}(\vec{i^{(k)}},\vec{i^{(\ell)}})\rangle$ is of length one and orthogonal to each other for different $(\vec{i^{(k)}}$, $\vec{i^{(\ell)}})$. Therefore

[TABLE]

is an ONB of $Q(C\cap\mathbf{F}_{q}^{J})$.

By using the above notations we can express

[TABLE]

We can define a unitary operation $U_{\mathrm{rec}}$ from $Q(C\cap\mathbf{F}_{q}^{J})$ to $Q(C\cap\mathbf{F}_{q}^{\overline{J}})\otimes\mathbf{C}_{q}^{\otimes k}$, sending $|\varphi_{J}(\vec{i^{(k)}},\vec{i^{(\ell)}})\rangle$ to $|\varphi_{\overline{J}}(\vec{i^{(\ell)}})\rangle|\vec{i^{(k)}}\rangle$, because both $\{|\varphi_{J}(\vec{i^{(k)}},\vec{i^{(\ell)}})\rangle\mid\vec{i^{(k)}}\in\mathbf{F}_{q}^{k}$, $\vec{i^{(\ell)}}\in\mathbf{F}_{q}^{\ell}\}$ and $\{|\varphi_{\overline{J}}(\vec{i^{(\ell)}})\rangle|\vec{i^{(k)}}\rangle\mid\vec{i^{(k)}}\in\mathbf{F}_{q}^{k}$, $\vec{i^{(\ell)}}\in\mathbf{F}_{q}^{\ell}\}$ are ONBs with the same number of quantum state vectors in them.

Suppose that quantum secret is

[TABLE]

where $\alpha(\vec{i^{(k)}})$ are complex coefficients. Then the whole quantum state of all shares is, by Eq. (12),

[TABLE]

Applying $U_{\mathrm{rec}}$ on the qualified set $J$ yields

[TABLE]

Equation (13) means that the quantum secret is reconstructed in the rightmost $k$ qudits, and that it is unentangled from the rest of qudits.

4 Explicit Computational Example of

the $[[5,1,3]]$ Binary Stabilizer QECC

Since our presentation of the proposed procedure is slightly abstract, in this section we will see an explicit computational example with the $[[5,1,3]]$ binary stabilizer QECC. According to gottesmanthesis , the $[[5,1,3]]$ binary stabilizer QECC encodes $|0\rangle$ to

[TABLE]

and $|1\rangle$ to

[TABLE]

According to (gottesmanthesis, , Table 3.2), the corresponding stabilizer $C\subset\mathbf{F}_{2}^{10}$ is generated by

[TABLE]

Since it can correct any two erasures, we can set $J=\{3$, $4$, $5\}$ and $\overline{J}=\{1$, $2\}$. Since $C\cap\mathbf{F}_{2}^{\overline{J}}=C^{\perp}\cap\mathbf{F}_{2}^{\overline{J}}$ are zero linear spaces, we can see that Eq. (3) holds and $\ell=2$. We can choose $|\varphi_{\overline{J}}(\vec{i^{(\ell)}})\rangle$ of Eq. (8) as $|\varphi_{\overline{J}}(00)\rangle=|00\rangle$, $|\varphi_{\overline{J}}(01)\rangle=|01\rangle$, $|\varphi_{\overline{J}}(10)\rangle=|10\rangle$, and $|\varphi_{\overline{J}}(11)\rangle=|11\rangle$. Then $|\varphi_{J}(\vec{i^{(k)}},\vec{i^{(\ell)}})\rangle$ of Eq. (10) become the following states:

[TABLE]

The unitary reconstruction $U_{\mathrm{rec}}$ works as follows:

[TABLE]

If the quantum secret is $\alpha(0)|0\rangle+\alpha(1)|1\rangle$, then the quantum state of all shares is $\alpha(0)|\psi(0)\rangle+\alpha(1)|\psi(1)\rangle$. Application of $U_{\mathrm{rec}}$ to the 3rd, the 4th and the 5th qubits of $\alpha(0)|\psi(0)\rangle+\alpha(1)|\psi(1)\rangle$ gives

[TABLE]

which means that the 3rd, the 4th and the 5th participants successfully reconstructed the quantum secret into the 5th qubit. Also observe that after the reconstruction the 5th qubit is completely unentangled from the rest of qubits. Since the proposed procedure only interacts with the 3rd to the 5th qubits, even if there are errors in the 1st and the 2nd qubits, after reconstruction we obtain $\alpha(0)|0\rangle+\alpha(1)|1\rangle$ at the 5th qubit.

Appendix A Security Analysis

For the completeness of this paper, in this appendix we discuss the security of quantum SS based on stabilizer QECCs. For the security analysis of quantum secret sharing based on quantum error correction, such as cleve99 ; gottesman00 , we need to clarify (a) which share sets are qualified (being able to reconstruct secret perfectly) and (b) which share sets are forbidden (having no information about secret). The characterization of qualified sets in the proposed scheme is given by Eq. (3). Observe also that from a given basis $\vec{g}_{1}$, …, $\vec{g}_{n-k}$ of $C$, we can easily verify by standard linear algebra whether or not Eq. (3) holds for an arbitrarily given share set $J$. The characterization of forbidden sets also immediately follows from the fact that a share set is forbidden if and only if the rest of shares is qualified, as shown in cleve99 ; gottesman00 ; ogawa05 .

Acknowledgements.

The author would like to thank reviewers’ comments that improved this paper significantly. This research is partly supported by the JSPS Grant No. 26289116.