{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:33:14Z","timestamp":1725672794966},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291005"},{"type":"electronic","value":"9783642291012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29101-2_10","type":"book-chapter","created":{"date-parts":[[2012,4,2]],"date-time":"2012-04-02T04:10:23Z","timestamp":1333339823000},"page":"144-157","source":"Crossref","is-referenced-by-count":1,"title":["A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions"],"prefix":"10.1007","author":[{"given":"Preetha Mathew","family":"K.","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Vasant","sequence":"additional","affiliation":[]},{"given":"Sridhar","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard [5], pp. 547\u2013557","DOI":"10.1007\/0-387-34805-0_48"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., Mceliece, R.J., Vantilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"10_CR3","unstructured":"Bernstein, D.J.: List decoding for binary goppa codes (2008)"},{"key":"10_CR4","volume-title":"Post Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography, 1st edn. Springer, Heidelberg (2008) (incorporated)","edition":"1"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","year":"1990","unstructured":"Brassard, G. (ed.): CRYPTO 1989. LNCS, vol.\u00a0435. Springer, Heidelberg (1990)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: FOCS, pp. 168\u2013173. IEEE (1986)","DOI":"10.1109\/SFCS.1986.26"},{"key":"10_CR7","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate mceliece cryptosystems"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.T. Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to Achieve a McEliece-Based Digital Signature Scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between Two Flavours of Oblivious Transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-85093-9_11","volume-title":"Information Theoretic Security","author":"R. Dowsley","year":"2008","unstructured":"Dowsley, R., van de Graaf, J., M\u00fcller-Quade, J., Nascimento, A.C.A.: Oblivious Transfer Based on the McEliece Assumptions. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 107\u2013117. Springer, Heidelberg (2008)"},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) STOC, pp. 25\u201332. ACM (1989)","DOI":"10.1145\/73007.73010"},{"key":"10_CR14","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: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2008","unstructured":"Haitner, I.: Semi-honest to Malicious Oblivious Transfer\u2014The Black-Box Way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 412\u2013426. Springer, Heidelberg (2008)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11426639_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"Y.T. Kalai","year":"2005","unstructured":"Kalai, Y.T.: Smooth Projective Hashing and Two-Message Oblivious Transfer. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 78\u201395. Springer, Heidelberg (2005)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-89994-5_12","volume-title":"Mathematical Methods in Computer Science","author":"K. Kobara","year":"2008","unstructured":"Kobara, K., Morozov, K., Overbeck, R.: Coding-Based Oblivious Transfer. In: Calmet, J., Geiselmann, W., M\u00fcller-Quade, J. (eds.) MMICS 2008. LNCS, vol.\u00a05393, pp. 142\u2013156. Springer, Heidelberg (2008)"},{"key":"10_CR19","first-page":"448","volume-title":"Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2011","author":"K. Morozov","year":"2011","unstructured":"Morozov, K., Savvides, G.: Efficient computational oblivious transfer using interactive hashing. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2011, pp. 448\u2013452. ACM, New York (2011)"},{"key":"10_CR20","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":"10_CR21","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","volume":"18","author":"M. Naor","year":"2005","unstructured":"Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryptology\u00a018(1), 1\u201335 (2005)","journal-title":"J. Cryptology"},{"key":"10_CR23","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. In: AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 155\u2013169 (1991)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A Framework for Efficient and Composable Oblivious Transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork, C. (ed.) STOC, pp. 187\u2013196. ACM (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"10_CR26","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"10_CR27","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114\u2013116 (1978)"},{"key":"10_CR28","first-page":"178","volume":"42","author":"A. Salomaa","year":"1990","unstructured":"Salomaa, A., Santean, L.: Secret selling of secrets with several buyers. Bulletin of the EATCS\u00a042, 178\u2013186 (1990)","journal-title":"Bulletin of the EATCS"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/inco.1995.1121","volume":"121","author":"A. Santis De","year":"1995","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G.: Zero-knowledge arguments and public-key cryptography. Inf. Comput.\u00a0121(1), 23\u201340 (1995)","journal-title":"Inf. Comput."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: The tightness of security reductions in code-based cryptography. In: 2011 IEEE Information Theory Workshop (ITW), pp. 415\u2013419 (October 2011)","DOI":"10.1109\/ITW.2011.6089492"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N. Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding One Out of Many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 51\u201367. Springer, Heidelberg (2011)"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels (extended abstract). In: Brassard [5], pp. 606\u2013609","DOI":"10.1007\/0-387-34805-0_54"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-58691-1_68","volume-title":"Algorithmic Number Theory","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Polynominal Time Algorithms for Discrete Logarithms and Factoring on a Quantum Computer. In: Adleman, L.M., Huang, M.-D.A. (eds.) ANTS 1994. LNCS, vol.\u00a0877, p. 289. Springer, Heidelberg (1994)"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"issue":"2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/TC.2004.1261831","volume":"53","author":"W.-G. Tzeng","year":"2004","unstructured":"Tzeng, W.-G.: Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. IEEE Trans. Computers\u00a053(2), 232\u2013240 (2004)","journal-title":"IEEE Trans. Computers"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-540-40061-5_32","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Wang","year":"2003","unstructured":"Wang, H., Pieprzyk, J.: Efficient One-Time Proxy Signatures. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 507\u2013522. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29101-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:32Z","timestamp":1620127412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29101-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291005","9783642291012"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29101-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}