{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:12:19Z","timestamp":1777475539500,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11432-009-0109-6","type":"journal-article","created":{"date-parts":[[2009,6,8]],"date-time":"2009-06-08T05:23:53Z","timestamp":1244438633000},"page":"974-982","source":"Crossref","is-referenced-by-count":10,"title":["Symmetric cryptographic protocols for extended millionaires\u2019 problem"],"prefix":"10.1007","volume":"52","author":[{"given":"ShunDong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DaoShun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiQi","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,9]]},"reference":[{"key":"109_CR1","first-page":"160","volume-title":"Proceedings of the 23th IEEE Symposium on Foundations of Computer Science","author":"Y. Yao","year":"1982","unstructured":"Yao Y. Protocols for secure computations. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, Los Alamitos: IEEE Computer Society Press, 1982. 160\u2013164"},{"key":"109_CR2","first-page":"419","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027)","author":"M. J. Freedman","year":"2004","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Cachin C, ed. Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027). New York: Springer-Verlag, 2004. 1\u201355, 419\u2013473"},{"key":"109_CR3","first-page":"21","volume-title":"Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing","author":"S. Goldwasser","year":"1997","unstructured":"Goldwasser S. Multiparty computations: Past and present. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997. 21\u201324"},{"key":"109_CR4","first-page":"218","volume-title":"Proceedings of the 19th Annual ACM Conference on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich O, Micali S, Wigderson A. How to play ANY mental game. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987. 218\u2013229"},{"key":"109_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich O. The Foundations of Cryptography-Volume 2. London: Cambridge University Press, 2004"},{"issue":"5","key":"109_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin R, Naor M, Winkler P. Comparing information without leaking it. Commun ACM, 1996, 39(5): 77\u201385","journal-title":"Commun ACM"},{"issue":"3","key":"109_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell Y, Pinkas B. Privacy preserving data mining. J Crypt, 2002, 15(3): 177\u2013206","journal-title":"J Crypt"},{"key":"109_CR8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.ins.2006.08.010","volume":"177","author":"S. Zhong","year":"2007","unstructured":"Zhong S. Privacy-preserving algorithms for distributed mining of frequent item sets. Inf Sci, 2007, 177): 490\u2013503","journal-title":"Inf Sci"},{"key":"109_CR9","first-page":"273","volume-title":"Proceedings of the 14th IEEE Computer Security Workshop","author":"W. L. Du","year":"2001","unstructured":"Du W L, Atallah M J. Privacy-preserving cooperative scientific computations. In: Proceedings of the 14th IEEE Computer Security Workshop. Los Alamitos: IEEE Computer Society Press, 2001. 273\u2013282"},{"key":"109_CR10","volume-title":"The 7th ACM Conference on Computer and Communication Security, The First Workshop on Security and Privacy in E-Commerce","author":"W. L. Du","year":"2000","unstructured":"Du W L, Atallah M J. Protocol for secure remote database access with approximate matching. In: The 7th ACM Conference on Computer and Communication Security, The First Workshop on Security and Privacy in E-Commerce. New York: ACM Press, 2000. available at http:\/\/www.cis.syr.edu\/wedu\/Research\/publication.html [2005-02-25]"},{"key":"109_CR11","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/319709.319726","volume-title":"Proceedings of the 6th ACM Conference on Computer and Communication Security","author":"C. Cachin","year":"1999","unstructured":"Cachin C. Efficient private bidding and auction with an obvious third party. In: Proceedings of the 6th ACM Conference on Computer and Communication Security. New York: ACM Press, 1999. 120\u2013127"},{"key":"109_CR12","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.ins.2004.12.008","volume":"177","author":"D. H. Shih","year":"2006","unstructured":"Shih D H, Huang H Y, Yen D C. A secure reverse Vickrey auction scheme with bid privacy. Inf Sci, 2006, 177): 550\u2013564","journal-title":"Inf Sci"},{"key":"109_CR13","unstructured":"Du W L, Han Y H S, Chen S G. Privacy-preserving multivariate statistical analysis: linear regression and classification. In: Proceedings of 2004 SIAM International Conference on Data Mining. Society for Industrial & Applied, 2004. 222\u2013233"},{"key":"109_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Seventh International Workshop on Algorithms and Data Structures (LNCS2125)","author":"J. Atallah","year":"2001","unstructured":"Atallah J, Du W L. Secure multiparty computational geometry. In: Seventh International Workshop on Algorithms and Data Structures (LNCS2125). New York: Springer-verlag, 2001. 165\u2013179"},{"issue":"2","key":"109_CR15","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. J Comput Sci Tech, 2005, 20(2): 258\u2013263","journal-title":"J Comput Sci Tech"},{"issue":"10","key":"109_CR16","first-page":"1692","volume":"47","author":"S. D. Li","year":"2007","unstructured":"Li S D, Dai Y Q, Wang D S, et al. Secure multiparty computation of some geometric intersection problems. J Tsinghua Univ, 2007, 47(10): 1692\u20131695","journal-title":"J Tsinghua Univ"},{"key":"109_CR17","first-page":"1","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027)","author":"M. J. Freedman","year":"2004","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027). New York: Springer-Verlag, 2004. 1\u201319"},{"key":"109_CR18","first-page":"13","volume-title":"Proceedings of New Security Paradigms Workshop 2001","author":"W. L. Du","year":"2001","unstructured":"Du W L, Atallah M J. secure multiparty computation problems and their applications: a review and open problems. In: Proceedings of New Security Paradigms Workshop 2001. New York: ACM Press, 2001. 13\u201322"},{"key":"109_CR19","first-page":"205","volume-title":"Proceedings of the 36th Hawaii International Conference on System Science","author":"I. Ioannidis","year":"2003","unstructured":"Ioannidis I, Grama A. An efficient protocol for Yao\u2019s millionaires\u2019 problem. In: Proceedings of the 36th Hawaii International Conference on System Science. Los Alamitos: IEEE Computer Society Press, 2003. 205"},{"issue":"9","key":"109_CR20","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1080\/10020070512331343020","volume":"15","author":"S. D. Li","year":"2005","unstructured":"Li S D, Dai Y Q, You Q Y. Efficient secure multiparty computation protocol for Yao\u2019s millionaires\u2019 problem based on setinclusion. Prog Nat Sci, 2005, 15(9): 851\u2013856","journal-title":"Prog Nat Sci"},{"issue":"5","key":"109_CR21","first-page":"769","volume":"33","author":"S. D. Li","year":"2005","unstructured":"Li S D, Dai Y Q, You Q Y. Efficient solution to Yao\u2019s millionaires\u2019 problem. Electr Sin, 2005, 33(5): 769\u2013773","journal-title":"Electr Sin"},{"key":"109_CR22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.ins.2007.07.015","volume":"178","author":"S. D. Li","year":"2008","unstructured":"Li S D, Wang D S, Dai Y Q, et al. Symmetric cryptographic solution to Yao\u2019s millionaires\u2019 problem and an evaluation of secure multiparty computations. Inf Sci, 2008, 178): 244\u2013255","journal-title":"Inf Sci"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0109-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-009-0109-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0109-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T03:54:41Z","timestamp":1633578881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-009-0109-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s11432-009-0109-6","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}