广东工业大学 计算机学院,广东,广州,510006
陈冰儿(1992–),女,硕士研究生,主要研究方向为量子计算、量子信息、区块链
王帮海(1974–),男,教授,主要研究方向为量子计算、量子信息、量子机器学习,E-mail:bhwang@gdut.edu.cn
网络首发:2021-03-10,
纸质出版:2021
移动端阅览
陈冰儿, 王帮海, 劳南新. 基于DPoS扩展的量子加密区块链[J]. 广东工业大学学报, 2021, 38(2): 34-38.
Chen Bing-er, Wang Bang-hai, Lao Nan-xin. A Quantum-encrypted Blockchain Based on Delegated Proof of Stake (DPoS) Extension[J]. 2021, 38(2): 34-38.
陈冰儿, 王帮海, 劳南新. 基于DPoS扩展的量子加密区块链[J]. 广东工业大学学报, 2021, 38(2): 34-38. DOI: 10.12052/gdutxb.200068.
Chen Bing-er, Wang Bang-hai, Lao Nan-xin. A Quantum-encrypted Blockchain Based on Delegated Proof of Stake (DPoS) Extension[J]. 2021, 38(2): 34-38. DOI: 10.12052/gdutxb.200068.
区块链技术的安全性依赖基于数学计算单向困难性的加密算法
其在量子计算机的指数级加速下暴露出脆弱性。虽然已有一系列抗量子攻击区块链被提出
但它们往往建设成本高昂
不利于普及推广。对此
提出了基于委托权益证明(Delegated Proof of Stake
DPoS)扩展的量子加密区块链
相比于Kiktenko等的原始量子安全区块链
所需建设的量子密钥分发(Quantum Key Distribution
QKD)信道数量由
$ O({n}^{2}) $
<
img text_id='M1' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M1.jpg'>
降低到
$ O\left(n\right) $
<
img text_id='M2' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M2.jpg'>
所需进行的通信轮数上限由
$ n/3+1 $
<
img text_id='M3' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M3.jpg'>
降低为
$ k/3+1 $
<
img text_id='M4' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M4.jpg'>
显著降低了量子加密区块链的建设成本
提升了其运行
效率与拓展能力。
The security of blockchain technology
depending on the encryption algorithms based on the one-way mathematical calculation difficulty
is vulnerable to the attack under exponential acceleration of quantum computers. Although a series of anti-quantum attack blockchains have been proposed
they are often too expensive to build and are not conducive to popularization. In this regard
a quantum-encrypted blockchain based on delegated proof of stake (DPoS) extension is proposed. Comparing with the original quantum-secured blockchain proposed by Kiktenko
the number of quantum key distribution (QKD) channels needed to be built is reduced from
$O({n}^{2})$
<
img text_id='M5' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M5.jpg'>
to
$ O\left(n\right) $
<
img text_id='M6' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M6.jpg'>
and the maximum number of communication rounds required is reduced from
$ n/3+1 $
<
img text_id='M7' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M7.jpg'>
to
$ k/3+1 $
<
img text_id='M8' class='formula-img' style='display:none;' src='gdgydxxb-38-2-34_M8.jpg'>
. It significantly reduces the construction cost
and improves the operation efficiency and expansion ability.
PEDRO F. Understanding bitcoin: cryptography, engineering, and economics[M]. Hoboken: Wiley, 2014.
EXTANCE A. The future of cryptocurrencies: Bitcoin and beyond [J]. Nature, 2015, 526(7571): 21-23.
MELANIE S. Blockchain: blueprint for a new economy [M]. California: O'Reilly, 2015.
WITTE J. The blockchain: a gentle introduction[J ] . Social Science Research Network, 2016. https://dx.doi.org/10.2139/ssrn.2887567.
吴根, 资剑, 杨涛, 等. 量子计算技术发展现状与趋势[J]. 科技中国, 2017(9): 1-4.
SCHNEIER B. Applied cryptography: protocols, algorithms, and source code in C [M]. 2nd ed. New York: John Wiley Sons, Inc, 1995.
GROVER L K. A framework for fast quantum mechanical algorithms [C]//Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. New York: ACM, 1998: 53-62.
BOYER M, BRASSARD G, HOEYER P, et al . Tight bounds on quantum searching [J ] . Protein Science, 1998, 46(4-5): 493-505.
SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.
SHOR P W. Algorithms for quantum computation: discrete logarithms and factoring [C]//Proceedings 35th Annual Symposium on Foundations of Computer Science. Santa Fe, NM, USA: IEEE Computer Society, 1994: 124-134.
PROOS J, ZALKA C. Shor's discrete logarithm quantum algorithm for elliptic curves [J]. Quantum Information Computation, 2003, 3(4): 317-344.
ARUTE F, ARYA K, BABBUSH R, et al . Quantum supremacy using a programmable superconducting processor [J ] . Nature, 2019, 574: 505-510.
DIAMANTI E, LO H, QI B, et al. Practical challenges in quantum key distribution[J ] . npj Quantum Information, 2016, 2, 16025. DOI: 10.1038/npjqi.2016.25 .
GISIN N, GREGOIRE R, TITTEL W, et al . Quantum cryptography [J ] . Review of Modern Physics, 2002, 74(1): 145-195.
BENNETT C H, BRASSARD G. An update on quantum cryptography [C]//Workshop on the Theory and Application of Cryptographic Techniques. Berlin: Springer-Verlag, 1985: 475-480.
NIELSEN M A, CHUANG I L. Quantum computation and quantum information [J]. Mathematical Structures in Computer Science, 2007, 17(6): 558-559.
KIKTENKO E O, POZHAR N O, ANUFRIEV M N, et al. Quantum-secured blockchain[J]. Quantum Physics, 2018. arXiv: 1705.09258v3.
KIKTENKO E O, POZHAR N O, DUPLINSKIY A V, et al . Demonstration of a quantum key distribution network in urban fibre-optic comm unication lines [J ] . Quantum Electronics, 2017, 47(9): 798-802.
GAO Y, CHEN X, SUN Y, et al . A secure cryptocurrency scheme based on post-quantum blockchain [J ] . IEEE Access, 2018, 6: 27205-27213.
YIN W, WEN Q, LI W, et al . An anti-quantum transaction authentication approach in blockchain [J ] . IEEE Access, 2018, 6: 5393-5401.
WILSON A A T, RON S, AMIN S, et al. Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (Lattice RingCT v1.0) [C]//Australasian Conference on Information Security Privacy. Cham: Springer, 2018: 558-576.
RAJAN D, VISSER M. Quantum blockchain using entanglement in time [J]. Quantum Reports, 2019, 1(1): 3-11.
LAMPORT L, SHOSTAK R, PEASE M, et al . The byzantine generals problem [J ] . ACM Transactions on Programming Languages Systems, 1982, 4(3): 382-401.
WEI S, DAI K M. An analysis of blockchain applications in financial scenarios and an exploration of enterprise software architecture of blockchain as a service (BaaS) [J]. Journal of Guangdong University of Technology, 2020, 37(2): 1-10.
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621