Delegated Proof of Accessibility (DPoAC): A Novel Consensus Protocol for Blockchain Systems

被引:14
作者
Kaur, Manpreet [1 ,2 ]
Gupta, Shikha [1 ]
Kumar, Deepak [3 ]
Verma, Chaman [4 ]
Neagu, Bogdan-Constantin [5 ]
Raboaca, Maria Simona [6 ]
机构
[1] Chandigarh Univ, Dept Comp Sci & Engn, Univ Inst Engn, Mohali 140413, Punjab, India
[2] Guru Nanak Dev Engn Coll, Dept Comp Sci & Engn, Ludhiana 141006, Punjab, India
[3] Chandigarh Univ, Apex Inst Technol, Mohali 140413, Punjab, India
[4] Eotvos Lorand Univ, Fac Informat, Dept Media & Educ Informat, H-1053 Budapest, Hungary
[5] Gheorghe Asachi Tech Univ Iasi, Dept Power Engn, Iasi 700050, Romania
[6] Natl Res & Dev Inst Cryogen & Isotop Technol ICSI, Uzinei St,4,POB 7 Raureni, Ramnicu Valcea 240050, Romania
关键词
blockchain; consensus; DPoAC; secret sharing; IPFS; IoT; IIoT; INTERNET;
D O I
10.3390/math10132336
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
As the backbone of every blockchain application, the consensus protocol is impacted by numerous risks, namely resource requirements and energy consumption, which limit the usage of blockchain. Applications such as IoT/IIoT cannot use these high-cost consensus methods due to limited resources. Therefore, we introduce Delegated Proof of Accessibility (DPoAC), a new consensus technique that employs secret sharing, PoS with random selection, and an interplanetary file system (IPFS).DPoAC is decomposed into two stages. During the initial stage, a secret is generated by a randomly chosen super node and divided into n shares. These shares are encrypted and stored in different n nodes on the IPFS network. The nodes will compete to access these shareholders to reconstruct the secret. The winning node will be awarded block generation rights. PoS with random selection is used in the second stage to compute the appropriate hash value and construct a block with valid transactions. In this novel approach, a node with few computational resources and small stakes can still obtain block generation rights by providing access to secret shares and reconstructing the secret, making the system reasonably fair. We qualitatively analyze and compare our scheme based on performance parameters against existing mainstream consensus protocols in the context of IoT/IIoT networks.
引用
收藏
页数:17
相关论文
共 39 条
[1]   Distributed Hybrid Double-Spending Attack Prevention Mechanism for Proof-of-Work and Proof-of-Stake Blockchain Consensuses [J].
Akbar, Nur Arifin ;
Muneer, Amgad ;
ElHakim, Narmine ;
Fati, Suliman Mohamed .
FUTURE INTERNET, 2021, 13 (11)
[2]  
Alkhazaali A.H., 2020, P 2020 INT C HUM COM, P1
[3]  
Andrian Y., 2019, APPL SCI-BASEL, V9, P5024, DOI [10.3390/app9235024, DOI 10.3390/app9235024]
[4]   Blockchain based hierarchical semi-decentralized approach using IPFS for secure and efficient data sharing [J].
Athanere, Smita ;
Thakur, Ramesh .
JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (04) :1523-1534
[5]  
Bacis E., 2021, P 16 INT C AVAILABIL
[6]   A survey of blockchain consensus algorithms performance evaluation criteria [J].
Bamakan, Seyed Mojtaba Hosseini ;
Motavali, Amirhossein ;
Bondarti, Alireza Babaei .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 154
[7]  
Banafa A., 2017, IEEE INTERNET THINGS
[8]  
Benet J., 2014, IPFS-Content Addressed, Versioned, P2P File System
[9]   On the Local Leakage Resilience of Linear Secret Sharing Schemes [J].
Benhamouda, Fabrice ;
Degwekar, Akshay ;
Ishai, Yuval ;
Rabin, Tal .
JOURNAL OF CRYPTOLOGY, 2021, 34 (02)
[10]  
Chen YL, 2017, IEEE INT CONF BIG DA, P2652, DOI 10.1109/BigData.2017.8258226