Skip to main content
SpringerLink
Log in

A new efficient authorized private set intersection protocol from Schnorr signature and its applications

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Private set intersection (PSI) has been proposed to achieve sharing sensitive information with privacy, which allows two participators to compute the intersection of their private sets without revealing any other information. Authorized private set intersection (APSI) is a variant of PSI such that APSI requires client sets for intersection must be authorized. Although many schemes have been proposed for linear optimization in the existing APSI publications, how to linearly optimize the APSI protocol based on the Schnorr signature has not been proposed yet. In this paper, we propose a new efficient APSI protocol with linear complexity (denoted by LC-APSI) from the Schnorr signature. LC-APSI is proven secure in the random oracle model by assuming the intractability of the gap Diffie–Hellman problem. Apart from the existed efficient APSI protocols based on RSA and IBE, the new proposal fills up the technical extensions and applications of APSI. In particular, our proposal on sharing sensitive information is also instantiated which can be used to the practical applications in cloud computing or outsourced data sharing.

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

Fig. 1

Similar content being viewed by others

References

  1. Abadi, A., Terzis, S., Dong,C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: Proceedings of Financial Cryptography and Data Security (FC), Barbados (2016)

  2. Alsmirat, M.A., Jararweh, Y., Al-Ayyoub, M., Shehab, M.A., Gupta, B.B.: Accelerating compute intensive medical imaging segmentation algorithms using hybrid CPU-GPU implementations. In: Furht, B. (ed.) Multimedia Tools and Applications, pp. 1–19. Springer, New York (2016)

  3. Boneh, D.: The decision Diffie–Hellman problem. In: Proceedings of the Third Algorithmic Number Theory Symposium 1998. Lecture Notes in Computer Science 1423, pp. 48–63. Springer, New York (1998)

  4. Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: International Conference on Cryptology (CRYPTO). Lecture Notes in Computer Science 2729, pp. 126–144. Springer, New York (2003)

  5. Davidson, A., Cid, C.: Computing private set operations with linear complexities. In: IACR Cryptology. http://eprint.iacr.org/2016/108 (2016)

  6. De Cristofaro, E., Kim, J.: Some like it private: sharing confidential information based on oblivious authorization. IEEE Secur. Priv. 8(4), 18–24 (2010)

    Article  Google Scholar 

  7. De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Financial Cryptography and Data Security. Lecture Notes in Computer Science 6052, pp. 143–159 (2010)

  8. De Cristofaro, E., Tsudik, G.: On the performance of certain private set intersection protocols. In: IACR Cryptology. http://eprint.iacr.org/2012/054 (2012)

  9. De Cristofaro, E., Tsudik, G.: Experimenting with fast private set intersection. In: TRUST 2012. Lecture Notes in Computer Science 7344, pp. 55–73. Springer, New York (2012)

  10. De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-preserving policy-based information transfer. In: Privacy Enhancing Technologies Symposium (PETS). Lecture Notes in Computer Science, vol. 5672, pp. 164–184 (2009)

  11. De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Lecture Notes in Computer Science 6477, pp. 213–231 (2010)

  12. De Cristofaro, E., Lu, Y., Tsudik, G.: Efficient techniques for privacy-preserving sharing of sensitive information. In: TRUST 2011. Lecture Notes in Computer Science 6740, pp. 239–253 (2011)

  13. Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: 18th International Conference on Proceedings of Information Security (ISC), pp. 209–226. Trondheim, Norway, September 9–11 (2015)

  14. Dong, C., Chen, L., Camenisch, J., Russello, G.: Fair private set intersection with a semi-trusted arbiter. In: Data and Applications Security and Privacy XXVII 2013. Lecture Notes in Computer Science 7964, pp. 128–144. Springer, New York (2013)

  15. Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: EUROCRYPT 2004. Lecture Notes in Computer Science 3027, pp. 1–19. Springer, New York (2004)

  16. Gupta, B.B., Agrawal, D.P., Yamaguchi, S.: Handbook of research on modern cryptographic solutions for computer and cyber security. ISBN: 1522501053. IGI Global, Hershey, PA (2016)

  17. Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: TCC 2008. Lecture Notes in Computer Science 4948, pp. 155–175. Springer, New York (2008)

  18. Hazay, C. Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: PKC 2010. Lecture Notes in Computer Science 6056, pp. 312–331. Springer, New York (2010)

  19. Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols?. In: Network and Distributed System Security Symposium (NDSS). The Internet Society (2012)

  20. Jararweh, Y., Alsmirat, M., Al-Ayyoub, M., Benkhelifa, E., Darabseh, A., Gupta, B., Doulat, A.: Software-defined system support for enabling ubiquitous mobile edge computing. Comput. J. 1–15 (2017)

  21. Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Theory of Cryptography Conference (TCC). Lecture Notes in Computer Science 5444, pp. 577–594. Springer, New York (2009)

  22. Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Suprachiasmatic Nucleus. Lecture Notes in Computer Science 6280, pp. 418–435. Springer, New York (2010)

  23. Kerschbaum, F.: Collusion-resistant outsourcing of private set intersection. In: Symposium on Applied Computing (SAC), pp. 1451–1456. ACM, New York (2012)

  24. Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: ASIACCS 2012, pp. 85-86. ACM, New York (2012)

  25. Li, J., Yan, H., Liu, Z., Chen, X., Huang, X., Wong, D.S.: Location-sharing systems with enhanced privacy in mobile online social networks. IEEE Syst. J. (2015). doi:10.1109/JSYST.2015.2415835

  26. Li, J., Li, J., Chen, X., Jia, C., Lou, W.: Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans. Comput. 64(2), 425–437 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  27. Li, J., Yu, C., Gupta, B.B., Ren, X.: Color image watermarking scheme based on quaternion Hadamard transform and Schur decomposition. In: Multimedia Tools and Applications, pp. 1–17. Springer, New York (2017)

  28. Okamoto, T., Pointcheval, D.: The gap-problem: a new class of problems for the security of cryptographic schemes. In: International Workshop on Practice and Theory in Public Key Cryptography (PKC). Lecture Notes in Computer Science 1992, pp. 104–118. Springer, New York (2001)

  29. Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Proceeding SEC’14 of Proceedings of the 23rd USENIX conference on Security Symposium, pp. 797–812, USENIX Association Berkeley, CA (2014)

  30. Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium (USENIX Security’15), pp. 515–530, August 12–14 (2015

  31. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: EUROCRYPT 1996. Lecture Notes in Computer Science 1070, pp. 387–398. Springer, New York (1996)

  32. Schnorr, C.: Efficient identification and signatures for smart cards. In: Proceeding of Crypto 1989, Santa Barbara, CA. Lecture Notes in Computer Science 435, pp. 239–252. Springer, New York (2003)

  33. Xia, Z., Wang, X., Zhang, L., Qin, Z., Sun, X., Ren, K.: A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing. IEEE Trans. Inf. Forensics Secur. 11(11), 2594–2608 (2016)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Nos. 61572028, 61472091, 61300204), the Project of Science and Technology of Guangdong (Nos. 2016B010125002, 2015A030313630, S2013020011913, 2014A030313439), Natural Science Foundation of Guangdong Province for Distinguished Young Scholars (2014A030306020), Guangzhou Scholars Project for Universities of Guangzhou (No. 1201561613), Science and Technology Planning Project of Guangdong province (2015B010129015), the Ministry of education of Humanities and Social Science Project (No. 15YJCZH029), the Social Science Planning Project of Guangzhou City (No. 2016gzyb25) and the Opening Project of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security.

Author information

Authors and Affiliations

  1. School of Statistics and Mathematics, Guangdong University of Finance and Economics, Guangzhou, 510320, China

    Yamin Wen

  2. School of Computer Science, South China Normal University, Guangzhou, 510631, China

    Zheng Gong

  3. School of Computer Science, Guangzhou University, Guangzhou, 510006, China

    Zhengan Huang

  4. School of Cyber Security, Shanghai Jiaotong University, Shanghai, 200240, China

    Weidong Qiu

Authors
  1. Yamin Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zheng Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhengan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weidong Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zheng Gong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wen, Y., Gong, Z., Huang, Z. et al. A new efficient authorized private set intersection protocol from Schnorr signature and its applications. Cluster Comput 21, 287–297 (2018). https://doi.org/10.1007/s10586-017-0940-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-0940-2

Keywords

Search

Navigation