{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:30:38Z","timestamp":1743082238514,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899938"},{"type":"electronic","value":"9783540899945"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89994-5_12","type":"book-chapter","created":{"date-parts":[[2008,12,8]],"date-time":"2008-12-08T00:41:38Z","timestamp":1228696898000},"page":"142-156","source":"Crossref","is-referenced-by-count":9,"title":["Coding-Based Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Kazukuni","family":"Kobara","sequence":"first","affiliation":[]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[]},{"given":"Raphael","family":"Overbeck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 547\u2013557. Springer, Heidelberg (1990)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEETIT: IEEE Transactions on Information Theory\u00a044 (1998)","DOI":"10.1109\/18.651067"},{"key":"12_CR6","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. Courtois","year":"2001","unstructured":"Courtois, N., 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":"12_CR7","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":"12_CR8","unstructured":"Damg\u00e5rd, I., Nielsen, J.: Commitment schemes and zero-knowledge protocols. Lecture notes, University of Aarhus (February 2008), http:\/\/www.daimi.au.dk\/~ivan\/ComZK08.pdf"},{"key":"12_CR9","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.: 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":"12_CR10","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":"12_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography - Volume 2 (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, Cambridge (2004)"},{"key":"12_CR12","first-page":"218","volume-title":"STOC","author":"O. Goldreich","year":"1987","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, New York (1987)"},{"issue":"6","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometry codes. IEEE Transactions on Information Theory\u00a045(6), 1757\u20131767 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-24638-1_22","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2004","unstructured":"Haitner, I.: Implementing oblivious transfer using collection of dense trapdoor permutations. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 394\u2013409. Springer, Heidelberg (2004)"},{"key":"12_CR15","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. Kalai","year":"2005","unstructured":"Kalai, Y.: Smooth projective hashing and two-message oblivious transfer. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 78\u201395. Springer, Heidelberg (2005)"},{"key":"12_CR16","first-page":"20","volume-title":"STOC","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331. ACM, New York (1988)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_2","volume-title":"Public Key Cryptography","author":"K. Kobara","year":"2001","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems - conversions for McEliece PKC. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992. Springer, Heidelberg (2001)"},{"key":"12_CR18","volume-title":"The Theory of Error-Correctiong Codes","author":"F.J. MacWilliams","year":"1992","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correctiong Codes, 7th edn. North-Holland, Amsterdam (1992)","edition":"7"},{"key":"12_CR19","unstructured":"McEliece, R.J.: A public key cryptosystem based on algebraic coding theory. DSN progress report, 42\u201344, 114\u2013116 (1978)"},{"key":"12_CR20","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"12_CR21","first-page":"289","volume-title":"Designs, Codes and Cryptography","author":"R. Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. In: Charpin, P., Helleseth, T. (eds.) Designs, Codes and Cryptography, vol.\u00a049(1-3), pp. 289\u2013305. Springer, Heidelberg (2008)"},{"issue":"5","key":"12_CR22","first-page":"417","volume":"8","author":"G. Poupard","year":"1997","unstructured":"Poupard, G.: A realistic security analysis of identification schemes based on combinatorial problems. European Transactions on Telecommuncations\u00a08(5), 417\u2013480 (1997)","journal-title":"European Transactions on Telecommuncations"},{"key":"12_CR23","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical report, Aiken Computation Laboratory, Harvard University, Tech. Memo TR-81 (1981)"},{"key":"12_CR24","first-page":"141","volume-title":"Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday","author":"N. Sendrier","year":"2002","unstructured":"Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H. (eds.) Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday, pp. 141\u2013163. Kluwer, Dordrecht (2002)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"12_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001450010005","volume":"14","author":"S. Vaudenay","year":"2001","unstructured":"Vaudenay, S.: Cryptanalysis of the Chor\u2013Rivest cryptosystem. J. Cryptology\u00a014(2), 87\u2013100 (2001)","journal-title":"J. Cryptology"},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News\u00a015(1), 78\u201388 (1983)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Mathematical Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89994-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:58:10Z","timestamp":1557957490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89994-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899938","9783540899945"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89994-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}