IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0312817.html
   My bibliography  Save this article

SRFACS: A secure and robust framework for anonymous communication systems

Author

Listed:
  • Daxin Zhu
  • Jiazhi Tu
  • Danlin Cai
  • Tianyu Jiang
  • Jianbing Xiahou
  • Yusi Chen
  • Chao Liu

Abstract

Anonymous communication is crucial for preserving user privacy in various applications, such as anonymous browsing, secure online payments, and electronic voting. However, current systems face significant challenges related to robustness, fault tolerance, and efficient communication management. This paper introduces SRFACS (Secure and Robust Framework for Anonymous Communication Systems), designed to address these issues by integrating advanced cryptographic techniques with a structured communication framework. Traditional anonymous communication systems usually lack sufficient fault tolerance, making them vulnerable to node failures, especially in asynchronous environments. In order to overcome these limitations and ensure that the system can keep running in the event of node failure (especially in an asynchronous environment), SRFACS integrates an improved asynchronous Byzantine Fault Tolerant (ABFT) protocol. We use this protocol to expand the traditional single communication node into a structured node group, and handle up to (n − 1)/3 faulty nodes in these groups, so as to enhance fault tolerance and maintain continuous operation. To efficiently manage inter-group communication, SRFACS utilizes leader nodes to coordinate and streamline the communication processes. To mitigate the risks associated with leader failures, we have implemented an efficient leader change protocol that promptly replaces defective leaders, ensuring uninterrupted system performance. Additionally, to prevent erroneous leader actions from compromising the system, we have introduced an advanced multi-signature scheme. This approach secures communication by requiring multiple signatures for verification processes. Furthermore, we have implemented a reputation incentive mechanism to encourage nodes to maintain optimal performance and avoid malicious behavior. This mechanism evaluates nodes according to their past activities and reliability to achieve dynamic updates of SRFACS node groups. We have conducted rigorous security analyses and component performance evaluations of SRFACS, further confirming its potential as a promising secure communication solution.

Suggested Citation

  • Daxin Zhu & Jiazhi Tu & Danlin Cai & Tianyu Jiang & Jianbing Xiahou & Yusi Chen & Chao Liu, 2024. "SRFACS: A secure and robust framework for anonymous communication systems," PLOS ONE, Public Library of Science, vol. 19(12), pages 1-25, December.
  • Handle: RePEc:plo:pone00:0312817
    DOI: 10.1371/journal.pone.0312817
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0312817?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:0312817. 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.