Semi-quantum Money

Semi-quantum Money
复制标题

半量子货币

DOI:
--
复制
发表时间:
2019
期刊:
Conference on Advances in Financial Technologies
影响因子:
--
通讯作者:
Or Sattath
Or Sattath
中科院分区:
--
文献类型:
--
作者:
Roy Radian;Or Sattath

文献摘要

参考文献

被引文献

相似文献

量子货币允许银行铸造量子货币状态,这些状态可以在以后进行验证并且无法伪造。通常,这需要量子通信基础设施来执行交易。 Gavinsky(CCC 2012)引入了经典可验证量子货币的概念,它允许通过经典通信进行验证。在这项工作中,我们引入了经典铸币的概念,并将其与经典验证相结合,引入了半量子货币。半量子货币是第一种允许通过完全经典通信和完全经典银行进行交易的量子货币。这项工作的特点是构建公共依赖记忆的半量子货币方案和私有无记忆半量子货币方案。公共建筑基于 Zhandry 和 Coladangelo 的作品,私人建筑基于 Brakerski 等人提出的噪声活板门无爪函数 (NTCF) 的概念。 (FOCS 2018)。在技​​术方面,我们的主要贡献是 NTCF 的完美并行重复定理。
Quantum money allows a bank to mint quantum money states that can later be verified and cannot be forged. Usually, this requires a quantum communication infrastructure to perform transactions. Gavinsky (CCC 2012) introduced the notion of classically verifiable quantum money, which allows verification through classical communication. In this work, we introduce the notion of classical minting and combine it with classical verification to introduce semi-quantum money. Semi-quantum money is the first type of quantum money to allow transactions with completely classical communication and an entirely classical bank. This work features constructions for both a public memory-dependent semi-quantum money scheme and a private memoryless semi-quantum money scheme. The public construction is based on the works of Zhandry  and Coladangelo, and the private construction is based on the notion of noisy trapdoor claw-free functions (NTCF) introduced by Brakerski et al. (FOCS 2018). In terms of technique, our main contribution is a perfect parallel repetition theorem for NTCF.
DOI: 10.1145/3357713.3384304
发表时间: 2020-06
期刊: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
影响因子: --
作者:
Ryan B. Amos;M. Georgiou;A. Kiayias;Mark Zhandry
通讯作者: Ryan B. Amos;M. Georgiou;A. Kiayias;Mark Zhandry