Abstract
The research on the identification of network users has been continuous, and methods and algorithms emerge in endlessly. Of course, it solves the problem that it is difficult to identify the identity of network interactive users. Yet, user identification raises questions about user privacy. In the last paper [[, we proposed a user identification method based on Mining Web Usage Profiles from Proxy Logs. For the previous user identification system, we study that which degree the surfing behavior must be obfuscated to prevent identification. Furthermore, we investigate directions in how far a user can hide her identity by obfuscating her web usage pattern through adding or hiding random HTTP connections. In experimental evaluation, we examine the time-period being necessary to obfuscate an identity based on a two-week log file being provided by our industrial partners.
This work funded by the Fundamental Research Funds for the University of Science and Tech-nology Beijing under Grant FRF-TP-19-016A1 and the National Key R&D Plan Program of China (2019QY(Y)0601).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xu, J., Xu, F., Ma, F., Zhou, L., Jiang, S., Rao, Z.: Mining web usage profiles from proxy logs: user identification. In: Conference Dependable and Secure Computing. IEEE (2021)
Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Web users clustering. In: Proceedings of the 15th International Symposium on Computer and Information Sciences, pp. 374–382 (2000)
P. Pirolli, J.P., Rao, R.: Silk from a sow’s ear: extracting usable structures from the web. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 118–125. ACM (1996)
Cooley, R., Mobasher, B., Srivastava, J.: Data preparation for mining world wide web browsing patterns. Knowl. Inf. Syst. 1(1), 5–32 (1999)
Kammenhuber, N., Luxenburger, J., Feldmann, A., Weikum, G.: Web search clickstreams. In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, pp. 245–250 (2006)
Li, B., Mazur, E., Diao, Y., McGregor, A., Shenoy, P.: A platform for scalable one-pass analytics using mapreduce. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 985–996 (2011)
Yen, T.-F., et al.: Beehive: large-scale log analysis for detecting suspicious activity in enterprise networks. In: Proceedings of the 29th Annual Computer Security Applications Conference, pp. 199–208. ACM (2013)
Lou, W., Liu, G., Lu, H., Yang, Q.: Cut-and-pick transactions for proxy log mining. In: Jensen, C.S., et al. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 88–105. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45876-X_8
Li, N., Zhang, N., Das, S.K.: Relationship privacy preservation in publishing online social networks. In: Proceedings IEEE 3rd International Conference Privacy Security Risk Trust/IEEE 3rd International Conference Social Compute, p 443–450 (2011)
Junggab, S., Donghyun, K., Alam, B., et al.: Privacy enhanced location sharing for mobile online social networks. IEEE Trans. Sustainable Comput., 1 (2018)
Xu, C., Xie, X., Zhu, L., et al.: PPLS: a privacy-preserving location-sharing scheme in mobile online social networks. Sci. China Inf. Sci. 63(3) (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, J., Xu, F., Xu, C. (2021). The Obfuscation Method of User Identification System. In: Zhou, J., et al. Applied Cryptography and Network Security Workshops. ACNS 2021. Lecture Notes in Computer Science(), vol 12809. Springer, Cham. https://doi.org/10.1007/978-3-030-81645-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-81645-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81644-5
Online ISBN: 978-3-030-81645-2
eBook Packages: Computer ScienceComputer Science (R0)