{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T22:21:38Z","timestamp":1785882098674,"version":"3.56.0"},"reference-count":39,"publisher":"Public Library of Science (PLoS)","issue":"12","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Fujian Provincial Science and Technology Department","award":["2023H6034 and Grant 2021H6037"],"award-info":[{"award-number":["2023H6034 and Grant 2021H6037"]}]},{"name":"Key Project of Quanzhou Science and Technology Plan","award":["2021C008R"],"award-info":[{"award-number":["2021C008R"]}]},{"name":"sixth batch of Quanzhou City\u2019s introduction of high-level talent team projects \u21162"},{"name":"Fujian Province Project for Young and Middle-Aged Researchers","award":["JAT220827"],"award-info":[{"award-number":["JAT220827"]}]},{"DOI":"10.13039\/501100013254","name":"National College Students Innovation and Entrepreneurship Training Program","doi-asserted-by":"publisher","award":["S202410399024"],"award-info":[{"award-number":["S202410399024"]}],"id":[{"id":"10.13039\/501100013254","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.plosone.org"],"crossmark-restriction":false},"short-container-title":["PLoS ONE"],"abstract":"<jats:p>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 (<jats:italic>n<\/jats:italic> \u2212 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.<\/jats:p>","DOI":"10.1371\/journal.pone.0312817","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:53:01Z","timestamp":1733165581000},"page":"e0312817","update-policy":"https:\/\/doi.org\/10.1371\/journal.pone.corrections_policy","source":"Crossref","is-referenced-by-count":1,"title":["SRFACS: A secure and robust framework for anonymous communication systems"],"prefix":"10.1371","volume":"19","author":[{"given":"Daxin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiazhi","family":"Tu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danlin","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianbing","family":"Xiahou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yusi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5221-7549","authenticated-orcid":true,"given":"Chao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"340","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"issue":"1","key":"pone.0312817.ref001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2133375.2133380","article-title":"Information leaks in structured peer-to-peer anonymous communication systems","volume":"15","author":"P Mittal","year":"2012","journal-title":"ACM Transactions on Information and System Security (TISSEC)"},{"issue":"2","key":"pone.0312817.ref002","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital pseudonyms","volume":"24","author":"DL Chaum","year":"1981","journal-title":"Communications of the ACM"},{"key":"pone.0312817.ref003","doi-asserted-by":"crossref","unstructured":"Dingledine R, Mathewson N, Syverson PF, et al. Tor: The second-generation onion router. In: USENIX security symposium. vol. 4; 2004. p. 303\u2013320.","DOI":"10.21236\/ADA465464"},{"key":"pone.0312817.ref004","unstructured":"Jansen R, Bauer KS, Hopper N, Dingledine R. Methodically Modeling the Tor Network. In: CSET; 2012."},{"key":"pone.0312817.ref005","doi-asserted-by":"crossref","unstructured":"Clarke I, Sandberg O, Wiley B, Hong TW. Freenet: A distributed anonymous information storage and retrieval system. In: Designing privacy enhancing technologies: international workshop on design issues in anonymity and unobservability Berkeley, CA, USA, July 25\u201326, 2000 Proceedings. Springer; 2001. p. 46\u201366.","DOI":"10.1007\/3-540-44702-4_4"},{"issue":"5","key":"pone.0312817.ref006","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1109\/TNET.2015.2478881","article-title":"Protecting multi-lateral localization privacy in pervasive environments","volume":"23","author":"T Shu","year":"2015","journal-title":"IEEE\/ACM transactions on networking"},{"key":"pone.0312817.ref007","doi-asserted-by":"crossref","unstructured":"Chaum D, Das D, Javani F, Kate A, Krasnova A, De Ruiter J, et al. cMix: Mixing with minimal real-time asymmetric cryptographic operations. In: Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings 15. Springer; 2017. p. 557\u2013578.","DOI":"10.1007\/978-3-319-61204-1_28"},{"key":"pone.0312817.ref008","doi-asserted-by":"crossref","unstructured":"Kwon A, Corrigan-Gibbs H, Devadas S, Ford B. Atom: Horizontally scaling strong anonymity. In: Proceedings of the 26th Symposium on Operating Systems Principles; 2017. p. 406\u2013422.","DOI":"10.1145\/3132747.3132755"},{"key":"pone.0312817.ref009","doi-asserted-by":"crossref","unstructured":"Tyagi N, Gilad Y, Leung D, Zaharia M, Zeldovich N. Stadium: A distributed metadata-private messaging system. In: Proceedings of the 26th Symposium on Operating Systems Principles; 2017. p. 423\u2013440.","DOI":"10.1145\/3132747.3132783"},{"key":"pone.0312817.ref010","unstructured":"Kwon A, Lu D, Devadas S. {XRD}: Scalable messaging system with cryptographic privacy. In: 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20); 2020. p. 759\u2013776."},{"key":"pone.0312817.ref011","doi-asserted-by":"crossref","unstructured":"Li T, Wang H, He D, Yu J. Designated-verifier aggregate signature scheme with sensitive data privacy protection for permissioned blockchain-assisted IIoT. IEEE Transactions on Information Forensics and Security. 2023;.","DOI":"10.1109\/TIFS.2023.3297327"},{"key":"pone.0312817.ref012","doi-asserted-by":"crossref","unstructured":"Li M, Ding H, Wang Q, Zhang M, Meng W, Zhu L, et al. Decentralized Threshold Signatures with Dynamically Private Accountability. IEEE Transactions on Information Forensics and Security. 2023;.","DOI":"10.1109\/TIFS.2023.3347968"},{"key":"pone.0312817.ref013","unstructured":"Castro M, Liskov B, et al. Practical byzantine fault tolerance. In: OsDI. vol. 99; 1999. p. 173\u2013186."},{"key":"pone.0312817.ref014","doi-asserted-by":"crossref","unstructured":"Johnson A, Wacek C, Jansen R, Sherr M, Syverson P. Users get routed: Traffic correlation on Tor by realistic adversaries. In: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security; 2013. p. 337\u2013348.","DOI":"10.1145\/2508859.2516651"},{"key":"pone.0312817.ref015","doi-asserted-by":"crossref","unstructured":"Bauer K, McCoy D, Grunwald D, Kohno T, Sicker D. Low-resource routing attacks against Tor. In: Proceedings of the 2007 ACM workshop on Privacy in electronic society; 2007. p. 11\u201320.","DOI":"10.1145\/1314333.1314336"},{"key":"pone.0312817.ref016","doi-asserted-by":"crossref","unstructured":"Danezis G, Dingledine R, Mathewson N. Mixminion: Design of a type III anonymous remailer protocol. In: 2003 Symposium on Security and Privacy, 2003. IEEE; 2003. p. 2\u201315.","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"pone.0312817.ref017","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs H, Ford B. Dissent: accountable anonymous group messaging. In: Proceedings of the 17th ACM conference on Computer and communications security; 2010. p. 340\u2013350.","DOI":"10.1145\/1866307.1866346"},{"key":"pone.0312817.ref018","unstructured":"Wolinsky DI, Corrigan-Gibbs H, Ford B, Johnson A. Dissent in numbers: Making strong anonymity scale. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12); 2012. p. 179\u2013182."},{"key":"pone.0312817.ref019","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","article-title":"The dining cryptographers problem: Unconditional sender and recipient untraceability","volume":"1","author":"D Chaum","year":"1988","journal-title":"Journal of cryptology"},{"key":"pone.0312817.ref020","unstructured":"Chaum D, Carback RT, Clark J, Liu C, Nejadgholi M, Preneel B, et al. VoteXX: A solution to improper influence in voter-verifiable elections. 2022;."},{"key":"pone.0312817.ref021","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A. How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali; 2019. p. 307\u2013328.","DOI":"10.1145\/3335741.3335759"},{"key":"pone.0312817.ref022","doi-asserted-by":"crossref","unstructured":"Lu D, Yurek T, Kulshreshtha S, Govind R, Kate A, Miller A. Honeybadgermpc and asynchromix: Practical asynchronous mpc and its application to anonymous communication. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security; 2019. p. 887\u2013903.","DOI":"10.1145\/3319535.3354238"},{"key":"pone.0312817.ref023","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.jpdc.2022.07.004","article-title":"How to achieve adaptive security for asynchronous BFT?","volume":"169","author":"H Zhang","year":"2022","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"pone.0312817.ref024","doi-asserted-by":"crossref","unstructured":"Guo B, Lu Z, Tang Q, Xu J, Zhang Z. Dumbo: Faster asynchronous bft protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security; 2020. p. 803\u2013818.","DOI":"10.1145\/3372297.3417262"},{"key":"pone.0312817.ref025","doi-asserted-by":"crossref","unstructured":"Liu C, Hou C, Jiang T, Ning J, Qiao H, Wu Y. FACOS: Enabling Privacy Protection Through Fine-Grained Access Control with On-chain and Off-chain System. arXiv preprint arXiv:240603695. 2024;.","DOI":"10.1109\/TIFS.2024.3427311"},{"key":"pone.0312817.ref026","doi-asserted-by":"crossref","unstructured":"Duan S, Zhang H, Sui X, Huang B, Mu C, Di G, et al. Dashing and Star: Byzantine fault tolerance with weak certificates. In: Proceedings of the Nineteenth European Conference on Computer Systems; 2024. p. 250\u2013264.","DOI":"10.1145\/3627703.3650073"},{"key":"pone.0312817.ref027","doi-asserted-by":"crossref","unstructured":"Duan S, Wang X, Zhang H. FIN: practical signature-free asynchronous common subset in constant time. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security; 2023. p. 815\u2013829.","DOI":"10.1145\/3576915.3616633"},{"key":"pone.0312817.ref028","article-title":"CHERUBIM: A secure and highly parallel cross-shard consensus using quadruple pipelined two-phase commit for sharding blockchains","author":"A Liu","year":"2024","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"pone.0312817.ref029","doi-asserted-by":"crossref","first-page":"2276","DOI":"10.1109\/TIFS.2023.3266628","article-title":"A flexible sharding blockchain protocol based on cross-shard byzantine fault tolerance","volume":"18","author":"Y Liu","year":"2023","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"pone.0312817.ref030","article-title":"TFL-DT: A trust evaluation scheme for federated learning in digital twin for mobile networks","author":"J Guo","year":"2023","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"pone.0312817.ref031","article-title":"PPRU: A privacy-preserving reputation updating scheme for cloud-assisted vehicular networks","author":"Z Liu","year":"2023","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"pone.0312817.ref032","doi-asserted-by":"crossref","unstructured":"Boneh D, Drijvers M, Neven G. Compact multi-signatures for smaller blockchains. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer; 2018. p. 435\u2013464.","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"pone.0312817.ref033","article-title":"Locally Verifiable Batch Authentication in IoMT","author":"W Mao","year":"2023","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"pone.0312817.ref034","doi-asserted-by":"crossref","unstructured":"Miller A, Xia Y, Croman K, Shi E, Song D. The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security; 2016. p. 31\u201342.","DOI":"10.1145\/2976749.2978399"},{"key":"pone.0312817.ref035","doi-asserted-by":"crossref","unstructured":"Shen F, Long Y, Liu Z, Liu Z, Liu H, Gu D, et al. A practical dynamic enhanced bft protocol. In: Network and System Security: 13th International Conference, NSS 2019, Sapporo, Japan, December 15\u201318, 2019, Proceedings 13. Springer; 2019. p. 288\u2013304.","DOI":"10.1007\/978-3-030-36938-5_17"},{"key":"pone.0312817.ref036","article-title":"An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures","author":"S Tong","year":"2024","journal-title":"IEEE Access"},{"key":"pone.0312817.ref037","article-title":"RCME: A Reputation Incentive Committee Consensus-Based for Matchmaking Encryption in IoT Healthcare","author":"N Yang","year":"2024","journal-title":"IEEE Transactions on Services Computing"},{"key":"pone.0312817.ref038","doi-asserted-by":"crossref","unstructured":"Akinyele JA, Green M, Hohenberger S, Kumaresan R, Garman C, Miers I, et al. Charm: A Framework for Rapidly Prototyping Cryptosystems; 2013. Available from: https:\/\/github.com\/JHUISI\/charm.","DOI":"10.1007\/s13389-013-0057-3"},{"key":"pone.0312817.ref039","unstructured":"Xu X, Lyu L. A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning. In: International Workshop on Federated Learning for User Privacy and Data Confidentiality in Conjunction with ICML 2021 (FL-ICML\u201921); 2021."}],"container-title":["PLOS ONE"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0312817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:53:26Z","timestamp":1733165606000},"score":1,"resource":{"primary":{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0312817"}},"subtitle":[],"editor":[{"given":"Zhiquan","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":39,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2024,12,2]]}},"URL":"https:\/\/doi.org\/10.1371\/journal.pone.0312817","relation":{},"ISSN":["1932-6203"],"issn-type":[{"value":"1932-6203","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,2]]}}}