{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:23:18Z","timestamp":1792070598140,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262237","type":"print"},{"value":"9783540315421","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496137_31","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T15:14:24Z","timestamp":1285427664000},"page":"456-466","source":"Crossref","is-referenced-by-count":155,"title":["An Efficient Solution to the Millionaires\u2019 Problem Based on Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Hsiao-Ying","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-Guey","family":"Tzeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-30539-2_36","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"I.F. Blake","year":"2004","unstructured":"Blake, I.F., Kolesnikov, V.: Strong conditional oblivious transfer and computing on intervals. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 515\u2013529. Springer, Heidelberg (2004)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/319709.319726","volume-title":"Proceedings of the 6th ACM conference on Computer and communications security - CCS 1999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6th ACM conference on Computer and communications security - CCS 1999, pp. 120\u2013127. ACM Press, New York (1999)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Fischlin","year":"2001","unstructured":"Fischlin, M.: A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 457\u2013472. Springer, Heidelberg (2001)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"31_CR5","first-page":"218","volume-title":"Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (STOC 1987)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play and mental game. In: Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (STOC 1987), pp. 218\u2013229. ACM, New York (1987)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for yao\u2019s millionaires\u2019 problem. In: Proceedings of the 36th Hawaii Internatinal Conference on System Sciences 2003 (2003)","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-30539-2_10","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"B. Schoenmakers","year":"2004","unstructured":"Schoenmakers, B., Tuyls, P.: Practical Two-Party Computation Based on the Conditional Gate. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 119\u2013136. Springer, Heidelberg (2004)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","volume-title":"Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS 1982)","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 160\u2013164. IEEE, Los Alamitos (1982)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/SFCS.1986.25","volume-title":"Proceedings of 27th Annual Symposium on Foundations of Computer Science (FOCS 1986)","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496137_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:42:08Z","timestamp":1558291328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496137_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262237","9783540315421"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11496137_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}