Veridical Ranking of Inconsistent Responses in Blockchain Consensus Process Using Proof-of-Congruity Consensus Scheme

Omoniyi Wale Salami, Ore-Ofe Ajayi, Emmanuel Adewale Adedokun, Busayo Adebiyi

Abstract


Consensus mechanisms provide the security in blockchain for protecting data. The security requirements for a data use case determines the design of consensus mechanism that will be suitable for the blockchain. Forensic investigation requires intact integrity of data and extraction of relevant facts that is adequate for making decisions. Proof-of-Congruity consensus mechanism was proposed for preserving data integrity and fidelity. The Original Proof-of-Congruity consensus mechanism did not review the differences in validators responses when there is no collective consensus. It only award consistency points to validators when all of them agreed on a value. This paper proposed a method for evaluating veridical correlations between different validators’ responses for determining the optimal response and rank the validators accordingly. This will provide a means for compensating correct validators and penalizing bad validators appropriately. It will also provide an investigator with a means for determining how reliable a dataset is and the possible veracity of facts that may be extracted from it.

Full Text:

PDF

References


B. Lashkari and P. Musilek, “A Comprehensive Review of Blockchain Consensus Mechanisms,” in IEEE Access, 2021, vol. 9, pp. 43620–43652. doi: 10.1109/ACCESS.2021.3065880.

C. Zhang, C. Wu, and X. Wang, “Overview of blockchain consensus mechanism,” ACM Int. Conf. Proceeding Ser., pp. 7–12, 2020, doi: 10.1145/3404512.3404522.

F. Ma et al., “LOKI: State-Aware Fuzzing Framework for the Implementation of Blockchain Consensus Protocols,” 30th Annu. Netw. Distrib. Syst. Secur. Symp. NDSS 2023, no. March, 2023, doi: 10.14722/ndss.2023.24078.

H. Anwar, “Distributed Ledger Technology: Where Technological Revolution Starts,” 101blockchains.com, 2019. https://101blockchains.com/distributed-ledger-technology-dlt/#3 (accessed Aug. 02, 2024).

F. Kahmann, F. Honecker, J. Dreyer, M. Fischer, and R. Tönjes, “Performance Comparison of Directed Acyclic Graph-Based Distributed Ledgers and Blockchain Platforms,” Computers, vol. 12, no. 257, 2023, doi: 10.3390/computers12120257.

L. Amherd, S.-N. Li, and C. J. Tessone, “Centralised or Decentralised? Data Analysis of Transaction Network of Hedera Hashgraph,” arXiv e-print, vol. arXiv:2311, no. 1, pp. 1–15, 2023, doi: 10.5195/LEDGER.20XX.XXX.

R. T. Frahat, M. M. Monowar, and S. M. Buhari, “Secure and Scalable Trust Management Model for IoT P2P Network,” in 2nd International Conference on Computer Applications and Information Security, ICCAIS 2019, 2019, pp. 1–6. doi: 10.1109/CAIS.2019.8769467.

D. G. Bundi, S. M. Mutua, and S. M. Karume, “Underlying Consensus Algorithms, Architectures and Data Structures in Distributed Ledger Technologies Applications,” ICONIC Res. Eng. JOURNALS, vol. 7, no. 7, pp. 449–460, 2024.

L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Program. Lang. Syst., vol. 4, no. 3, pp. 382–401, 1982, doi: 10.1145/357172.357176.

L. Lamport and D. Equipment, “The Part-Time Parliament,” ACM Trans. Comput. Syst., vol. 16, no. 2, pp. 133–169, 1998.

D. Ongaro and J. Ousterhout, “In search of an understandable consensus algorithm,” in Proceedings of the 2014 USENIX Annual Technical Conference, USENIX ATC 2014, 2014, pp. 305–319.

D. Avelãs, H. Heydari, E. Alchieri, T. Distler, and A. Bessani, “Probabilistic Byzantine Fault Tolerance (Extended Version),” in ACM Symposium on Principles of Distributed Computing (PODC ’24), 2024, vol. 1, no. 1, pp. 1–29. doi: 10.1145/3662158.3662810.

S. Duan and Y. Huang, “Byzantine Fault Tolerance with Non-Determinism, Revisited,” Cryptol. ePrint Arch., vol. 2024, no. 134, pp. 1–16, 2024.

D. S. Antunes et al., “Alea-BFT : Practical Asynchronous Byzantine Fault Tolerance,” in Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024, pp. 313–328.

S. Duan et al., “Dashing and Star: Byzantine Fault Tolerance with Weak Certificates,” in EuroSys ’24: Proceedings of the Nineteenth European Conference on Computer Systems, 2024, pp. 250–264. doi: 10.1145/3627703.3650073.

M. M. Jalalzai, J. Niu, C. Feng, and F. Gai, “Fast-HotStuff: A Fast and Robust BFT Protocol for Blockchains,” IEEE Trans. Dependable Secur. Comput., vol. 20, no. 4, pp. 1–17, 2023, doi: 10.1109/TDSC.2023.3308848.

S. Duan, S. Peisert, and K. N. Levitt, “Hbft: Speculative Byzantine fault tolerance with minimum cost,” IEEE Trans. Dependable Secur. Comput., vol. 12, no. 1, pp. 58–70, Jan. 2015, doi: 10.1109/TDSC.2014.2312331.

C. M and L. B, “Practical byzantine fault tolerance and proactive recovery,” ACM Trans. Comput. Syst., vol. 20, no. 4, pp. 398–461, 2002.

R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong, “Zyzzyva: Speculative Byzantine Fault Tolerance,” ACM Trans. Comput. Syst., vol. 27, no. 4, pp. 7:1-7:39, Jan. 2009, doi: 10.1145/1658357.1658358.

J. Skrzypczak, … F. S.-I. T. on, and U. 2020, “RMWPaxos: fault-tolerant in-place consensus sequences,” IEEE Trans. PARALLEL Distrib. Syst., vol. 31, no. 10, pp. 2392–2405, 2020.

Y. A. Liu, S. Chand, and S. D. Stoller, “Moderately complex paxos made simple: High-level executable specification of distributed algorithms,” PervasiveHealth Pervasive Comput. Technol. Healthc., no. March, 2019, doi: 10.1145/3354166.3354180.

R. Van Renesse and D. Altinbuken, “Paxos made moderately complex,” ACM Comput. Surv., vol. 47, no. 3, pp. 1–36, 2015, doi: 10.1145/2673577.

M. Javad, A. Sujaya, M. Divyakant, A. Amr, and E. Abbadi, “Seemore: A fault-tolerant protocol for hybrid cloud environments,” in IEEE 36th International Conference on Data Engineering (ICDE), 2020, pp. 1345–1356.

S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Decentralized Bus. Rev., vol. 21260, pp. 1–9, 2008.

G. Wood, “Ethereum: a secure decentralised generalised transaction ledger,” Ethereum Proj. yellow Pap., vol. 151, pp. 1–32, 2014.

P. Vasin, “BlackCoin ’ s Proof-of-Stake Protocol v2,” whitpaper, 2014. https://blackcoin.org/blackcoin-pos-protocol-v2-whitepaper.pdf (accessed Apr. 07, 2022).

N. Lasla, L. Al-Sahan, M. Abdallah, and M. Younis, “Green-PoW: An energy-efficient blockchain Proof-of-Work consensus algorithm,” Comput. Networks, vol. 214, no. 109118, pp. 1–11, 2020, doi: 10.1016/j.comnet.2022.109118.

A. Yazdinejad, G. Srivastava, R. M. Parizi, A. Dehghantanha, H. Karimipour, and S. R. Karizno, “SLPoW: Secure and Low Latency Proof of Work Protocol for Blockchain in Green IoT Networks,” in 2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring), 2020, pp. 1–5. doi: 10.1109/VTC2020-Spring48590.2020.9129462.

M. Saad, Z. Qin, K. Ren, D. H. Nyang, and D. Mohaisen, “E-PoS: Making Proof-of-Stake Decentralized and Fair,” IEEE Trans. Parallel Distrib. Syst., vol. 32, no. 8, pp. 1961–1973, 2021, doi: 10.1109/TPDS.2020.3048853.

I. Bentov, C. Lee, A. Mizrahi, and M. Rosenfeld, “Proof of Activity: Extending Bitcoin’s Proof of Work via Proof of Stake,” ACM SIGMETRICS Perform. Eval. Rev., vol. 42, no. 3, pp. 34–37, 2014, doi: 10.1145/2695533.2695545.

S. Costantini, G. De Gasperis, and R. Olivieri, Digital forensics and investigations meet artificial intelligence, Mathematic. Springer Nature Switzerland AG, 2019. doi: 10.1007/s10472-019-09632-y.

O. W. Salami, M. B. Abdulrazaq, E. A. Adedokun, and B. Yahaya, “CICM: A Collaborative Integrity Checking Blockchain Consensus Mechanism for Preserving the Originality of Data the Cloud for Forensic Investigation,” Kinet. Game Technol. Inf. Syst. Comput. Network, Comput. Electron. Control, vol. 7, no. 1, pp. 55–68, Feb. 2022, doi: 10.22219/KINETIK.V7I1.1378.

O. W. Salami, M. B. Abdulrazaq, Y. Basira, and B. Adebiyi, “Proof-of-Congruity Consensus Scheme: A Blockchain Consensus Mechanism for Mining Potential Data for Forensic Analysis,” Covenant J. Informatics Commun. Technol., vol. 12, no. 1, pp. 1–15, 2024.

W. Salami, Omoniyi, B. Abdulrazaq, Muhammad, A. Adedokun, Emmanuel, B. Yahaya, and A. Umar, “Blockchain Collaborative Integrity Verification Consensus Mechanism for Avoiding Repudiation in E-Voting System.”

F. Daryabar, A. Dehghantanha, and K.-K. R. Choo, “Cloud storage forensics: MEGA as a case study,” Aust. J. Forensic Sci., vol. 49, no. 3, pp. 344–357, May 2017, doi: 10.1080/00450618.2016.1153714.

J. Schneider, J. Wolf, and F. Freiling, “Tampering with Digital Evidence is Hard: The Case of Main Memory Images,” Digit. Investig., vol. 32, no. (2020) 300924, pp. S1–S9, 2020, doi: 10.1016/j.fsidi.2020.300924.

L. Pasquale, D. Alrajeh, C. Peersman, T. Tun, B. Nuseibeh, and A. Rashid, “Towards forensic-ready software systems,” in ICSE-NIER’18: 2018 ACM/IEEE 40th International Conference on Software Engineering: New Ideas and Emerging Results Towards, 2018, pp. 9–12. doi: 10.1145/3183399.3183426.

L. Floridi, “Artificial Intelligence, Deepfakes and a Future of Ectypes,” Philos. Technol., vol. 31, no. 3, pp. 317–321, 2018, doi: 10.1007/s13347-018-0325-3.

C. B. Mueller, L. C. Kirkpatrick, and L. Richter, “§7.7 Reliability Standard (Daubert, Frye),” Washington, DC, 2018–71, 2018. doi: 10.2139/ssrn.3277067.

S. Qian, Y. Shi, H. Wu, J. Liu, and W. Zhang, “An adaptive enhancement algorithm based on visual saliency for low illumination images,” Appl. Intell., vol. 52, no. 2, pp. 1770–1792, 2022, doi: 10.1007/s10489-021-02466-4.

A. Buccella and A. Chemero, “Reconsidering perceptual constancy,” Philos. Psychol., vol. 35, no. 7, pp. 1057–1071, 2022, doi: 10.1080/09515089.2022.2038122.


Refbacks

  • There are currently no refbacks.