{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:43:29Z","timestamp":1762004609383},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,15]],"date-time":"2014-06-15T00:00:00Z","timestamp":1402790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10207-014-0247-8","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T14:05:56Z","timestamp":1403186756000},"page":"73-84","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Information-theoretically secure oblivious polynomial evaluation in the commodity-based model"],"prefix":"10.1007","volume":"14","author":[{"given":"Rafael","family":"Tonicelli","sequence":"first","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Otsuka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,15]]},"reference":[{"key":"247_CR1","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Csisz\u00e1r, I.: On oblivious transfer capacity. ISIT 2007, pp. 2061\u20132064. (2007)","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"247_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). STOC 1997, pp. 446\u2013455. (1997)","DOI":"10.1145\/258533.258637"},{"key":"247_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. CRYPTO 89, 547\u2013557 (1990)","DOI":"10.1007\/0-387-34805-0_48"},{"key":"247_CR4","volume-title":"Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT 2000, LNCS","author":"D Bleichenbacher","year":"2000","unstructured":"Bleichenbacher, D., Nguyen, P.: Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT 2000, LNCS. Springer, New York (2000)"},{"issue":"1\u20133","key":"247_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1016501125022","volume":"26","author":"C Blundo","year":"2002","unstructured":"Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and bounds for unconditionally secure non-interactive commitment schemes. Des Codes Cryptogr 26(1\u20133), 97\u2013110 (2002)","journal-title":"Des Codes Cryptogr"},{"key":"247_CR6","volume-title":"Oblivious Polynomial Evaluation and Oblivious Neural Learning. ASIACRYPT 2001, LNCS","author":"Yan-Cheng Chang","year":"2001","unstructured":"Chang, Yan-Cheng, Lu, Chi-Jen: Oblivious Polynomial Evaluation and Oblivious Neural Learning. ASIACRYPT 2001, LNCS. Springer, New York (2001)"},{"key":"247_CR7","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. EUROCRYPT 1997, pp. 306\u2013317. (1997)","DOI":"10.1007\/3-540-69053-0_21"},{"key":"247_CR8","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. SCN 2004, pp. 47\u201359. (2004)","DOI":"10.1007\/978-3-540-30598-9_4"},{"key":"247_CR9","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Savvides, G., Schaffner, G., Wullschleger, J.: Information-theoretic conditions for two-party secure function evaluation. EUROCRYPT 2006, LNCS, 4004, Springer, Berlin, Heidelberg, pp. 538\u2013554. (2006)","DOI":"10.1007\/11761679_32"},{"key":"247_CR10","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Wullschleger, J.: Statistical security conditions for two-party secure function evaluation. ICITS 2008, LNCS, vol. 5155, pp. 86\u201399. Springer, New York (2008)","DOI":"10.1007\/978-3-540-85093-9_9"},{"key":"247_CR11","doi-asserted-by":"crossref","unstructured":"Dowsley, R., van de Graaf, J., M\u00fcller-Quade, J., Nascimento, A.C.A.: Oblivious transfer based on the McEliece assumptions. ICITS 2008, pp. 107\u2013117. (2008)","DOI":"10.1007\/978-3-540-85093-9_11"},{"issue":"2","key":"247_CR12","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1587\/transfun.E95.A.567","volume":"E95\u2013A","author":"R Dowsley","year":"2012","unstructured":"Dowsley, R., van de Graaf, J., M\u00fcller-Quade, J., Nascimento, A.C.A.: Oblivious transfer based on the McEliece assumptions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E95\u2013A(2), 567\u2013575 (2012)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"247_CR13","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CRYPTO 82, pp. 205\u2013210. (1983)","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"247_CR14","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. TCC 2005, pp. 303\u2013324. (2005)","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"247_CR15","doi-asserted-by":"crossref","unstructured":"Gilboa, N.: Two party RSA key generation. CRYPTO 1999, pp. 116\u2013129. (1999)","DOI":"10.1007\/3-540-48405-1_8"},{"key":"247_CR16","doi-asserted-by":"crossref","unstructured":"Haitner, I.: Implementing oblivious transfer using collection of dense trapdoor permutations. TCC 2004, pp. 394\u2013409. (2004)","DOI":"10.1007\/978-3-540-24638-1_22"},{"key":"247_CR17","doi-asserted-by":"crossref","unstructured":"Hanaoka, G., Imai, H., M\u00fcller-Quade, J., Nascimento, A.C.A., Otsuka, A., Winter, A.: Information theoretically secure oblivious polynomial evaluation: model, bounds, and constructions. ACISP 2004, pp. 62\u201373. (2004)","DOI":"10.1007\/978-3-540-27800-9_6"},{"key":"247_CR18","doi-asserted-by":"crossref","unstructured":"Hanaoka, G., Shikata, J., Zheng, Y., Imai, H.: Unconditionally secure digital signature schemes admitting transferability. ASIACRYPT 2000, LNCS, vol. 1976, pp. 130\u2013142. Springer, New York (2000)","DOI":"10.1007\/3-540-44448-3_11"},{"key":"247_CR19","doi-asserted-by":"crossref","unstructured":"Imai, H., Morozov, K., Nascimento, A.C.A.: On the oblivious transfer capacity of the erasure channel. ISIT 2006, pp. 1428\u20131431. (2006)","DOI":"10.1109\/ISIT.2006.262082"},{"key":"247_CR20","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. EUROCRYPT 2005, pp. 78\u201395. (2005)","DOI":"10.1007\/11426639_5"},{"key":"247_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. STOC 1988, pp. 20\u201331. (1988)","DOI":"10.1145\/62212.62215"},{"key":"247_CR22","doi-asserted-by":"crossref","unstructured":"Matsumoto, T., Imai, H.: On the key predistribution systems. A practical solution to the key distribution problem. CRYPTO 1987, LNCS, vol. 293, pp. 185\u2013193. Springer, New York (1988)","DOI":"10.1007\/3-540-48184-2_14"},{"issue":"19","key":"247_CR23","doi-asserted-by":"crossref","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. J. Cryptol. 15(19), 177\u2013206 (2002)","journal-title":"J. Cryptol."},{"key":"247_CR24","unstructured":"Nascimento, A.C.A., Morozov, K., Imai, H.: Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation. ICITS. (2007)"},{"issue":"6","key":"247_CR25","doi-asserted-by":"crossref","first-page":"2572","DOI":"10.1109\/TIT.2008.921856","volume":"54","author":"ACA Nascimento","year":"2008","unstructured":"Nascimento, A.C.A., Winter, A.: On the oblivious-transfer capacity of noisy resources. IEEE Trans. Inf. Theory 54(6), 2572\u20132581 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"247_CR26","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. STOC 1999, pp. 245\u2013254. (1999)","DOI":"10.1145\/301250.301312"},{"key":"247_CR27","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In 12th annual ACM-SIAM symposium on discrete algorithms, pp. 448\u2013457. (2001)"},{"key":"247_CR28","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. CRYPTO 2008, pp. 554\u2013571. (2008)","DOI":"10.1007\/978-3-540-85174-5_31"},{"issue":"8","key":"247_CR29","doi-asserted-by":"crossref","first-page":"5566","DOI":"10.1109\/TIT.2011.2158898","volume":"57","author":"ACB Pinto","year":"2011","unstructured":"Pinto, A.C.B., Dowsley, R., Morozov, K., Nascimento, A.C.A.: Achieving oblivious transfer capacity of generalized erasure channels in the malicious model. IEEE Trans. Inf. Theory 57(8), 5566\u20135571 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"247_CR30","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard. (1981)"},{"key":"247_CR31","unstructured":"Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using concealing channels and a trusted initializer. Preprint available at http:\/\/people.csail.mit.edu\/rivest\/Rivest-commitment"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0247-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-014-0247-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0247-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:38:31Z","timestamp":1565548711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-014-0247-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1007\/s10207-014-0247-8","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,15]]}}}