{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:24:00Z","timestamp":1784211840032,"version":"3.55.0"},"reference-count":33,"publisher":"MDPI AG","issue":"21","license":[{"start":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:00:00Z","timestamp":1698537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Joint Project of the National Natural Science Foundation of China","award":["U1636109"],"award-info":[{"award-number":["U1636109"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>With the rise of the internet, there has been an increasing focus on user anonymity. Anonymous communication networks (ACNs) aim to protect the identity privacy of users in the network. As a typical ACN, Tor achieves user anonymity by relaying user data through a series of relay nodes. However, this results in higher latency due to the transmission of network traffic between multiple nodes. This paper proposes a port-based anonymous communication network (PBACN) to address this issue. First, we propose a path construction algorithm. This algorithm describes constructing paths by partitioning the communication path information, which can reduce the probability of being discovered by adversaries. Secondly, we design a port-based source routing addressing method. During data transmission from the source to the destination, each node can directly forward the data by resolving the address into the port of each node. This method eliminates the need for table lookups, reducing the complexity of routing. Lastly, we propose an entropy-based metric to measure the anonymity of different ACNs. In terms of experimental evaluation, we quantitatively analyze the anonymity and end-to-end delay of various ACNs. The experimental results show that our proposed method reduces end-to-end delay by approximately 25% compared to Tor. When the adversary fraction is 20%, PBACN can improve the anonymity degree by approximately 4%.<\/jats:p>","DOI":"10.3390\/s23218810","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T13:26:55Z","timestamp":1698672415000},"page":"8810","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Port-Based Anonymous Communication Network: An Efficient and Secure Anonymous Communication Network"],"prefix":"10.3390","volume":"23","author":[{"given":"Xiance","family":"Meng","sequence":"first","affiliation":[{"name":"Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China"},{"name":"Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mangui","family":"Liang","sequence":"additional","affiliation":[{"name":"Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China"},{"name":"Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,10,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TDSC.2018.2804394","article-title":"Anonymity services tor, i2p, jondonym: Classifying in the dark (web)","volume":"17","author":"Montieri","year":"2018","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_2","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":"Chaum","year":"1988","journal-title":"J. Cryptol."},{"key":"ref_3","unstructured":"M\u00f6dinger, D., He\u00df, A., and Hauck, F.J. (2021). Arbitrary length K-anonymous dining-cryptographers communication. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/586110.586137","article-title":"Tarzan: A peer-to-peer anonymizing network layer","volume":"2429","author":"Freedman","year":"2002","journal-title":"Proc. ACM Conf. Comput. Commun. Secur."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Rennhard, M., and Plattner, B. (2002, January 21). Introducing morphmix: Peer-to-peer based anonymous internet usage with collusion detection. Proceedings of the 2002 ACM Workshop on Privacy in the Electronic Society, Washington, DC, USA.","DOI":"10.1145\/644527.644537"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Mathieu, B., Song, M., and Kleis, M. (2006, January 19\u201325). A p2p approach for the selection of media processing modules for service specific overlay networks. Proceedings of the Advanced Int\u2019l Conference on Telecommunications and Int\u2019l Conference on Internet and Web Applications and Services (AICT-ICIW\u201906), Washington, DC, USA.","DOI":"10.1109\/AICT-ICIW.2006.24"},{"key":"ref_7","unstructured":"Winter, P., Ensafi, R., Loesing, K., and Feamster, N. (2016, January 10\u201312). Identifying and characterizing Sybils in the Tor network. Proceedings of the 25th USENIX Security Symposium (USENIX Security 16), Austin, TX, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sankey, J., and Wright, M. (2014, January 16\u201318). Dovetail: Stronger anonymity in next-generation internet routing. Proceedings of the International Symposium on Privacy Enhancing Technologies Symposium, Amsterdam, The Netherlands.","DOI":"10.1007\/978-3-319-08506-7_15"},{"key":"ref_9","first-page":"245","article-title":"Traffic analysis attacks and trade-offs in anonymity providing systems","volume":"2137","author":"Back","year":"2001","journal-title":"Lect. Notes Comput. Sci. (Incl. Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinform.)"},{"key":"ref_10","unstructured":"Murdoch, S.J., and Danezis, G. (2005, January 8\u201311). Low-cost traffic analysis of Tor. Proceedings of the 2005 IEEE Symposium on Security and Privacy (S&P\u201905), Oakland, CA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Tusing, N., Oakley, J., Barrineau, G., Yu, L., Wang, K.C., and Brooks, R.R. (2019, January 8\u201310). Traffic analysis resistant network (tarn) anonymity analysis. Proceedings of the 2019 IEEE 27th International Conference on Network Protocols (ICNP), Chicago, IL, USA.","DOI":"10.1109\/ICNP.2019.8888134"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1109\/TNET.2013.2291242","article-title":"LASTor: A low-latency AS-aware tor client","volume":"22","author":"Akhoondi","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Kohls, K., Jansen, K., Rupprecht, D., Holz, T., and P\u00f6pper, C. (2019, January 24\u201327). On the Challenges of Geographical Avoidance for Tor. Proceedings of the NDSS, San Diego, CA, USA.","DOI":"10.14722\/ndss.2019.23402"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/TNET.2007.893888","article-title":"NIRA: A new inter-domain routing architecture","volume":"15","author":"Yang","year":"2007","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"de Farias, C.M., Pirmez, L., Delicato, F.C., Pires, P.F., Guerrieri, A., Fortino, G., Cauteruccio, F., and Terracina, G. (2017, January 16\u201318). A multisensor data fusion algorithm using the hidden correlations in Multiapplication Wireless Sensor data streams. Proceedings of the 2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC), Calabria, Italy.","DOI":"10.1109\/ICNSC.2017.8000074"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3182658","article-title":"A survey on routing in anonymous communication protocols","volume":"51","author":"Shirazi","year":"2018","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Zhang, X., Hsiao, H.C., Hasker, G., Chan, H., Perrig, A., and Andersen, D.G. (2011, January 22\u201325). SCION: Scalability, control, and isolation on next-generation networks. Proceedings of the 2011 IEEE Symposium on Security and Privacy, Berkeley, CA, USA.","DOI":"10.1109\/SP.2011.45"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TSC.2019.2946164","article-title":"A novel addressing and routing architecture for cloud-service datacenter networks","volume":"15","author":"Zhao","year":"2019","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_19","unstructured":"Liang, M., Zhang, J., and Wang, S. (2008, January 12\u201315). A new network based on vector address. Proceedings of the IET 2nd International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2008), Beijing, China."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chen, C., Asoni, D.E., Barrera, D., Danezis, G., and Perrig, A. (2015, January 12\u201316). HORNET: High-speed onion routing at the network layer. Proceedings of the ACM Conference on Computer and Communications Security, Denver, CO, USA.","DOI":"10.1145\/2810103.2813628"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Hsiao, H.C., Kim, T.H.J., Perrig, A., Yamada, A., Nelson, S.C., Gruteser, M., and Meng, W. (2012, January 20\u201323). LAP: Lightweight anonymity and privacy. Proceedings of the 2012 IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2012.37"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Chen, C., Asoni, D.E., Perrig, A., Barrera, D., and Troncoso, C. (2018, January 24\u201326). TARANET: Traffic-Analysis Resistant Anonymity at the Network Layer. Proceedings of the 2018 IEEE European Symposium on Security and Privacy (EuroS&P), London, UK.","DOI":"10.1109\/EuroSP.2018.00018"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"102106","DOI":"10.1016\/j.cose.2020.102106","article-title":"Balancing anonymity and resilience in anonymous communication networks","volume":"101","author":"Xia","year":"2021","journal-title":"Comput. Secur."},{"key":"ref_24","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":"Chaum","year":"1981","journal-title":"Commun. ACM"},{"key":"ref_25","unstructured":"Shoup, V., and Gennaro, R. (June, January 31). Securing threshold cryptosystems against chosen ciphertext attack. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Espoo, Finland."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Danezis, G., and Goldberg, I. (2009, January 17\u201320). Sphinx: A compact and provably secure mix format. Proceedings of the 2009 30th IEEE Symposium on Security and Privacy, Oakland, CA, USA.","DOI":"10.1109\/SP.2009.15"},{"key":"ref_27","unstructured":"Varga, A. (2001, January 6\u20139). The OMNET++ discrete event simulation system. Proceedings of the European Simulation Multiconference, Prague, Czech Republic."},{"key":"ref_28","unstructured":"Syverson, P. (2003, January 22\u201324). Onion routing for resistance to traffic analysis. Proceedings of the DARPA Information Survivability Conference and Exposition, Washington, DC, USA."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Overlier, L., and Syverson, P. (2006, January 21\u201324). Locating hidden servers. Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P\u201906), Berkeley, CA, USA.","DOI":"10.1109\/SP.2006.24"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Johnson, A., Wacek, C., Jansen, R., Sherr, M., and Syverson, P. (2013, January 4\u20138). Users Get Routed: Traffic Correlation on Tor by Realistic Adversaries. Proceedings of the 2013 ACM SIGSAC conference on Computer & Communications Security, Berlin, Germany.","DOI":"10.1145\/2508859.2516651"},{"key":"ref_31","first-page":"54","article-title":"Towards measuring anonymity","volume":"2482","author":"Seys","year":"2003","journal-title":"Lect. Notes Comput. Sci. (Incl. Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinform.)"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Grube, T., Egert, R., M\u00fchlh\u00e4user, M., and Daubert, J. (2021, January 9\u201312). The Cost of Path Information: Routing in Anonymous Communication. Proceedings of the 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC), Las Vegas, NV, USA.","DOI":"10.1109\/CCNC49032.2021.9369639"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/21\/8810\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:13:53Z","timestamp":1760130833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/21\/8810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,29]]},"references-count":33,"journal-issue":{"issue":"21","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["s23218810"],"URL":"https:\/\/doi.org\/10.3390\/s23218810","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,29]]}}}