{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:09:26Z","timestamp":1725577766911},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190735"},{"type":"electronic","value":"9783642190742"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19074-2_2","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T05:23:43Z","timestamp":1296797023000},"page":"17-32","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Secure Two-Party Exponentiation"],"prefix":"10.1007","author":[{"given":"Ching-Hua","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to Generate and Exchange Secrets. In: Proc. 27th FOCS, pp. 162\u2013167 (1986)","key":"2_CR1","DOI":"10.1109\/SFCS.1986.25"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In: Proc. 19th STOC, pp. 218\u2013229 (1987)","key":"2_CR2","DOI":"10.1145\/28395.28420"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. 20th STOC, pp. 1\u201310 (1988)","key":"2_CR3","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Crep\u00e9au, C., Damg\u00e5rd, I.: Multiparty Unconditionally Secure Protocols. In: Proc. 20th STOC, pp. 11\u201319 (1988)","key":"2_CR4","DOI":"10.1145\/62212.62214"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","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. Journal of the Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of the Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Secure Two-Party k-Means Clustering. In: Proc. 14th CCS, pp. 486\u2013497 (2007)","key":"2_CR6","DOI":"10.1145\/1315245.1315306"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T.P., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M.I., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"issue":"1","key":"2_CR8","first-page":"59","volume":"1","author":"Y. Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: Secure Multiparty Computation for Privacy-Preserving Data Mining. Journal of the ACM\u00a01(1), 59\u201398 (2009)","journal-title":"Journal of the ACM"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-11799-2_12","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Mikkelsen, G.L.: Efficient Robust and Constant-Round Distributed RSA Key Generation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 183\u2013200. Springer, Heidelberg (2010)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding Cryptography on Oblivious Transfer - Efficiency. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure Arithmetic Computation with No Honest Majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 294\u2013314. Springer, Heidelberg (2009)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: Proc. 18th STOC, pp. 364\u2013369 (1986)","key":"2_CR13","DOI":"10.1145\/12130.12168"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully Homomorphic Encryption using Ideal Lattices. In: Proc. 41st STOC, pp. 169\u2013178 (2009)","key":"2_CR14","DOI":"10.1145\/1536414.1536440"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure computation of the mean and related statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 283\u2013302. Springer, Heidelberg (2005)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11745853_6","volume-title":"Public Key Cryptography - PKC 2006","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based Cryptography (Extended Abstract). In: Proc. 29th STOC, pp. 446\u2013455 (1997)","key":"2_CR20","DOI":"10.1145\/258533.258637"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Goos, G., Hartmanis, J. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","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)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19074-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:14:01Z","timestamp":1559974441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19074-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190735","9783642190742"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19074-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}