Secure two-party point-circle inclusion problem

Journal of Computer Science and Technology

Volumn 22, Issue 1, 2007, Pages 88-91

  Luo, Yong Long ^a,b,c   Huang, Liu Sheng ^a,c   Zhong, Hong ^a,c  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b ANHUI NORMAL UNIVERSITY   (China)

^c Anhui Province Key Laboratory of Software in Computing and Communication   (China)

Author keywords

Computational geometry; Homomorphic encryption scheme; Private comparison; Secure multi party computation

Indexed keywords

HOMOMORPHIC ENCRYPTION SCHEME; PRIVATE COMPARISON; SECURE MULTI-PARTY COMPUTATION;

COMPUTATIONAL GEOMETRY; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

DATA PRIVACY;

EID: 33847075772     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-007-9011-0     Document Type: Article

References (20)

1. Du W, Zhan Z. A practical approach to solve secure multiparty computation problems. In New Security Paradigms Workshop 2002, Virginia Beach, USA, September 23-26, 2002, pp.127-135.
2. Du W, Atallah M J. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigms Workshop 2001, Cloudcroft, New Mexico, USA, September 11-13, 2001, pp.11-20.
3. Luo Y L, Huang L S et al. An algorithm for privacy-preserving Boolean association rule mining. Acta Electronica Sinica, 2005, 33(5): 900-903.
4. Luo Y L, Huang L S et al. Privacy protection in the relative position determination for two spatial geometric objects. Journal of Computer Research and Development, 2006, 43(3): 410-416.
5. Luo Y L, Huang L S et al. Privacy-preserving distance measurement and its applications. Chinese Journal of Electronica, 2006, 15(2): 237-241.
6. Atallah M J, Du W. Secure multi-party computational geometry. In Proc. 7th International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science 8125, Springer Verlag, 2001, pp.165-179.
7. Li S D, Dai Y Q. Secure two-party computational geometry. Journal of Computer Science and Technology, 2005, 20(2): 258-263.
8. Tzeng W G. Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. IEEE Transactions on Computers, 2004, 53(2): 232-240.
9. Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In Advances in CryptologyEUROCRYPT'99, Lecture Notes in Computer Science 1592, Springer-Verlag, 1999, pp.223-238.
10. Benaloh J. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, Kingston, ON, May 1994, pp.120-128.
11. Naccache D, Stern J. A new public-key cryptosystem based on higher residues. In Proc. the 5th ACM Conf. Computer and Communications Security, San Francisco: ACM, 1998, pp.59-66.
12. Yao A C. Protocols for secure computations. In Proc. the SSrd Annual IEEE Symp. Foundations of Computer Science, Chicago, USA, 1982, pp.160-164.
13. Cachin C. Efficient private bidding and auctions with an oblivious third party. In Proc. the 6th ACM Conf. Computer and Communications Security, Singapore, 1999, pp.120-127.
14. Fischlin M. A cost-effective pay-per-multiplication comparison method for millionaires. In Progress in Cryptology - CTRSA 2001: Cryptographers' Track at RSA Conference, San Francisco: USA, April 8-12, 2001, pp.457-472.
15. Ioannidis I, Grama A. An efficient protocol for Yao's millionaires' problem. In Proc. the 36th Hawaii Int. Conf. System Sciences, Jan. 6-9, 2003.
16. Blake I F, Kolesnikov V. Strong condition oblivious transfer and computing on intervals. In Proc. Advances in Cryptology - ASIACRYPT'04, LNCS 3329, Jeju Island, Korea, 2004, pp.515-529.
17. Lin H Y, Tzeng W G. An efficient solution to the millionaires' problem based on hormomorphic encryption. Lecture notes in Computer Science 3531, Springer-Verlag, 2005, pp.456-466.
18. Luo Yonglong, Huang Liusheng et al. An efficient private comparison problem. Submitted to IEEE Trans. Dependable and Secure Computation.
19. Goethals B, Laur S, Lipmaa H, Mielikäinen T. On secure scalar product computation for privacy-preserving data mining. In The 7th Annual Int. Conf. Information Security and Cryptology (ICISC 2004), Choonsik Park, Seongtaek Chee (eds.), LNCS 3506, Springer-Verlag, Seoul, Korea, Dec. 2004, pp. 104-120.
20. Luo Yonglong, Huang Liusheng et al. A faster algorithm of modular exponentiation in RSA. Chinese Journal of Mini-Micro Systems, 2004, 25(1): 76-78.