{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:10:12Z","timestamp":1739466612763,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106279"},{"type":"electronic","value":"9783642106286"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10628-6_28","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T06:41:25Z","timestamp":1259908885000},"page":"430-442","source":"Crossref","is-referenced-by-count":4,"title":["Oblivious Multi-variate Polynomial Evaluation"],"prefix":"10.1007","author":[{"given":"G\u00e9rald","family":"Gavin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marine","family":"Minier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Ben-Ya\u2019akov, Y.: Evaluation of multivariate polynomials and applications, M.Sc. degree in Computer Science, The Open University of Israel (2007)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared rsa keys. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45682-1_22","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"Y.-C. Chang","year":"2001","unstructured":"Chang, Y.-C., Lu, C.-J.: Oblivious polynomial evaluation and oblivious neural learning. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 369\u2013384. Springer, Heidelberg (2001)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11745853_7","volume-title":"Public Key Cryptography - PKC 2006","author":"B. Chevallier-Mames","year":"2006","unstructured":"Chevallier-Mames, B., Paillier, P., Pointcheval, D.: Encoding-free elgamal encryption without random oracles. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 91\u2013104. Springer, Heidelberg (2006)"},{"key":"28_CR6","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., Damgard, 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":"28_CR7","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: CRYPTO, pp. 205\u2013210 (1982)","DOI":"10.1007\/978-1-4757-0602-4_19"},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR9","first-page":"169","volume-title":"STOC","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) STOC, pp. 169\u2013178. ACM, New York (2009)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"28_CR11","first-page":"365","volume-title":"STOC","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377. ACM, New York (1982)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1007\/3-540-48224-5_76","volume-title":"Automata, Languages and Programming","author":"A. Kiayias","year":"2001","unstructured":"Kiayias, A., Yung, M.: Secure games with polynomial expressions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 939\u2013950. Springer, Heidelberg (2001)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"28_CR15","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":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M.J. Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"28_CR17","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory (1981)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for nc1. In: FOCS, pp. 554\u2013567 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"28_CR19","first-page":"162","volume-title":"FOCS","author":"A.C.-C. Yao","year":"1986","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10628-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T16:35:35Z","timestamp":1739464535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10628-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106279","9783642106286"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10628-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}