Multi-party identity-based symmetric privacy-preserving matching with cloud storage
详细信息 查看全文
- 作者：Shuo Qiu (1)
Jiqiang Liu (1)
Yanfeng Shi (1)
Zhen Han (1) - 关键词：cloud computing ; symmetric privacy ; preserving matching ; identity ; based re ; encryption ; TP 305
- 刊名：Wuhan University Journal of Natural Sciences
- 出版年：2014
- 出版时间：October 2014
- 年：2014
- 卷：19
- 期：5
- 页码：426-432
- 全文大小：313 KB
- 参考文献：1. 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鈥?9.
2. 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鈥?54.
3. Li Y, Tygar J D, Hellerstein J M. Private matching[ C]// / Computer Security in the 21 / st Century. Berlin, Heidelberg: Springer-Verlag, 2005: 25鈥?0.
4. 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鈥?27. CrossRef
5. Ye Q, Wang H, Pieprzyk J. Distributed private matching and set operations [C]// / Information Security Practice and Experience. Berlin, Heidelberg: Springer-Verlag, 2008: 347鈥?60. CrossRef
6. 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鈥?75. CrossRef
7. 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鈥?94. CrossRef
8. 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鈥?977.
9. Vaidya J, Clifton C. Secure set intersection cardinality with application to association rule mining[J]. / Journal of Computer Security, 2005, 13(4): 593鈥?22.
10. 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鈥?7.
11. 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鈥?36. CrossRef
12. 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鈥?0. CrossRef
13. 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鈥?443.
14. 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鈥?033. CrossRef
15. 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鈥?00. CrossRef
16. Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks[C]// / IEEE 24 / th International Conference on Data Engineering. Piscataway N J: IEEE Press, 2008: 506鈥?15.
17. Shamir A. Identity-based cryptosystem and signature schemes[C] // / Advances in Cryptology-EUROCRYPT鈥?/em>鈥?8. Berlin Heidelberg: Springer-Verlag, 1984:47鈥?3.
18. 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鈥?0.
19. Zhong S, Chen T. An efficient identity-based protocol for private matching[J]. / International Journal of Communication Systems, 2011, 24(4): 543鈥?52. CrossRef
20. 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鈥?58.
21. 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.
22. Bao F, Deng R H, Zhu H. Variations of Diffie-Hellman problem[C]// / Information and Communications Security. Berlin, Heidelberg: Springer-Verlag, 2003: 301鈥?12. CrossRef - 作者单位：Shuo Qiu (1)
Jiqiang Liu (1)
Yanfeng Shi (1)
Zhen Han (1)
1. School of Computer and Information Technology, Beijing Jiaotong University, Beijing, 100044, China - ISSN：1993-4998
文摘
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.