An efficient secure sum of multi-scalar products protocol base on elliptic curve
DOI:
https://doi.org/10.54654/isj.v14i2.196Keywords:
Scalar Product Protocol, Secure Multi-party Computation, Secure Sum Protocol, Elliptic curve cryptosystem, Privacy preserving data mining, Privacy preserving frequency miningTóm tắt
Abstract— The secure scalar product is one of the most important protocols in PPDM. It is used in many problems such as safe auction, secure voting, ensuring privacy for recommendation systems and statistical data analysis, etc... In this paper, we propose an efficient multi-party secure computation protocol using Elliptic curve cryptography, which allows to compute the sum value of multi-scalar products without revealing the input vectors. Moreover, theoretical and experimental analysis shows that the proposed method is more efficient than others in both computation and communication.
Downloads
References
David Evans, Vladimir Kolesnikov and Mike Rosulek, A Pragmatic Introduction to Secure Multi-Party Computation, NOW Publishers, 2018.
O. Goldreich., The Foundations of Cryptography, volume 2, Cambridge University Press, 2004.
Dong, Changyu and Chen, Liqun, "A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining," in Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2014.
Y. Zhu,T. Takagi, "Efficient scalar product protocol and its privacypreserving application," in International J. of Electronic Security and Digital Forensics, Vol. 7, No. 1, 2015.
Clifton, Chris and Kantarcioglu, Murat and Vaidya, Jaideep and Lin, Xiaodong and Zhu, Michael Y, "Tools for privacy preserving distributed data mining," ACM Sigkdd Explorations Newsletter, vol. 4, no. 2, pp. 28-34, 2002.
Goethals, Bart and Laur, Sven and Lipmaa, Helger and Mielikäinen, Taneli, "On private scalar product computation for privacy-preserving data mining," in International Conference on Information Security and Cryptology, 2004.
Atallah M J, Du W, "Secure multiparty computational geometry," in Proc. the 7th International Workshop on Algorithms, 2011.
Yang B, Sun A D, Zhang W Z, "Secure two-party protocols on planar circles," Journal of Information & Computational, vol. 8, no. 1, pp. 29-40, 2011.
Babak Siabi, Mehdi Berenjkoub, Willy Susilo, "Optimally Efficient Secure Scalar Product With Applications in Cloud Computing," IEEE Access, vol. 7, no. 1, pp. 42798 - 42815, 29 3 2019.
Zhang J, Li L, Tang Y, Luo S, Yang Y, Xin Y, "Secure two-party computation of solid triangle area and tetrahedral volume based on cloud platform," PLoS One, Public Library of Science, vol. 14, no. 1, pp. 1-22, 2019.
Y. Rahulamathavan, S. Dogan, X. Shi, R. Lu, M. Rajarajan and A. Kondoz, "Scalar Product Lattice Computation for Efficient Privacy-preserving Systems," IEEE Internet of Things Journal, vol. 8, no. 3, pp. 1417-1427, 2021.
Mehnaz, Shagufta and Bellala, Gowtham and Bertino, Elisa, "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, 2017.
Duy-Hien, Vu and The-Dung, Luong and Tu-Bao, Ho, "An Efficient Approach for Secure Multi-party Computation without Authenticated Channel," Information Science, 2019.
The-Dung, Luong and Tu-Bao, Ho, "Privacy preserving frequency mining in 2-part fully distributed setting," IEICE TRANSACTIONS on Information and Systems, vol. 93, no. 10, pp. 2702-2708, 2010.
Thi Van Vu, The Dung Luong, Van Quan Hoang, "An Elliptic Curve-based Protocol for Privacy Preserving Frequency Computation in 2-Part Fully Distributed Setting," in 12th International Conference on Knowledge and Systems Engineering (KSE), Can Tho, 2020.
Luong The Dung, Vu Duy Hien, Vu Thi Van, "A new Approach for secure multi-party computation protocol," Journal of Military Science and Technology, vol. Information security special, 2019.
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).
