{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:58:12Z","timestamp":1743062292044,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642179549"},{"type":"electronic","value":"9783642179556"}],"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-17955-6_25","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T20:29:00Z","timestamp":1295209740000},"page":"337-350","source":"Crossref","is-referenced-by-count":14,"title":["A Two-Party Protocol with Trusted Initializer for Computing the Inner Product"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Dowsley","sequence":"first","affiliation":[]},{"given":"Jeroen","family":"van de Graaf","sequence":"additional","affiliation":[]},{"given":"Davidson","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/258533.258637","volume-title":"STOC 1997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: STOC 1997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 446\u2013455. ACM, New York (1997)"},{"key":"25_CR2","first-page":"136","volume-title":"FOCS","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, p. 136. IEEE Computer Society, Los Alamitos (2001)"},{"key":"25_CR3","unstructured":"Du., W.: A study of several specific secure two-party computation problems. PhD thesis, Purdue University, West-Lafayette, Indiana (2001)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T.G., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11496618_9","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B. Goethals","year":"2005","unstructured":"Goethals, B., Laur, S., Lipmaa, H., Mielik\u00e4inen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"key":"25_CR6","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":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-48184-2_14","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: On the key predistribution system: A practical solution to the key distribution problem. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 185\u2013193. Springer, Heidelberg (1988)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R. Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 404\u2013418. Springer, Heidelberg (2007)"},{"key":"25_CR9","unstructured":"Nascimento, A., Tonicelli, R., Otsuka, A., Hanaoka, G., Imai, H., Winter, A.: Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds and Constructions (2008) (manuscript)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-24852-1_26","volume-title":"Applied Cryptography and Network Security","author":"A.C.A. Nascimento","year":"2004","unstructured":"Nascimento, A.C.A., M\u00fcller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Unconditionally non-interactive verifiable secret sharing secure against faulty majorities in the commodity based model. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 355\u2013368. Springer, Heidelberg (2004)"},{"key":"25_CR11","unstructured":"Rivest, R.: Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer (1999), \n                    \n                      http:\/\/people.csail.mit.edu\/rivest\/Rivest-commitment.pdf"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26, pp. 639\u2013644. ACM, New York (2002)"},{"key":"25_CR13","first-page":"160","volume-title":"23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, EUA","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, EUA, November 3-5, pp. 160\u2013164. IEEE, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17955-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:47:26Z","timestamp":1558295246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17955-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642179549","9783642179556"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17955-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}