TY - GEN
T1 - Semi-quantum money
AU - Radian, Roy
AU - Sattath, Or
N1 - Publisher Copyright:
© 2019 Copyright held by the owner/author(s). Publication rights licensed to Association for Computing Machinery.
PY - 2019/10/21
Y1 - 2019/10/21
N2 - Private quantum money allows a bank to mint quantum money states that it can later verify, but that no one else can forge. In classically verifiable quantum money – introduced by Gavinsky (CCC 2012) – the verification is done via an interactive protocol between the bank and the user, where the communication is classical, and the computational resources required of the bank are classical. In this work, we consider memoryless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). We call such a construction a private semi-quantum money scheme, since all the requirements from the bank in terms of computation and communication are classical. In terms of techniques, our main contribution is a strong parallel repetition theorem for Noisy Trapdoor Claw Free Functions (NTCF), a notion introduced by Brakerski et al. (FOCS 2018).
AB - Private quantum money allows a bank to mint quantum money states that it can later verify, but that no one else can forge. In classically verifiable quantum money – introduced by Gavinsky (CCC 2012) – the verification is done via an interactive protocol between the bank and the user, where the communication is classical, and the computational resources required of the bank are classical. In this work, we consider memoryless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). We call such a construction a private semi-quantum money scheme, since all the requirements from the bank in terms of computation and communication are classical. In terms of techniques, our main contribution is a strong parallel repetition theorem for Noisy Trapdoor Claw Free Functions (NTCF), a notion introduced by Brakerski et al. (FOCS 2018).
KW - Quantum Money
KW - Quantum cryptography
KW - Semi-Quantum Money
KW - Trapdoor Claw Free Functions
UR - https://www.scopus.com/pages/publications/85074771572
U2 - 10.1145/3318041.3355462
DO - 10.1145/3318041.3355462
M3 - Conference contribution
AN - SCOPUS:85074771572
T3 - AFT 2019 - Proceedings of the 1st ACM Conference on Advances in Financial Technologies
SP - 132
EP - 146
BT - AFT 2019 - Proceedings of the 1st ACM Conference on Advances in Financial Technologies
PB - Association for Computing Machinery, Inc
T2 - 1st ACM Conference on Advances in Financial Technologies, AFT 2019
Y2 - 21 October 2019 through 23 October 2019
ER -