{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T03:22:01Z","timestamp":1771903321264,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s11390-007-9011-0","type":"journal-article","created":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T18:31:12Z","timestamp":1171045872000},"page":"88-91","source":"Crossref","is-referenced-by-count":26,"title":["Secure Two-Party Point-Circle Inclusion Problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Yong-Long","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu-Sheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"9011_CR1","doi-asserted-by":"crossref","unstructured":"Du W, Zhan Z. A practical approach to solve secure multi-party computation problems. In New Security Paradigms Workshop 2002, Virginia Beach, USA, September 23\u201326, 2002, pp.127\u2013135.","DOI":"10.1145\/844102.844125"},{"key":"9011_CR2","doi-asserted-by":"crossref","unstructured":"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\u201313, 2001, pp.11\u201320.","DOI":"10.1145\/508172.508174"},{"issue":"5","key":"9011_CR3","first-page":"900","volume":"33","author":"Y L Luo","year":"2005","unstructured":"Luo Y L, Huang L S et al. An algorithm for privacy-preserving Boolean association rule mining. Acta Electronica Sinica, 2005, 33(5): 900\u2013903.","journal-title":"Acta Electronica Sinica"},{"issue":"3","key":"9011_CR4","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1360\/crad20060306","volume":"43","author":"Y L Luo","year":"2006","unstructured":"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\u2013416.","journal-title":"Journal of Computer Research and Development"},{"issue":"2","key":"9011_CR5","first-page":"237","volume":"15","author":"Y L Luo","year":"2006","unstructured":"Luo Y L, Huang L S et al. Privacy-preserving distance measurement and its applications. Chinese Journal of Electronics, 2006, 15(2): 237\u2013241.","journal-title":"Chinese Journal of Electronics"},{"key":"9011_CR6","doi-asserted-by":"crossref","unstructured":"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 2125, Springer Verlag, 2001, pp.165\u2013179.","DOI":"10.1007\/3-540-44634-6_16"},{"issue":"2","key":"9011_CR7","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/s11390-005-0258-z","volume":"20","author":"S D Li","year":"2005","unstructured":"Li S D, Dai Y Q. Secure two-party computational geometry. Journal of Computer Science and Technology, 2005, 20(2): 258\u2013263.","journal-title":"Journal of Computer Science and Technology"},{"issue":"2","key":"9011_CR8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TC.2004.1261831","volume":"53","author":"W G Tzeng","year":"2004","unstructured":"Tzeng W G. Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. IEEE Transactions on Computers, 2004, 53(2): 232\u2013240.","journal-title":"IEEE Transactions on Computers"},{"key":"9011_CR9","doi-asserted-by":"crossref","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology\u2014EUROCRYPT\u201999, Lecture Notes in Computer Science 1592, Springer-Verlag, 1999, pp.223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9011_CR10","unstructured":"Benaloh J. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, Kingston, ON, May 1994, pp.120\u2013128."},{"key":"9011_CR11","first-page":"59","volume-title":"Proc. the 5th ACM Conf. Computer and Communications Security","author":"D Naccache","year":"1998","unstructured":"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\u201366."},{"key":"9011_CR12","doi-asserted-by":"crossref","unstructured":"Yao A C. Protocols for secure computations. In Proc. the 23rd Annual IEEE Symp. Foundations of Computer Science, Chicago, USA, 1982, pp.160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"9011_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013127.","DOI":"10.1145\/319709.319726"},{"key":"9011_CR14","doi-asserted-by":"crossref","unstructured":"Fischlin M. A cost-effective pay-per-multiplication comparison method for millionaires. In Progress in Cryptology\u2014CT-RSA 2001: Cryptographers\u2019 Track at RSA Conference, San Francisco: USA, April 8\u201312, 2001, pp.457\u2013472.","DOI":"10.1007\/3-540-45353-9_33"},{"key":"9011_CR15","doi-asserted-by":"crossref","unstructured":"Ioannidis I, Grama A. An efficient protocol for Yao\u2019s millionaires\u2019 problem. In Proc. the 36th Hawaii Int. Conf. System Sciences, Jan. 6\u20139, 2003.","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"9011_CR16","doi-asserted-by":"crossref","unstructured":"Blake I F, Kolesnikov V. Strong condition oblivious transfer and computing on intervals. In Proc. Advances in Cryptology\u2014ASIACRYPT\u201904, LNCS 3329, Jeju Island, Korea, 2004, pp.515\u2013529.","DOI":"10.1007\/978-3-540-30539-2_36"},{"key":"9011_CR17","doi-asserted-by":"crossref","unstructured":"Lin H Y, Tzeng W G. An efficient solution to the millionaires\u2019 problem based on hormomorphic encryption. Lecture notes in Computer Science 3531, Springer-Verlag, 2005, pp.456\u2013466.","DOI":"10.1007\/11496137_31"},{"key":"9011_CR18","unstructured":"Luo Yonglong, Huang Liusheng et al. An efficient private comparison problem. Submitted to IEEE Trans. Dependable and Secure Computation."},{"key":"9011_CR19","doi-asserted-by":"crossref","unstructured":"Goethals B, Laur S, Lipmaa H, Mielik\u00e4inen 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\u2013120.","DOI":"10.1007\/11496618_9"},{"issue":"1","key":"9011_CR20","first-page":"76","volume":"25","author":"L Yonglong","year":"2004","unstructured":"Luo Yonglong, Huang Liusheng et al. A faster algorithm of modular exponentiation in RSA. Chinese Journal of Mini-Micro Systems, 2004, 25(1): 76\u201378.","journal-title":"Chinese Journal of Mini-Micro Systems"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9011-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9011-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9011-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:38Z","timestamp":1559399558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9011-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9011"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9011-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}