Skip to main content
SpringerLink
Log in

A Secure Scalar Product Protocol Against Malicious Adversaries

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A secure scalar product protocol is a type of specific secure multi-party computation problem. Using this kind of protocol, two involved parties are able to jointly compute the scalar product of their private vectors, but no party will reveal any information about his/her private vector to another one. The secure scalar product protocol is of great importance in many privacy-preserving applications such as privacy-preserving data mining, privacy-preserving cooperative statistical analysis, and privacy-preserving geometry computation. In this paper, we give an efficient and secure scalar product protocol in the presence of malicious adversaries based on two important tools: the proof of knowledge of a discrete logarithm and the verifiable encryption. The security of the new protocol is proved under the standard simulation-based definitions. Compared with the existing schemes, our scheme offers higher efficiency because of avoiding inefficient cut-and-choose proofs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tran D H, Ng W K, Lim H W et al. An efficient cacheable secure scalar product protocol for privacy-preserving data mining. In Proc. the 13th Int. Conf. Data Warehousing and Knowledge Discovery, Aug. 29-Sept. 2, 2011, pp.354-366.

  2. Goethals B, Laur S, Lipmaa H, Mielikainen T. On private scalar product computation for privacy-preserving data mining. In Proc. the 7th Int. Conf. Information Security and Cryptology, Dec. 2004, pp.104-120.

  3. Vaidya J, Clifton C. Privacy preserving association rule mining in vertically partitioned data. In Proc. the 8th SIGKDD Int. Conf. Knowledge Discovery and Data Mining, July 2002, pp.639-644.

  4. Du W, Atallah M. Privacy-preserving cooperative statistical analysis. In Proc. the 17th Annual Computer Security Applications Conference, Dec. 2001, pp.102-110.

  5. Atallah M J, Du W. Secure multiparty computational geometry. In Proc. the 7th International Workshop on Algorithms and Data Structures, Aug. 2011, pp.165-179.

  6. Thomas T. Secure Two-party protocols for point inclusion problem. Int. J. Network Security, 2009, 9(1): 1-7.

    Google Scholar 

  7. Yang B, Sun A D, Zhang W Z. Secure two-party protocols on planar circles. Journal of Information & Computational Science, 2011, 8(1): 29-40.

    Google Scholar 

  8. Yang B, Shao Z Y, Zhang W Z. Secure two-party protocols on planar convex hulls. Journal of Information & Computational Science, 2012, 9(4): 915-929.

    Google Scholar 

  9. Du W, Zhan Z. Building decision tree classifier on private data. In Proc. IEEE ICDM Workshop on Privacy, Security, and Data Mining, Dec. 2002, Vol.14, pp.1-8.

  10. Amirbekyan A, Estivill-Castro V E C. A new efficient privacy-preserving scalar product protocol. In Proc. the 6th Australasian Data Mining Conference, Dec. 2007, pp.209-214.

  11. Hazay C. Efficient two-party computation with simulation based security [Ph.D. Thesis]. Senate of Bar-Ilan University, Israel, 2009.

  12. Goldreich O. Foundations of Cryptography (Vol.2): Basic Applications. London, UK: Cambridge University Press, 2004.

    Book  Google Scholar 

  13. Schnorr C P. Efficient signature generation by smart cards. Journal of Cryptology, 1991, 4(3): 161-174.

    Article  MathSciNet  MATH  Google Scholar 

  14. Camenisch J, Shoup V. Practical verifiable encryption and decryption of discrete logarithms. In Proc. CRYPTO 2003, Aug. 2003, pp.126-144.

  15. Paillier P. Public-key cryptosystems based on composite degree residue classes. In Proc. the 17th Theory and Application of Cryptographic Techniques, May 1999, pp.223-238.

  16. Jarecki S, Liu X. Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In Proc. the 6th Theory of Cryptography Conference, March 2009, pp.577-594.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Shaanxi Normal University, Xi’an, 710062, China

    Bo Yang

  2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, China

    Yong Yu

  3. Graduate Institute of Information and Computer Education, National Kaohsiung Normal University, Taiwan, China

    Chung-Huang Yang

Authors
  1. Bo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chung-Huang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Yang.

Additional information

This work was supported by the National Natural Science Foundation of China under Grant Nos. 60973134, 61173164, 61003232, and the Natural Science Foundation of Guangdong Province of China under Grant No. 10351806001000000.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(DOC 23.0 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, B., Yu, Y. & Yang, CH. A Secure Scalar Product Protocol Against Malicious Adversaries. J. Comput. Sci. Technol. 28, 152–158 (2013). https://doi.org/10.1007/s11390-013-1319-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1319-3

Keywords

Search

Navigation