{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:16:12Z","timestamp":1740287772357,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262268"},{"type":"electronic","value":"9783540320838"}],"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\/11496618_6","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T20:27:32Z","timestamp":1279052852000},"page":"51-66","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient and Verifiable Solution to the Millionaire Problem"],"prefix":"10.1007","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byoungcheon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-24852-1_36","volume-title":"Applied Cryptography and Network Security","author":"R. Aditya","year":"2004","unstructured":"Aditya, R., Peng, K., Boyd, C., Dawson, E.: Batch verification for equality of discrete logarithms and threshold decryptions. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 494\u2013508. Springer, Heidelberg (2004)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Beaver","year":"2000","unstructured":"Beaver, D.: Minimal-latency secure function evaluation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 335\u2013350. Springer, Heidelberg (2000)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Killian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove intractability assumptions. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: The 6th ACM Conference on Computer and Communications Security (1999), Available at http:\/\/www.tml.hut.fi\/~helger\/crypto\/link\/protocols\/auctions.html","DOI":"10.1145\/319709.319726"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J.: Optimistic fair secure computation (extended abstract). In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 94\u2013112. Springer, Heidelberg (2000)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Damg\u00e5rd, I.B., van de Graaf, J.: Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 87\u2013119. Springer, Heidelberg (1988)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"6_CR12","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)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M.K. Franklin","year":"1996","unstructured":"Franklin, M.K., Haber, S.: Joint encryption and message-efficient secure computation. Journal of Cryptology\u00a09(4), 217\u2013232 (1996)","journal-title":"Journal of Cryptology"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 123\u2013139. Springer, Heidelberg (1999)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, PODC 1998, pp. 101\u2013111 (1987)","DOI":"10.1145\/277697.277716"},{"key":"6_CR16","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: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 143\u2013161. Springer, Heidelberg (2000)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Juels, A., Szydlo, M.: An two-server auction protocol. In: Proc. of Financial Cryptography, pp. 329\u2013340 (2002)","DOI":"10.1007\/3-540-36504-4_6"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45853-0_2","volume-title":"Computer Security - ESORICS 2002","author":"K. Kurosawa","year":"2002","unstructured":"Kurosawa, K., Ogata, W.: Bit-slice auction circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 24\u201338. Springer, Heidelberg (2002)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-40061-5_27","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: Verifiable homomorphic oblivious transfer and private equality test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 416\u2013433. Springer, Heidelberg (2003)"},{"key":"6_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy perserving auctions and mechanism design. In: ACM Conference on Electronic Commerce 1999, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"6_CR25","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 cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Computer Science Department, Aarhus University, Aarhus, Denmark (1992)","DOI":"10.7146\/dpb.v21i388.6621"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-24591-9_19","volume-title":"Information Security Applications","author":"K. Peng","year":"2004","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Efficient implementation of relative bid privacy in sealed-bid auction. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol.\u00a02908, pp. 244\u2013256. Springer, Heidelberg (2004)"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-24632-9_32","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"K. Peng","year":"2004","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: A correct, private, and efficient mix network. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 439\u2013454. Springer, Heidelberg (2004)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, New York, NY, USA, pp. 554\u2013567 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"Schnorr, C.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496618_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:56:05Z","timestamp":1740261365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496618_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262268","9783540320838"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11496618_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}