We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 28 Issue 1
January  2013
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Bo Yang, Yong Yu, Chung-Huang Yang. A Secure Scalar Product Protocol Against Malicious Adversaries[J]. Journal of Computer Science and Technology, 2013, 28(1): 152-158. DOI: 10.1007/s11390-013-1319-3
Citation: Bo Yang, Yong Yu, Chung-Huang Yang. A Secure Scalar Product Protocol Against Malicious Adversaries[J]. Journal of Computer Science and Technology, 2013, 28(1): 152-158. DOI: 10.1007/s11390-013-1319-3
shu

A Secure Scalar Product Protocol Against Malicious Adversaries

  • 1. School of Computer Science, Shaanxi Normal University, Xi’an 710062, China;
    2. School of Computer Science and Engineering, University of Electronic Science and Technology of China Chengdu 610054, China;
    3. Graduate Institute of Information and Computer Education, National Kaohsiung Normal University, Taiwan, China

Funds: 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.
More Information
  • Received Date: October 10, 2011
  • Revised Date: April 04, 2012
  • Published Date: January 04, 2013
    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.
    • FullText(HTML)
    • References (16)
  • [1]
    Tran D H, Ng W K, Lim H W et al. An efficient cacheable securescalar product protocol for privacy-preserving data mining.In Proc. the 13th Int. Conf. Data Warehousing andKnowledge Discovery, Aug. 29-Sept. 2, 2011, pp.354-366.
    [2]
    Goethals B, Laur S, Lipmaa H, Mielikainen T. On privatescalar product computation for privacy-preserving data mining.In Proc. the 7th Int. Conf. Information Security andCryptology, Dec. 2004, pp.104-120.
    [3]
    Vaidya J, Clifton C. Privacy preserving association rule miningin vertically partitioned data. In Proc. the 8th SIGKDDInt. Conf. Knowledge Discovery and Data Mining, July2002, pp.639-644.
    [4]
    Du W, Atallah M. Privacy-preserving cooperative statisticalanalysis. In Proc. the 17th Annual Computer Security ApplicationsConference, Dec. 2001, pp.102-110.
    [5]
    Atallah M J, Du W. Secure multiparty computational geometry.In Proc. the 7th International Workshop on Algorithmsand Data Structures, Aug. 2011, pp.165-179.
    [6]
    Thomas T. Secure Two-party protocols for point inclusionproblem. Int. J. Network Security, 2009, 9(1): 1-7.
    [7]
    Yang B, Sun A D, Zhang W Z. Secure two-party protocolson planar circles. Journal of Information & ComputationalScience, 2011, 8(1): 29-40.
    [8]
    Yang B, Shao Z Y, Zhang W Z. Secure two-party protocolson planar convex hulls. Journal of Information & ComputationalScience, 2012, 9(4): 915-929.
    [9]
    Du W, Zhan Z. Building decision tree classifier on privatedata. 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 privacypreservingscalar product protocol. In Proc. the 6th AustralasianData Mining Conference, Dec. 2007, pp.209-214.
    [11]
    Hazay C. Efficient two-party computation with simulationbased 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.
    [13]
    Schnorr C P. Efficient signature generation by smart cards.Journal of Cryptology, 1991, 4(3): 161-174.
    [14]
    Camenisch J, Shoup V. Practical verifiable encryption anddecryption of discrete logarithms. In Proc. CRYPTO 2003,Aug. 2003, pp.126-144.
    [15]
    Paillier P. Public-key cryptosystems based on composite degreeresidue classes. In Proc. the 17th Theory and Applicationof Cryptographic Techniques, May 1999, pp.223-238.
    [16]
    Jarecki S, Liu X. Efficient oblivious pseudorandom functionwith applications to adaptive OT and secure computation ofset intersection. In Proc. the 6th Theory of CryptographyConference, March 2009, pp.577-594.
    • Relative Articles

  • Related Articles

    [1]Ming Wan, Geng Wang, Shi-Feng Sun, Da-Wu Gu, Gong-Yu Shi. Efficient Function-Hiding Inner Product Functional Encryption and Its Application to Fine-Grained Data Sharing[J]. Journal of Computer Science and Technology, 2025, 40(3): 921-938. DOI: 10.1007/s11390-024-3670-y
    [2]Zhao-Hui Li, Xin-Yu Feng. Verifying Contextual Refinement with Ownership Transfer[J]. Journal of Computer Science and Technology, 2021, 36(6): 1342-1366. DOI: 10.1007/s11390-021-1671-7
    [3]Yuan Li, Xing-Chen Wang, Lin Huang, Yun-Lei Zhao. Order-Revealing Encryption: File-Injection Attack and Forward Security[J]. Journal of Computer Science and Technology, 2021, 36(4): 877-895. DOI: 10.1007/s11390-020-0060-y
    [4]Wan-Wei Liu, Fu Song, Tang-Hao-Ran Zhang, Ji Wang. Verifying ReLU Neural Networks from a Model Checking Perspective[J]. Journal of Computer Science and Technology, 2020, 35(6): 1365-1381. DOI: 10.1007/s11390-020-0546-7
    [5]Fateh Boucenna, Omar Nouali, Samir Kechid, M. Tahar Kechadi. Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management[J]. Journal of Computer Science and Technology, 2019, 34(1): 133-154. DOI: 10.1007/s11390-019-1903-2
    [6]Xiao-Fen Wang, Yi Mu, Rongmao Chen, Xiao-Song Zhang. Secure Channel Free ID-Based Searchable Encryption for Peer-to-Peer Group[J]. Journal of Computer Science and Technology, 2016, 31(5): 1012-1027. DOI: 10.1007/s11390-016-1676-9
    [7]Zhen-Chuan Chai, Zhen-Fu Cao, Yuan Zhou. Efficient ID-Based Multi-Decrypter Encryption with Short Ciphertexts[J]. Journal of Computer Science and Technology, 2007, 22(1): 103-108.
    [8]Hai-Bo Tian, Xi Sun, Yu-Min Wang. A New Public-Key Encryption Scheme[J]. Journal of Computer Science and Technology, 2007, 22(1): 95-02.
    [9]Yong-Long Luo, Liu-Sheng Huang, Hong Zhong. Secure Two-Party Point-Circle Inclusion Problem[J]. Journal of Computer Science and Technology, 2007, 22(1): 88-91.
    [10]Shun-Dong Li, Yi-Qi Dai. Secure Two-Party Computational Geometry[J]. Journal of Computer Science and Technology, 2005, 20(2).
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (31) PDF downloads (1751) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return