Abstract
In this paper, we address the problem of multi-party privacy-preserving matching (PPM) over the encrypted data. We firstly construct an efficient identity-based re-encryption scheme like ElGmal (IBR-ElGmal) using combined public keys, which not only ensures the privacy of the information during the transmission process but also holds perfect multiplicative homomorphic property. Then we construct a multi-party identity-based symmetric privacy-preserving matching (M-IBSPM) protocol based on IBR-ElGmal scheme in cloud environments, which realizes the privacy-preserving matching among multiple different parties as well as getting the symmetric output. Furthermore, with our M-IBSPM protocol, most of the computation costs are taken over by cloud service provider without leaking any privacy, and our protocol achieves perfect security and privacy in the semi-honest model. Finally, we analyze the efficiency for our protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection[C]//Advances in Cryptology-EUROCRYPT 2004. Berlin, Heidelberg: Springer-Verlag, 2004: 1–19.
Naor M, Pinkas B. Oblivious transfer and polynomial evaluation[C]//Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1999: 245–254.
Li Y, Tygar J D, Hellerstein J M. Private matching[ C]//Computer Security in the 21st Century. Berlin, Heidelberg: Springer-Verlag, 2005: 25–50.
Sang Y, Shen H, Tan Y, et al. Efficient protocols for privacy preserving matching against distributed datasets[C]// Information and Communications Security. Berlin, Heidelberg: Springer-Verlag, 2006: 210–227.
Ye Q, Wang H, Pieprzyk J. Distributed private matching and set operations [C]//Information Security Practice and Experience. Berlin, Heidelberg: Springer-Verlag, 2008: 347–360.
Hazay C, Lindell Y. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries [C]//Theory of Cryptography. Berlin, Heidelberg: Springer-Verlag, 2008: 155–175.
Jarecki S, Liu X. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection[C]//Theory of Cryptography. Berlin, Heidelberg: Springer-Verlag, 2009: 577–594.
Zhang R, Zhang Y, Sun J, et al. Fine-grained private matching for proximity-based mobile social networking [C]// INFOCOM, 2012 Proceedings IEEE. Piscataway N J: IEEE Press, 2012: 1969–1977.
Vaidya J, Clifton C. Secure set intersection cardinality with application to association rule mining[J]. Journal of Computer Security, 2005, 13(4): 593–622.
Agrawal R, Evfimievski A, Srikant R. Information sharing across private databases[C]//Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2003: 86–97.
Li R, Wu C. An unconditionally secure protocol for multi-party set intersection[C]//Applied Cryptography and Network Security. Berlin, Heidelberg: Springer-Verlag, 2007: 226–236.
Narayanan G S, Aishwarya T, Agrawal A, et al. Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security [C] //Cryptology and Network Security. Berlin, Heidelberg: Springer-Verlag, 2009: 21–40.
Li M, Cao N, Yu S, et al. Findu: Privacy-preserving personal profile matching in mobile social networks[C]//INFOCOM, 2011 Proceedings IEEE. Piscataway N J: IEEE Press, 2011: 2435–2443.
Li M, Yu S, Cao N, et al. Privacy-preserving distributed profile matching in proximity-based mobile social net-works[J]. IEEE Transactions on Wireless Communications, 2013, 12(5): 2024–2033.
Gao Z, Du S, Li M, et al. Fairness-aware and privacy-preserving friend matching protocol in mobile social networks[J]. IEEE Transactions on Emerging Topics in Computing, 2013, 1(1): 192–200.
Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks[C]// IEEE 24th International Conference on Data Engineering. Piscataway N J: IEEE Press, 2008: 506–515.
Shamir A. Identity-based cryptosystem and signature schemes[C] //Advances in Cryptology-EUROCRYPT’’98. Berlin Heidelberg: Springer-Verlag, 1984:47–53.
Wu Z, Chen Z, Guo F, et al. Identity based private matching[ C]// Third International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, 2007. Piscataway N J: IEEE Press, 2007: 85–90.
Zhong S, Chen T. An efficient identity-based protocol for private matching[J]. International Journal of Communication Systems, 2011, 24(4): 543–552.
Qiu S, Liu J, Shi Y. Identity-based symmetric private set intersection[C]// 2013 International Conference on Social Computing (Social Com). Piscataway N J: IEEE Press, 2013: 653–658.
Liu J, Zhong S. Fast Identity-based encryption using combined public keys[EB/OL]. [2014-03-20]. http://www.paper.edu.cn/releasepaper/content/200903-756.
Bao F, Deng R H, Zhu H. Variations of Diffie-Hellman problem[C]//Information and Communications Security. Berlin, Heidelberg: Springer-Verlag, 2003: 301–312.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the Fundamental Research Funds for the Central Universities (2014YJS038)
Biography: QIU Shuo, female, Ph.D. candidate, research direction: privacy-preserving and information security.
Rights and permissions
About this article
Cite this article
Qiu, S., Liu, J., Shi, Y. et al. Multi-party identity-based symmetric privacy-preserving matching with cloud storage. Wuhan Univ. J. Nat. Sci. 19, 426–432 (2014). https://doi.org/10.1007/s11859-014-1035-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-014-1035-z