IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0336039.html

Enhancing healthcare consensus mechanism - A reputation integrated variant of PBFT (BR-PBFT)

Author

Listed:
  • Shamsudeen Sajna
  • Manu J Pillai
  • Ginu Rajan

Abstract

In the rapidly evolving healthcare landscape, adopting blockchain technology requires an optimal consensus mechanism to ensure security, efficiency, reliability, and scalability. This paper examines various consensus methods, including PoW (Proof of Work), PBFT(Practical Byzantine Fault Tolerance), its variants, and node reputation management techniques such as the Beta Reputation Model and EigenTrust score, to determine the most suitable approach for healthcare applications. Among the analyzed algorithms, SBFT (Scalable Byzantine Fault Tolerance) emerges as a strong contender due to its fault tolerance and effectiveness in large-scale environments. Building on these insights, we introduce a light weight consensus BR-PBFT(Beta Reputation integreted PBFT), a novel PBFT variant that integrates a beta reputation scoring system and Verifiable random functions (VRF) for more reliable node selection. This enhancement strengthens trust in the network and mitigates malicious behavior by dynamically adjusting node selection and consensus processes based on reputation metrics. Preliminary evaluations indicate that our PBFT variant built on reputation significantly improves CPU consumption and memory efficiency, offering improved reliability, scalability, and performance. These advancements position BR-PBFT as a promising state-of-the-art solution for secure and efficient blockchain implementations in healthcare.

Suggested Citation

  • Shamsudeen Sajna & Manu J Pillai & Ginu Rajan, 2025. "Enhancing healthcare consensus mechanism - A reputation integrated variant of PBFT (BR-PBFT)," PLOS ONE, Public Library of Science, vol. 20(11), pages 1-27, November.
  • Handle: RePEc:plo:pone00:0336039
    DOI: 10.1371/journal.pone.0336039
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0336039
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0336039&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0336039?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0336039. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.