TY - GEN
T1 - Squeezing Network Performance for Secure and Efficient PoW with Better Difficulty Adjustment
AU - Ding, Yuhang
AU - Yang, Zihan
AU - Qin, Bo
AU - Wang, Qin
AU - Zhang, Yanran
AU - Wu, Qianhong
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Difficulty adjustment algorithm (DAA) is critical for PoW blockchain systems in currency issuance, transaction throughput, and blockchain security. Most DAAs concentrate on the unique goal of block-making stability from seconds to minutes. In contrast, we propose a new DAA with the goal of stabilizing orphan rates among the blocks made recently, observing that the orphan rate is more indicative since too high orphan rate indicates poor blockchain security and waste of honest hash power whereas too low orphan rate indicates poor blockchain throughout and wast of time awaiting other blocks. We notice a security defect of the recent orphan-rate DAA (NDSS 2022) in which an attacker may continually create orphan blocks and mislead miners to wrongly increase the difficulty. To fix this defect, our enhanced DAA takes into the orphan rate variation during the historical slots with smooth exponential decay affection on current difficulty adjustment. Theoretical and experimental analyses show that our DAA is effective and secure.
AB - Difficulty adjustment algorithm (DAA) is critical for PoW blockchain systems in currency issuance, transaction throughput, and blockchain security. Most DAAs concentrate on the unique goal of block-making stability from seconds to minutes. In contrast, we propose a new DAA with the goal of stabilizing orphan rates among the blocks made recently, observing that the orphan rate is more indicative since too high orphan rate indicates poor blockchain security and waste of honest hash power whereas too low orphan rate indicates poor blockchain throughout and wast of time awaiting other blocks. We notice a security defect of the recent orphan-rate DAA (NDSS 2022) in which an attacker may continually create orphan blocks and mislead miners to wrongly increase the difficulty. To fix this defect, our enhanced DAA takes into the orphan rate variation during the historical slots with smooth exponential decay affection on current difficulty adjustment. Theoretical and experimental analyses show that our DAA is effective and secure.
KW - Difficulty Adjustment Algorithm
KW - Proof of Work
UR - https://www.scopus.com/pages/publications/85151754464
U2 - 10.1109/TrustCom56396.2022.00121
DO - 10.1109/TrustCom56396.2022.00121
M3 - 会议稿件
AN - SCOPUS:85151754464
T3 - Proceedings - 2022 IEEE 21st International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2022
SP - 874
EP - 881
BT - Proceedings - 2022 IEEE 21st International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 21st IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2022
Y2 - 9 December 2022 through 11 December 2022
ER -