{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:40:38Z","timestamp":1794379238653,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540282242","type":"print"},{"value":"9783540317968","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537878_27","type":"book-chapter","created":{"date-parts":[[2010,7,19]],"date-time":"2010-07-19T14:07:07Z","timestamp":1279548427000},"page":"266-273","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Construction of Two-Party Private Bidding Protocols from Yao\u2019s Millionaires Problem"],"prefix":"10.1007","author":[{"given":"Huafei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures (Extended Abstract). In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 591\u2013606. Springer, Heidelberg (1998)"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. IEEE JOurnal on Selected Areas in Communications\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE JOurnal on Selected Areas in Communications"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-46088-8_28","volume-title":"Financial Cryptography","author":"O. Baudron","year":"2002","unstructured":"Baudron, O., Stern, J.: Non-interactive private auctions. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 364\u2013377. Springer, Heidelberg (2002)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient Private Bidding and Auctions with an Oblivious Third Party. In: ACM Conference on Computer and Communications Security, pp. 120\u2013127 (1999)","DOI":"10.1145\/319709.319726"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24638-1_13","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Damg\u00e5rd, I.B.: Secret-key zero-knowlegde and non-interactive verifiable exponentiation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 223\u2013237. Springer, Heidelberg (2004)"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-45664-3_9","volume-title":"Proc. of Public Key Cryptography 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Jurik, M.: Client\/Server Tradeoffs for Online Elections. In: Proc. of Public Key Cryptography 2002, pp. 125\u2013140. Springer, Heidelberg (2002)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"27_CR10","unstructured":"Goldreich, O.: Secure multi-party computation. Manuscript (1998)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th Annual A CM Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistically zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"27_CR13","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":"27_CR14","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"27_CR15","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":"27_CR16","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","volume-title":"Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS 1982)","author":"A. Yao","year":"1982","unstructured":"Yao, A.: Protocols for secure computations. In: Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS 1982), pp. 160\u2013164. IEEE Computer Society, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Trust, Privacy, and Security in Digital Business"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537878_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:12:44Z","timestamp":1605625964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537878_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282242","9783540317968"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11537878_27","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11537878","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}