• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419
Citation: Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419

A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks

Funds: This work was supported by the National Key Research and Development Program of China (2017YFB1400700) and the Key Program of the National Natural Science Foundation of China (U201509214).
More Information
  • Published Date: May 31, 2019
  • For the blockchain fork in blockchain networks can cause the attacker to perform double-spending attack very easily, how to reduce the fork probability is a very important and challenging research issue. Aiming at three problems of current research on optimizing the propagation mechanism of transactions and blocks in blockchain networks to reduce the fork probability: only the propagation delay between adjacent nodes or the total number of routing hops of the propagation process is reduced; the propagation process generates a large number of communication messages; it is based on the assumption that nodes on the propagation path will continue to propagate transactions and blocks, and a propagation mechanism combining an optimal propagation path and incentive (OPPI) in blockchain networks, is proposed to decrease both the total propagation delay and the number of communication messages, which achieves a tradeoff between the propagation efficiency and the propagation cost. Simulation results show that: compared with the existing propagation mechanism of blockchain networks based on Gossip, when the network topology is random graph, scale-free graph, small-world network graph, the number of nodes is 10, 100, 1 000, 10 000 and the degree k is set to 2, 4, 8 respectively, OPPI reduces both the total propagation delay and the number of communication messages generated by the propagation process significantly, specifically, by 99.4% to 99.98% in the total propagation delay and by 99% to 99.1% in the number of communication messages.
  • Related Articles

    [1]He Renhua, Li Bing, Du Yibo, Wang Ying, Li Xiaowei, Han Yinhe. A Survey on Algorithm and Hardware Optimization to LWE-Based Fully Homomorphic Encryption[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202331022
    [2]Bai Lifang, Zhu Yuefei, Li Yongjun, Wang Shuai, Yang Xiaoqi. Research Progress of Fully Homomorphic Encryption[J]. Journal of Computer Research and Development, 2024, 61(12): 3069-3087. DOI: 10.7544/issn1000-1239.202221052
    [3]Zhao Xiufeng, Fu Yu, Song Weitao. Circular Secure Homomorphic Encryption Scheme[J]. Journal of Computer Research and Development, 2020, 57(10): 2117-2124. DOI: 10.7544/issn1000-1239.2020.20200422
    [4]Xu Ming, Fan Yimeng, Jiang Changjun. Time-Varying Underwater Acoustic Channel Based Physical Layer Secret Key Generation Scheme[J]. Journal of Computer Research and Development, 2019, 56(12): 2660-2670. DOI: 10.7544/issn1000-1239.2019.20190040
    [5]Ye Qing, Hu Mingxing, Tang Yongli, Liu Kun, Yan Xixi. Efficient Hierarchical Identity-Based Encryption Scheme from Learning with Errors[J]. Journal of Computer Research and Development, 2017, 54(10): 2193-2204. DOI: 10.7544/issn1000-1239.2017.20170394
    [6]Chen Zhigang, Song Xinxia, Zhao Xiufeng. A Multi-Bit Fully Homomorphic Encryption with Better Key Size from LWE[J]. Journal of Computer Research and Development, 2016, 53(10): 2216-2223. DOI: 10.7544/issn1000-1239.2016.20160431
    [7]Fu Wei, Wu Xiaoping, Ye Qing, Xiao Nong, Lu Xicheng. A Multiple Replica Possession Proving Scheme Based on Public Key Partition[J]. Journal of Computer Research and Development, 2015, 52(7): 1672-1681. DOI: 10.7544/issn1000-1239.2015.20140353
    [8]Liu Mingjie, Wang An. Fully Homomorphic Encryption and Its Applications[J]. Journal of Computer Research and Development, 2014, 51(12): 2593-2603. DOI: 10.7544/issn1000-1239.2014.20131168
    [9]Yang Xiaoyuan, Cai Weiyi, Chen Haibin. Multiple-Authority-Key Functional Encryption: A M-KP-ABE Scheme Based on LMSSS[J]. Journal of Computer Research and Development, 2011, 48(8): 1363-1369.
    [10]Tian Junfeng, Jiao Hongqiang, Li Ning, and Liu Tao. Double Secret Keys and Double Random Numbers Authentication Scheme[J]. Journal of Computer Research and Development, 2008, 45(5): 779-785.
  • Cited by

    Periodical cited type(4)

    1. 张黎,骆春山,谢委员,李蓓蓓. 基于分支混淆算法的隐私数据库自适应加密方法. 计算机与现代化. 2022(03): 43-47 .
    2. 赵武清,王甜,耿新. 基于同态加密的电力业务数据安全研究. 微型电脑应用. 2021(06): 113-116 .
    3. 韩舒艳,努尔买买提·黑力力. 选择性隐藏树型访问结构的CP-ABE方案. 计算机工程. 2020(07): 150-158 .
    4. 刘建华,郑晓坤,郑东,敖章衡. 基于属性加密且支持密文检索的安全云存储系统. 信息网络安全. 2019(07): 50-58 .

    Other cited types(0)

Catalog

    Article views (1711) PDF downloads (713) Cited by(4)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return