Editing Quantum Coin
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
This [http://users.math.cas.cz/~gavinsky/papers/QuMoClaV.pdf example protocol] | This [http://users.math.cas.cz/~gavinsky/papers/QuMoClaV.pdf example protocol] implements Quantum Money which is a unique object generated by a Trusted Third Party (TTP). It is then circulated among untrusted clients (Transferability). Each client should be able to prove the authenticity of his owned quantum money to a verifier. On the other hand, an adversary must fail in counterfeiting the quantum money with overwhelmingly high probability (Unforgeability). <br> | ||
'''Tags | '''Tags''': Multiparty, Quantum Enhanced Classical functionality, prepare (bank) and measure (client) | ||
Line 12: | Line 9: | ||
* '''Quantum coin Verification''' - To verify a quantum coin through classical communication with the TTP, its holder sends the identification number of the quantum coin to the TTP. Then, the TTP and the coin holder exchange some classical information for choosing some quantum registers. The coin holder measures the chosen registers and sends their corresponding classical information to the TTP. The TTP verifies the authenticity of the coin by the secret information he possesses. | * '''Quantum coin Verification''' - To verify a quantum coin through classical communication with the TTP, its holder sends the identification number of the quantum coin to the TTP. Then, the TTP and the coin holder exchange some classical information for choosing some quantum registers. The coin holder measures the chosen registers and sends their corresponding classical information to the TTP. The TTP verifies the authenticity of the coin by the secret information he possesses. | ||
==Notations== | ==Notations== | ||
* <math>HMP_4</math>-states: <math>|\alpha(x)\rangle=\dfrac{1}{2}\sum_{1\leq i\leq4}(-1)^{x_i}|i\rangle</math>, <math>x\in\{0, 1\} | * <math>HMP_4</math>-states: <math>|\alpha(x)\rangle=\dfrac{1}{2}\sum_{1\leq i\leq4}(-1)^{x_i}|i\rangle</math>, <math>x\in\{0, 1\}</math> | ||
==Requirements== | ==Requirements== | ||
*Network stage: [[:Category: Quantum Memory Network Stage|quantum memory network]][[Category:Quantum Memory Network Stage]]. | *Network stage: [[:Category: Quantum Memory Network Stage|quantum memory network]][[Category:Quantum Memory Network Stage]]. | ||
== Properties == | == Properties == | ||
Line 42: | Line 25: | ||
**Secure against an adversary who uses adaptive “attempted verifications” in order to collect information about a coin. | **Secure against an adversary who uses adaptive “attempted verifications” in order to collect information about a coin. | ||
== | == Pseudocode == | ||
'''Stage 1: Quantum coin generation'''<br> | '''Stage 1: Quantum coin generation'''<br> | ||
''Input'': A secret record consists of <math>k</math> entries <math>x_1, . . . , x_k</math>,<math> x_i\in \{0,1\}^4</math><br> | ''Input'': A secret record consists of <math>k</math> entries <math>x_1, . . . , x_k</math>,<math> x_i\in \{0,1\}^4</math><br> | ||
Line 59: | Line 42: | ||
* The holder sends the identification number of the quantum coin to the TTP. | * The holder sends the identification number of the quantum coin to the TTP. | ||
* The TTP chooses uniformly at random a set <math>L_{bn}\subset[k]</math> of size <math>t</math>, and sends it to the coin holder. | * The TTP chooses uniformly at random a set <math>L_{bn}\subset[k]</math> of size <math>t</math>, and sends it to the coin holder. | ||
* The holder consults with | * The holder consults with P and chooses uniformly at random a set <math>L_{hl} \subset L_{bn}</math> consisting of <math>2t/3</math> yet unmarked positions. He sends <math>L_{hl}</math> to the bank and marks in <math>P</math> all the elements of <math>L_{hl}</math> as used. | ||
* The TTP chooses at random <math>2t/3</math> values <math>m_i \in\{{0, 1}\}</math>, one for each <math>i \in L_{hl}</math> , and sends them to the coin holder. | * The TTP chooses at random <math>2t/3</math> values <math>m_i \in\{{0, 1}\}</math>, one for each <math>i \in L_{hl}</math> , and sends them to the coin holder. | ||
* The holder measures the quantum registers corresponding to the elements of <math>L_{hl}</math> in order to produce <math>2t/3</math> pairs <math>(a_i, b_i)</math> | * The holder measures the quantum registers corresponding to the elements of <math>L_{hl}</math> in order to produce <math>2t/3</math> pairs <math>(a_i, b_i)</math>, such that <math>(x_i,m_i, a_i, b_i)\in HMP_4</math> for all <math>i \in L_{hl}</math>. He sends the list of <math>(a_i, b_i)</math>s to the TTP. | ||
* The TTP checks whether <math>(x_i,m_i, a_i, b_i)\in HMP_4</math> for all <math>i \in L_{hl}</math>, in which case it confirms validity of the quantum coin. Otherwise, the coin is declared to be a counterfeit. | * The TTP checks whether <math>(x_i,m_i, a_i, b_i)\in HMP_4</math> for all <math>i \in L_{hl}</math>, in which case it confirms validity of the quantum coin. Otherwise, the coin is declared to be a counterfeit. | ||
<div style='text-align: right;'>''*contributed by Mashid Delavar''</div> | |||
==Further Information== | ==Further Information== | ||
Gavinsky, Dmitry. "Quantum money with classical verification." 2012 IEEE 27th Conference on Computational Complexity. IEEE, 2012, Available at: http://users.math.cas.cz/~gavinsky/papers/QuMoClaV.pdf | Gavinsky, Dmitry. "Quantum money with classical verification." 2012 IEEE 27th Conference on Computational Complexity. IEEE, 2012, Available at: http://users.math.cas.cz/~gavinsky/papers/QuMoClaV.pdf | ||