A secure Multi-Frequency Computation Protocol in 2-Part Fully Distributed Setting
DOI:
https://doi.org/10.54654/isj.v2i22.1051Keywords:
Secure frequency computation, Privacy-Preserving, Homomorphic encryption, Secure computation, Elliptic curve cryptographyTóm tắt
Secure frequency computation protocols have been researched and applied to address various privacy-preserving problems in machine learning, data mining, and data analysis. However, these protocols only allow for the calculation of a single frequency value in one execution. In this paper, we propose a protocol for calculating multiple secure frequency values concurrently for the 2PFD data model, which is a relatively new distributed data model that has appeared in many practical problems but has not received much attention. The proposed protocol not only maintains the accuracy of the output results and a high level of security but also exhibits good performance.
Downloads
References
M. I. Pramanik, R. Y. Lau, M. S. Hossain, M. M. Rahoman, S. K. Debnath, M. G. Rashed, and M. Z. Uddin, “Privacy preserving big data analytics: A critical analysis of state-of-the-art,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 11, no. 1, p. e1387, 2021.
T. D. LUONG and T. B. HO, “Privacy preserving frequency mining in 2-part fully distributed setting,” IEICE Transactions on Information and Systems, vol. E93.D, no. 10, pp. 2702–2708, 2010.
D. L. . T., “Luận án tiến sĩ: Nghiên cứu xây dựng một số giải pháp đảm bảo an toàn thông tin trong quá trình khai phá dữ liệu,” Viện Khoa học và Công nghệ quân sự, 2011.
T. D. Luong and D. H. Tran, “Erratum: Privacy preserving frequency-based learning algorithms in two-part partitioned record model,” in Knowledge and Systems Engineering: Proceedings of the Fifth International Conference KSE 2013, Volume 2. Springer, 2014, pp. 445–445.
V. T. Van, L. T. Dung, H. V. Quan, T. T. Luong, and H. D. Tho, “Privacy-preserving decision tree solution in the 2-part fully distributed setting,” Journal of Science and Technology on Information security, vol. 1, no. 15, pp. 92–101, 2022.
C. Dong and L. Chen, “A fast secure dot product protocol with application to privacy preserving association rule mining,” in Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer,
, pp. 606–617.
B. Siabi, M. Berenjkoub, and W. Susilo, “Optimally efficient secure scalar product with applications in cloud computing,” IEEE Access, vol. 7, pp. 42 798–42 815, 2019.
Q. Tang and H. Wang, “Privacy-preserving hybrid recommender system,” in Proceedings of the Fifth ACM International Workshop on Security in Cloud Computing, 2017, pp. 59–66.
D.-H. Vu, T.-D. Luong, and T.-B. Ho, “An efficient approach for secure multi-party computation without authenticated channel,” Information Sciences, 2019.
D.-H. Vu, T.-S. Vu, and T.-D. Luong, “An efficient and practical approach for privacy-preserving naive bayes classification,” Journal of information Security and Applications, vol. 68, p. 103215, 2022.
S. Mehnaz, G. Bellala, and E. Bertino, “A secure sum protocol and its application to privacy-preserving multi-party analytics,” in Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, ser. SACMAT ’17 Abstracts. New York, NY, USA: Association for Computing Machinery, 2017, p. 219–230. [Online]. Available: https://doi.org/10.1145/3078861.3078869
D.-H. Vu, “Privacy-preserving naive bayes classification in semi-fully distributed data model,” Computers & Security, vol. 115, p. 102630, 2022.
T. D. Luong and D. H. Tran, “A new method of privacy preserving computation over 2-part fully distributed data,” in The 9th International Conference on Computing and InformationTechnology (IC2IT2013), P. Meesad, H. Unger, and S. Boonkrong, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 115–123.
T. Van Vu, T. D. Luong et al., “An elliptic curve-based protocol for privacy preserving frequency computation in 2-part fully distributed setting,” in 2020 12th International Conference on Knowledge and Systems Engineering (KSE). IEEE, 2020, pp. 91–96.
O. Goldreich, Foundations of Cryptography, Volume 2. Cambridge university press Cambridge, 2004.
M. Lepinski and S. Kent, “Rfc 5114: Additional diffiehellman groups for use with ietf standards,” 2008.
M. Lochter and J. Merkle, “Elliptic curve cryptography (ecc) brainpool standard curves and curve generation,” Tech. Rep., 2010.
Y. F. Chung, K. H. Huang, F. Lai, and T. S. Chen, “Id-based digital signature scheme on the elliptic curve cryptosystem,” Computer Standards & Interfaces, vol. 29, no. 6, pp. 601–604, 2007.
S. H. Islam and G. Biswas, “A pairing-free identity-based authenticated group key agreement protocol for imbalanced mobile networks,” Annals of telecommunications-annales des telecommunications, vol. 67, pp. 547–558, 2012.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).