Author:
Qiu Shuo,Liu Jiqiang,Shi Yanfeng,Han Zhen
Publisher
Springer Science and Business Media LLC
Reference22 articles.
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–19.
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–254.
3. Li Y, Tygar J D, Hellerstein J M. Private matching[ C]//Computer Security in the 21st Century. Berlin, Heidelberg: Springer-Verlag, 2005: 25–50.
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–227.
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–360.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献