Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
3 results
Search Results
Item Efficient PBFT: A Novel and Efficient Approach to the PBFT Consensus Algorithm(Springer Science and Business Media Deutschland GmbH, 2022) Rao, V.; Shenoy, A.R.; Manjappa, M.Blockchain technology, which is built upon the distributed and decentralised network, suffers from mutual trust among the nodes, and hence, it employs a consensus algorithm to achieve democracy. Consensus algorithm is one of the core elements of blockchain architecture, and a strong, reliable and efficient consensus algorithm is very much required for a blockchain network in order to prevent the intrusion of malicious nodes. A good consensus algorithm drives the blockchain network in the right direction by keeping the malicious transactions off the chain. Thus, in this article, a novel consensus algorithm referred to as efficient practical Byzantine fault tolerance (E-PBFT) is proposed for a private blockchain. E-PBFT finds the winner miner for mining the candidate blocks in an efficient manner which reduces the number of messages exchanged between the nodes. Further, in order to give additional security, a hidden winner miner concept is also included in E-PBFT which hides the winner miner from the adversaries, so that the adversaries will never come to know who is mining the transactions. The theoretical proof for the proposed algorithm is also given whose results are quite convincing when compared to classical PBFT algorithm. The proposed E-PBFT will definitely strengthen the blockchain network by quickly reaching the consensus and by hiding the winner miner, thereby giving additional security. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item A Note on “Secure and Efficient Outsourcing of PCA-Based Face Recognition”(Institute of Electrical and Electronics Engineers Inc., 2025) Rath, S.; Ramalingam, J.; Seal, S.Zhang et al. (2020) exhibit a fundamental mathematical flaw that renders their algorithm infeasible. Additionally, existing outsourcing protocols for PCA-based face recognition suffer from inadequate verification methods, undermining the reliability of these algorithms. © 2005-2012 IEEE.Item An algorithm with feasible inexact projections for solving constrained generalized equations(John Wiley and Sons Ltd, 2025) Regmi, S.; Argyros, I.K.; George, S.The goal of this article is to design a more flexible algorithm than the ones used previously for solving constrained generalized equations. It turns out that the new algorithm even if specialized provides a finer error analysis with advantages: larger radius of convergence; tighter upper error bounds on the distances; and a more precise information on the isolation of the solution. Moreover, the same advantages exist even if the generalized equation reduces to a nonlinear equation. These advantages are obtained under the same computational cost, since the new parameters and majorant functions are special cases of the ones used in earlier studies. Applications complement the theoretical results. © 2024 John Wiley & Sons Ltd.