Revision History for: Uncloneable Encryption
- 2025-06-24 at 21:36 by JuliaM
Introduction
This example protocol achieves the task of Unclonable Encryption in which the sender sends classical message encoded using quantum states to the receiver. An eavesdropper can neither decrypt the message without the key nor can he copy the encrypted message for later decoding without getting caught.
Outline
The protocol requires a pre-shared set of four keys that are partially consumed in the protocol and that can be regenerated by using the protocol itself.
Encoding phase:
The message is divided into parts (registers). A polynomial of degree equal to the number of parts is defined with the value of the registers as its coefficients. The constant term is chosen such that the first key value is a root of the polynomial. The string formed by coefficients of the polynomial is then XORed with the second key value. This classical pre-processing step is reminiscent to Shamir Secret Sharing scheme.Both codes are then used in conjunction with the obtained string to pick a string to encode the pre-processed string such that the first one offers error protection against noise in the channel and the second one for privacy amplification.
The obtained classical string is then encoded in the computational or Hadamard basis according to the corresponding bit in the fourth key value and sent to the receiver.
Decoding phase:
Upon receiving the qubits, they are measured in the computational or Hadamard basis according to the corresponding bit in the fourth key value.Calculate the parity checks of the first classical code. If they are not equal to the third shared key value, there are errors in the state, which can be corrected using the standard decoding map. Evaluate the parity checks of $ C_{2}/C_{1}^{\\\perp }$, producing another string.
The string obtained is XORed with the second key value and used as coefficients of a polynomial. The polynomial is then evaluated at the first key value and if it gives zero, the message is accepted. It is rejected otherwise.
Assumptions
- Classical authenticated channels are available between sender and receiver.
Requirements
Network stage: Prepare and measure.
- A classical linear code for correcting bit-flip errors.
- A classical linear code for performing privacy amplification.
- Basic state preparation and measurement devices.
- A classical and a quantum channel between the sender and the receiver.
Notation
- $n$: Bit length of the message.
- $r$: Number of registers of size $s$ the message is divided into.
- $s$: Bit length of each register the message is divided into.
- $k$: Random key of length $s$.
- $m_k$: Value of the $k^{th}$ register for $k\\\in \\\{0,1,..,r\\\}$.
- $e$: Random key of length $n+s$.
- $c_1$: Random key for selecting the coset from $C_1$.
- $C_1$: Classical linear code for correcting bit flip errors.
- $C_2$: Classical linear code for performing privacy amplification.
- $y$: XORed product of $e$ and $m_k$s.
- $z$: Random string from the coset $y$ selected from $C_1/C_2^{\\\perp}$.
- $N$: Bit length of $z$.
- $b$: Random key of length $N$.
Properties
- It uses up more than twice as much key as a classical one-time pad but the key can be partially reused upon successful transmission. The scheme can also be used to regenerate the keys itself.
- The protocol can be used for QKD with some slight modifications.
Technical Description
Pre-shared key $(k,e,c_{1},b)$ is established.
Encoding
- Divide the $n$-bit message into $r$ groups of $s$ bits.
- Define a polynomial $f$ of degree $r$ whose first $r$ coefficients are the registers $m_{0},m_{1},\\\ldots ,m_{r-1}$ of the $n$-bit message.
- The constant term, $m_{r}$, is chosen such that $f(k)=0$.
- XOR the string $(m_{0},\\\ldots ,m_{r})$ with $e$, producing a new classical string $y$ of length $n+s$ bits.
- Consider the particular coset of the classical error-correcting code $C_{1}$ given by the syndrome $c_{1}$.
- Pick the string $z$ at random so that its coset of $C_{1}/C_{2}^{\\\perp }$ in the coset $c_{1}$ of $C_{1}$ corresponds to $y$.
- Transmit $N$ qubits after operations based on $b$ such that:
- When the $i^{th}$ bit of $b$ is $0$, transmit the $i^{th}$ bit of $z$ in the computational basis.
- When the $i^{th}$ bit of $b$ is $1$, transmit the $i^{th}$ bit of $z$ in the Hadamard basis.
Decoding
- Upon receiving the $N$ qubits, measure in the computational basis if the $i^{th}$ bit of $b$ is $0$, else in the Hadamard basis the $i^{th}$ bit of $b$ is $1$, to get $z$.
- Calculate the parity checks of the classical code $C_{1}^{\\\perp }$. If they are not equal to the string $c_{1}$, there are errors in the state, which can be corrected using the standard decoding map.
- Evaluate the parity checks of $C_{2}/C_{1}^{\\\perp }$, producing a $n+s$-bit string $y$.
- XOR $y$ with $e$, producing a new string $(m_{0},\\\ldots ,m_{r})$.
- Consider the $(m_{0},\\\ldots ,m_{r})$ as the coefficients of a polynomial $f$. Accept only if $f(k)=0$.
Experimental Implementations
No content has been added to this section, yet!
Related Codes
Description Link An implementation of the basic steps required in the uncloneable encryption protocol. It performs the classical part of the algorithm. Link Further Information
No content has been added to this section, yet!
References
- Gottesman, Daniel. “Uncloneable encryption.” arXiv preprint quant-ph/0210062 (2002).
- 2025-05-16 at 13:33 by JuliaM
Introduction
This example protocol achieves the task of Unclonable Encryption in which the sender sends classical message encoded using quantum states to the receiver. An eavesdropper can neither decrypt the message without the key nor can he copy the encrypted message for later decoding without getting caught.
Outline
The protocol requires a pre-shared set of four keys that are partially consumed in the protocol and that can be regenerated by using the protocol itself.
Encoding phase:
The message is divided into parts (registers). A polynomial of degree equal to the number of parts is defined with the value of the registers as its coefficients. The constant term is chosen such that the first key value is a root of the polynomial. The string formed by coefficients of the polynomial is then XORed with the second key value. This classical pre-processing step is reminiscent to Shamir Secret Sharing scheme.Both codes are then used in conjunction with the obtained string to pick a string to encode the pre-processed string such that the first one offers error protection against noise in the channel and the second one for privacy amplification.
The obtained classical string is then encoded in the computational or Hadamard basis according to the corresponding bit in the fourth key value and sent to the receiver.
Decoding phase:
Upon receiving the qubits, they are measured in the computational or Hadamard basis according to the corresponding bit in the fourth key value.Calculate the parity checks of the first classical code. If they are not equal to the third shared key value, there are errors in the state, which can be corrected using the standard decoding map. Evaluate the parity checks of $ C_{2}/C_{1}^{\\\perp }$, producing another string.
The string obtained is XORed with the second key value and used as coefficients of a polynomial. The polynomial is then evaluated at the first key value and if it gives zero, the message is accepted. It is rejected otherwise.
Assumptions
- Classical authenticated channels are available between sender and receiver.
Requirements
Network stage: Prepare and measure.
- A classical linear code for correcting bit-flip errors.
- A classical linear code for performing privacy amplification.
- Basic state preparation and measurement devices.
- A classical and a quantum channel between the sender and the receiver.
Notation
- $n$: Bit length of the message.
- $r$: Number of registers of size $s$ the message is divided into.
- $s$: Bit length of each register the message is divided into.
- $k$: Random key of length $s$.
- $m_k$: Value of the $k^{th}$ register for $k\\\in \\\{0,1,..,r\\\}$.
- $e$: Random key of length $n+s$.
- $c_1$: Random key for selecting the coset from $C_1$.
- $C_1$: Classical linear code for correcting bit flip errors.
- $C_2$: Classical linear code for performing privacy amplification.
- $y$: XORed product of $e$ and $m_k$s.
- $z$: Random string from the coset $y$ selected from $C_1/C_2^{\\\perp}$.
- $N$: Bit length of $z$.
- $b$: Random key of length $N$.
Properties
- It uses up more than twice as much key as a classical one-time pad but the key can be partially reused upon successful transmission. The scheme can also be used to regenerate the keys itself.
- The protocol can be used for QKD with some slight modifications.
Technical Description
Pre-shared key $(k,e,c_{1},b)$ is established.
Encoding
- Divide the $n$-bit message into $r$ groups of $s$ bits.
- Define a polynomial $f$ of degree $r$ whose first $r$ coefficients are the registers $m_{0},m_{1},\\\ldots ,m_{r-1}$ of the $n$-bit message.
- The constant term, $m_{r}$, is chosen such that $f(k)=0$.
- XOR the string $(m_{0},\\\ldots ,m_{r})$ with $e$, producing a new classical string $y$ of length $n+s$ bits.
- Consider the particular coset of the classical error-correcting code $C_{1}$ given by the syndrome $c_{1}$.
- Pick the string $z$ at random so that its coset of $C_{1}/C_{2}^{\\\perp }$ in the coset $c_{1}$ of $C_{1}$ corresponds to $y$.
- Transmit $N$ qubits after operations based on $b$ such that:
- When the $i^{th}$ bit of $b$ is $0$, transmit the $i^{th}$ bit of $z$ in the computational basis.
- When the $i^{th}$ bit of $b$ is $1$, transmit the $i^{th}$ bit of $z$ in the Hadamard basis.
Decoding
- Upon receiving the $N$ qubits, measure in the computational basis if the $i^{th}$ bit of $b$ is $0$, else in the Hadamard basis the $i^{th}$ bit of $b$ is $1$, to get $z$.
- Calculate the parity checks of the classical code $C_{1}^{\\\perp }$. If they are not equal to the string $c_{1}$, there are errors in the state, which can be corrected using the standard decoding map.
- Evaluate the parity checks of $C_{2}/C_{1}^{\\\perp }$, producing a $n+s$-bit string $y$.
- XOR $y$ with $e$, producing a new string $(m_{0},\\\ldots ,m_{r})$.
- Consider the $(m_{0},\\\ldots ,m_{r})$ as the coefficients of a polynomial $f$. Accept only if $f(k)=0$.
Experimental Implementations
No content has been added to this section, yet!
Related Codes
Description Link An implementation of the basic steps required in the uncloneable encryption protocol. It performs the classical part of the algorithm. Link Further Information
No content has been added to this section, yet!
References
- Gottesman, Daniel. “Uncloneable encryption.” arXiv preprint quant-ph/0210062 (2002).
- 2025-05-16 at 13:33 by JuliaM
Introduction
This example protocol achieves the task of Unclonable Encryption in which the sender sends classical message encoded using quantum states to the receiver. An eavesdropper can neither decrypt the message without the key nor can he copy the encrypted message for later decoding without getting caught.
Outline
The protocol requires a pre-shared set of four keys that are partially consumed in the protocol and that can be regenerated by using the protocol itself.
Encoding phase:
The message is divided into parts (registers). A polynomial of degree equal to the number of parts is defined with the value of the registers as its coefficients. The constant term is chosen such that the first key value is a root of the polynomial. The string formed by coefficients of the polynomial is then XORed with the second key value. This classical pre-processing step is reminiscent to Shamir Secret Sharing scheme.Both codes are then used in conjunction with the obtained string to pick a string to encode the pre-processed string such that the first one offers error protection against noise in the channel and the second one for privacy amplification.
The obtained classical string is then encoded in the computational or Hadamard basis according to the corresponding bit in the fourth key value and sent to the receiver.
Decoding phase:
Upon receiving the qubits, they are measured in the computational or Hadamard basis according to the corresponding bit in the fourth key value.Calculate the parity checks of the first classical code. If they are not equal to the third shared key value, there are errors in the state, which can be corrected using the standard decoding map. Evaluate the parity checks of $ C_{2}/C_{1}^{\\\perp }$, producing another string.
The string obtained is XORed with the second key value and used as coefficients of a polynomial. The polynomial is then evaluated at the first key value and if it gives zero, the message is accepted. It is rejected otherwise.
Assumptions
- Classical authenticated channels are available between sender and receiver.
Requirements
Network stage: Prepare and measure.
- A classical linear code for correcting bit-flip errors.
- A classical linear code for performing privacy amplification.
- Basic state preparation and measurement devices.
- A classical and a quantum channel between the sender and the receiver.
Notation
- $n$: Bit length of the message.
- $r$: Number of registers of size $s$ the message is divided into.
- $s$: Bit length of each register the message is divided into.
- $k$: Random key of length $s$.
- $m_k$: Value of the $k^{th}$ register for $k\\\in \\\{0,1,..,r\\\}$.
- $e$: Random key of length $n+s$.
- $c_1$: Random key for selecting the coset from $C_1$.
- $C_1$: Classical linear code for correcting bit flip errors.
- $C_2$: Classical linear code for performing privacy amplification.
- $y$: XORed product of $e$ and $m_k$s.
- $z$: Random string from the coset $y$ selected from $C_1/C_2^{\\\perp}$.
- $N$: Bit length of $z$.
- $b$: Random key of length $N$.
Properties
- It uses up more than twice as much key as a classical one-time pad but the key can be partially reused upon successful transmission. The scheme can also be used to regenerate the keys itself.
- The protocol can be used for QKD with some slight modifications.
Technical Description
Pre-shared key $(k,e,c_{1},b)$ is established.
Encoding
- Divide the $n$-bit message into $r$ groups of $s$ bits.
- Define a polynomial $f$ of degree $r$ whose first $r$ coefficients are the registers $m_{0},m_{1},\\\ldots ,m_{r-1}$ of the $n$-bit message.
- The constant term, $m_{r}$, is chosen such that $f(k)=0$.
- XOR the string $(m_{0},\\\ldots ,m_{r})$ with $e$, producing a new classical string $y$ of length $n+s$ bits.
- Consider the particular coset of the classical error-correcting code $C_{1}$ given by the syndrome $c_{1}$.
- Pick the string $z$ at random so that its coset of $C_{1}/C_{2}^{\\\perp }$ in the coset $c_{1}$ of $C_{1}$ corresponds to $y$.
- Transmit $N$ qubits after operations based on $b$ such that:
- When the $i^{th}$ bit of $b$ is $0$, transmit the $i^{th}$ bit of $z$ in the computational basis.
- When the $i^{th}$ bit of $b$ is $1$, transmit the $i^{th}$ bit of $z$ in the Hadamard basis.
Decoding
- Upon receiving the $N$ qubits, measure in the computational basis if the $i^{th}$ bit of $b$ is $0$, else in the Hadamard basis the $i^{th}$ bit of $b$ is $1$, to get $z$.
- Calculate the parity checks of the classical code $C_{1}^{\\\perp }$. If they are not equal to the string $c_{1}$, there are errors in the state, which can be corrected using the standard decoding map.
- Evaluate the parity checks of $C_{2}/C_{1}^{\\\perp }$, producing a $n+s$-bit string $y$.
- XOR $y$ with $e$, producing a new string $(m_{0},\\\ldots ,m_{r})$.
- Consider the $(m_{0},\\\ldots ,m_{r})$ as the coefficients of a polynomial $f$. Accept only if $f(k)=0$.
Experimental Implementations
No content has been added to this section, yet!
Related Codes
Description Link An implementation of the basic steps required in the uncloneable encryption protocol. It performs the classical part of the algorithm. Link Further Information
No content has been added to this section, yet!
References
- Gottesman, Daniel. “Uncloneable encryption.” arXiv preprint quant-ph/0210062 (2002).