Browse > Article

Fair Private Matching with Semi-Trusted Third Party  

Kim, E-Yong (서울대학교 전기.컴퓨터공학부)
Hong, Jeong-Dae (서울대학교 전기.컴퓨터공학부)
Cheon, Jung-Hee (서울대학교 수리과학부)
Park, Kun-Soo (서울대학교 전기.컴퓨터공학부)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.14, no.4, 2008 , pp. 446-450 More about this Journal
Abstract
Private Matching is the problem of computing the intersection of private datasets of two parties without revealing their own datasets. Freedman et al.[1] introduced a solution for the problem, where only one party gets private matching. When both parties want to get private matching simultaneously, we can consider the use of Kissner and Song[2]'s method which is a privacy-preserving set intersection with group decryption in multi-party case. In this paper we propose new protocols for fair private matching. Instead of group decryption we introduce a Semi-Trusted Third Party for fairness. We also propose an update procedure without restarting the PM protocol.
Keywords
Private matching; semi-trusted third party; homomorphic cryptosystem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Advances in Cryptology-EUROCRYPTO '99, ser. Lecture Notes in Comput. Sci., vol. 1592. Springer-Verlag, 1999, pp. 223-238
2 Goldreich, Foundations of Cryptography. Cambridge University Press, 2004, vol. 2
3 P. Fouque, G. Poupard, and J. Stern, "Sharing decryption in the context of voting of lotteries," in Proc. International Conference on Financial Cryptography (FC '00), ser. Lecture Notes in Comput. Sci., vol. 1962. Springer-Verlag, 2000, pp. 90-104
4 L. Kissner and D. Song, "Privacy-preserving set operations," in Advances in Cryptology-CRYPTO 2005, ser. Lecture Notes in Comput. Sci., vol. 3621. Springer-Verlag, 22005, pp. 241-257
5 M. J. Freedman, K. Nissim, and B. Pinkas. "Efficient private matching and set intersection," in Advances in Cryptology-EUROCRYPT 2004, ser. Lecture Notes in comput. Sci., vol. 3027. Springer- Verlag, 2004, pp. 1-19
6 F. Bao, R. H. Deng, and W. Mao, "Efficient and practical fair exchange protocols with off-line TTP," in Proc. IEEE Symposium on Security and Privacy, Oakland, CA, May 1998, pp. 77-85
7 Y. Li, J. D. Tygar, and J. M. Hellerstein, "Private matching," Intel Research, Tech. Rep. IRB-TR- 04-005, Feb. 2004
8 M. K. Franklin and M. K. Reiter, "Fair exchange with a semi-trusted third party," in Proc. ACM Conference on Computer and Communications Security (CCS '97), Zurish, Switzerland, Apr. 1997, pp. 1-5
9 R. Agrawal, A. Evfimievski, and R. Srikant, "Information sharing across private databases," in Proc. ACM SIGMOD 2003, San Diego, CA, Jun. 2003, pp. 86-97