{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:36:56Z","timestamp":1760229416192,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["U20B2049","U20B2046","61976064","2022YFG0172"],"award-info":[{"award-number":["U20B2049","U20B2046","61976064","2022YFG0172"]}]},{"name":"Key Research and Development Project of Sichuan Province of China","award":["U20B2049","U20B2046","61976064","2022YFG0172"],"award-info":[{"award-number":["U20B2049","U20B2046","61976064","2022YFG0172"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The user equipment and directory server stay in the state of asymmetric information in anonymous networks, so that it is hard to coordinate information leakage prevention and information sharing when we explore the routing addressing technology. The severe security risk faced by existing anonymous networks, such as Tor and I2P, is the leakage of privacy information of routing nodes. This paper tries to resolve this problem and proposes a novel secure querying scheme of the routing table (SQRT) based on oblivious transfer, which can effectively ensure that both user equipment and directory server faithfully follow the routing querying protocol and protect the privacy information of both parties to the greatest extent. The SQRT scheme can realize that the directory server cannot only send the required routing nodes to the user equipment, but can also ensure that the directory server cannot know the exact routing nodes received by the user equipment and protect the information of other routing nodes in the directory server from disclosure. Security analysis shows that in the scenario where the directory server and user equipment are semi-honest, respectively, the SQRT scheme can ensure the privacy of both directory server and user equipment. The experimental simulation results show that compared with existing schemes, the SQRT scheme has obvious performance advantages in terms of the degree of anonymity, protocol running time, and communication traffic.<\/jats:p>","DOI":"10.3390\/sym14061245","type":"journal-article","created":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T21:19:26Z","timestamp":1655673566000},"page":"1245","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SQRT: A Secure Querying Scheme of Routing Table Based on Oblivious Transfer"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0621-941X","authenticated-orcid":false,"given":"Yue","family":"Zhao","sequence":"first","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"given":"Bo","family":"Tian","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8355-0969","authenticated-orcid":false,"given":"Ning","family":"Hu","sequence":"additional","affiliation":[{"name":"Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou 510006, China"}]},{"given":"Qi","family":"Zhao","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"given":"Yiru","family":"Niu","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9385-9301","authenticated-orcid":false,"given":"Leyu","family":"Lin","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"given":"Yarang","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Physics and Electrical Engineering, Kashi University, Kashi 844006, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Sakai, K., Sun, M., Ku, W., and Wu, J. (2017, January 10\u201313). A Framework for Anonymous Routing in Delay Tolerant Networks. Proceedings of the International Conference on Network Protocols (ICNP), Toronto, ON, Canada.","DOI":"10.1109\/ICNP.2017.8117531"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2926","DOI":"10.1109\/TMC.2018.2886349","article-title":"On Anonymous Routing in Delay Tolerant Networks","volume":"18","author":"Sakai","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Wardana, H.K., Handianto, L.F., and Yohanes, B.W. (2017, January 19\u201321). The Onion Routing Performance Using Shadow-plugin-TOR. Proceedings of the International Conference on Electrical Engineering, Computer Science, and Informatics (EECSI), Yogyakarta, Indonesia.","DOI":"10.1109\/EECSI.2017.8239183"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Yang, Y., Niu, Y., Wu, K., Hao, Y., Su, H., and Zhao, Q. (2021, January 2\u20134). A Classification and Identification Technology of TLS Encrypted Traffic Applications. Proceedings of the International Conference on Big Data and Artificial Intelligence (BDAI), Qingdao, China.","DOI":"10.1109\/BDAI52447.2021.9515274"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Danielis, P., Skodzik, J., Altmann, V., Lender, L., and Timmermann, D. (2015, January 9\u201312). Dynamic search tolerance at runtime for lookup determinism in the DHT-based P2P network Kad. Proceedings of the Annual IEEE Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, USA.","DOI":"10.1109\/CCNC.2015.7158002"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"71350","DOI":"10.1109\/ACCESS.2018.2881719","article-title":"Deciding Your Own Anonymity: User-Oriented Node Selection in I2P","volume":"6","author":"Ye","year":"2018","journal-title":"IEEE Access"},{"key":"ref_7","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":"2020","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Dehghan, M., and Sadeghiyan, B. (2020, January 29\u201330). Secure Multi-party Sorting Protocol Based on Distributed Oblivious Transfer. Proceedings of the International Conference on Computer and Knowledge Engineering (ICCKE), Mashhad, Iran.","DOI":"10.1109\/ICCKE50421.2020.9303630"},{"key":"ref_9","unstructured":"Huang, H., Liu, Z., and Tso, R. (February, January 30). Partially Blind ECDSA Scheme and Its Application to Bitcoin. Proceedings of the IEEE Conference on Dependable and Secure Computing (DSC), Aizuwakamatsu, Fukushima, Japan."},{"key":"ref_10","unstructured":"Suresh, A., and Patra, A. (2020, January 23\u201326). BLAZE: Blazing Fast Privacy-Preserving Machine Learning. Proceedings of the Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA."},{"key":"ref_11","unstructured":"Rachuri, R., and Suresh, A. (2020, January 23\u201326). Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. Proceedings of the Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1109\/JSYST.2018.2813929","article-title":"Route Selection Based on Connectivity-Delay-Trust in Public Safety Networks","volume":"13","author":"Tang","year":"2018","journal-title":"IEEE Syst. J."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Fotiou, N., Thomas, Y., Siris, A., Xylomenos, G., and Polyzos, C. (2021, January 7\u201310). Securing Named Data Networking routing using Decentralized Identifiers. Proceedings of the International Conference on High Performance Switching and Routing (HPSR), Paris, France.","DOI":"10.1109\/HPSR52026.2021.9481850"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"168","DOI":"10.23919\/JCC.2020.05.014","article-title":"Secured Cloud Data Migration Technique by Competent Probabilistic Public Key Encryption","volume":"17","author":"Aruna","year":"2020","journal-title":"China Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5045","DOI":"10.1109\/TIFS.2021.3122823","article-title":"Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries","volume":"16","author":"Bassit","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_16","first-page":"1","article-title":"An Invocation Chain Test and Evaluation Method for Fog Computing","volume":"2020","author":"Zhao","year":"2020","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_17","first-page":"94","article-title":"Resource Allocation Scheme Based on Load Balancing for OFDMA Two-hop Relay Networks","volume":"48","author":"Zhao","year":"2013","journal-title":"J. Southwest Jiaotong Univ."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.3724\/SP.J.1146.2012.00813","article-title":"Energy Efficient Adaptive Power Allocation in OFDM-based Decode-and-forward Relay Link","volume":"35","author":"Chen","year":"2013","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"10314","DOI":"10.1109\/JIOT.2020.2986303","article-title":"Large-Universe Attribute-Based Encryption with Public Traceability for Cloud Storage","volume":"7","author":"Zhang","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"17378","DOI":"10.1109\/ACCESS.2020.2967812","article-title":"Permutable Cut-and-Choose Oblivious Transfer and Its Application","volume":"8","author":"Wei","year":"2020","journal-title":"IEEE Access"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"38742","DOI":"10.1109\/ACCESS.2020.2975820","article-title":"A Big Data Provenance Model for Data Security Supervision Based on PROV-DM Model","volume":"8","author":"Gao","year":"2020","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/JSAIT.2021.3052934","article-title":"GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication","volume":"2","author":"Chen","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Gong, X., Hua, Q., Qian, L., Yu, D., and Jin, H. (2018, January 16\u201319). Communication-Efficient and Privacy-Preserving Data Aggregation without Trusted Authority. Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Honolulu, HI, USA.","DOI":"10.1109\/INFOCOM.2018.8486265"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Baritel-Ruet, C., Dupressoir, F., Fouque, P., and Gregoire, B. (2018, January 9\u201312). Formal Security Proof of CMAC and Its Variants. Proceedings of the Computer Security Foundations Symposium (CSF), Oxford, UK.","DOI":"10.29007\/2xpx"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chen, Z., Su, H., Sun, E., Guo, Y., and Ding, J. (2018, January 18\u201321). A Position-based Secure Fast Handover Mechanism for High-speed Trains. Proceedings of the International Conference on Data Science in Cyberspace (DSC), Guangzhou, China.","DOI":"10.1109\/DSC.2018.00009"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1109\/TPAMI.2019.2895794","article-title":"Calibrating Classification Probabilities with Shape-Restricted Polynomial Regression","volume":"41","author":"Wang","year":"2019","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TEVC.2019.2954234","article-title":"Parallel Black-Box Complexity with Tail Bounds","volume":"24","author":"Lehre","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"73","DOI":"10.23919\/JCC.2020.01.006","article-title":"A novel secure data transmission scheme in industrial internet of things","volume":"17","author":"Hui","year":"2020","journal-title":"China Commun."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Fleming, C., Zhou, X., Liu, D., and Liang, H. (2014, January 5\u20138). DiffuseNet: A Random Walk Based Anonymity Network. Proceedings of the International Conference on Signal Processing, Communications and Computing (ICSPCC), Guilin, China.","DOI":"10.1109\/ICSPCC.2014.6986323"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1245\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:32:16Z","timestamp":1760139136000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":29,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["sym14061245"],"URL":"https:\/\/doi.org\/10.3390\/sym14061245","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,6,15]]}}}