{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:54Z","timestamp":1742913234161,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_5","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"45-55","source":"Crossref","is-referenced-by-count":0,"title":["Code-Based Public-Key Cryptosystems and Their Applications"],"prefix":"10.1007","author":[{"given":"Kazukuni","family":"Kobara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Earthquake early warning, http:\/\/en.wikipedia.org\/wiki\/Earthquake_Early_Warning_Japan"},{"key":"5_CR2","unstructured":"Dallot, L., Otmani, A., Tillich, J.P.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (2008), http:\/\/arxiv.org\/abs\/0804.0409"},{"key":"5_CR3","unstructured":"Augot, D., Finiasz, M., Gaborit, P., Manuel, S., Sendrier, N.: SHA-3 proposal: FSB. SHA-3 NIST competition (2008)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proc. of IEEE International Symposium on Information Theory, ISIT 2007, pp. 2591\u20132595 (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"T. Berger","year":"2009","unstructured":"Berger, T., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) Progress in Cryptology \u2013 AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009)"},{"key":"5_CR6","unstructured":"Bernstein, D.J.: Code-based public-key cryptography, http:\/\/pqcrypto.org\/code.html"},{"key":"5_CR7","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes (2008), http:\/\/cr.yp.to\/codes\/goppalist-20081107.pdf"},{"key":"5_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)"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1093\/ietisy\/e91-d.5.1457","volume":"E91-D","author":"Y. Cui","year":"2008","unstructured":"Cui, Y., Kobara, K., Matsuura, K., Imai, H.: Lightweight privacy-preserving authentication protocols secure against active attack in an asymmetric way. IEICE Trans.\u00a0E91-D(5), 1457\u20131465 (2008)","journal-title":"IEICE Trans."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Engelbert, D., Overbeck, R.: A summary of McEliece-type cryptosystems and their security. Journal of Mathematical Cryptology, 1 (2007), Previous version, http:\/\/eprint.iacr.org\/2006\/162","DOI":"10.1515\/JMC.2007.009"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Dowsley, R., Muller-Quade, J., Nascimento, A.C.A.: A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model (2008), http:\/\/eprint.iacr.org\/2008\/468","DOI":"10.1007\/978-3-642-00862-7_16"},{"key":"5_CR12","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., Quade, J.M., 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)"},{"key":"5_CR13","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":"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":"5_CR14","unstructured":"Hagiwara, M., Kobara, K., Imai, H.: On the security of McEliece public key cryptosystem with LDPC code (in japanese). In: The 2007 Symposium on Cryptography and Information Security: 2C1-1 (January 2007)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/11535218_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Juels","year":"2005","unstructured":"Juels, A., Weis, S.A.: Authenticating pervasive devices with human protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"key":"5_CR16","unstructured":"Kobara, K., Imai, H.: OAEP++ \u2013 another very simple way to fix the bug in OAEP. In: Proc. of 2002 International Symposium on Information Theory and Its Applications: S6-4-5, pp. 563\u2013566 (2002)"},{"issue":"1","key":"5_CR17","first-page":"74","volume":"E85-A","author":"K. Kobara","year":"2002","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystem. IEICE Trans.\u00a0E85-A(1), 74\u201383 (2002)","journal-title":"IEICE Trans."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Kobara, K., Imai, H.: On the one-wayness against chosen-plaintext attacks on the Loidreau\u2019s modified McEliece PKC. IEEE Trans. on IT\u00a049(12) (2003)","DOI":"10.1109\/TIT.2003.820016"},{"key":"5_CR19","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.) Mathematical Methods in Computer Science. LNCS, vol.\u00a05393, pp. 142\u2013156. Springer, Heidelberg (2008)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/3-540-44448-3_45","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"P. Loidreau","year":"2000","unstructured":"Loidreau, P.: Strengthening McEliece cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 585\u2013598. Springer, Heidelberg (2000)"},{"key":"5_CR21","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, ch.\u00a012, Sec. 3, Pr. 5. North-Holland Mathematical Library, Amsterdam (1977)"},{"key":"5_CR22","unstructured":"Misoczki, R., Barreto, P.: Personal communication (2009)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"SAC 2009","author":"R. Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.: Compact McEliece keys from Goppa codes. In: Rijmen, V. (ed.) SAC 2009. LNCS, vol.\u00a05867. Springer, Heidelberg (2009)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: Proc. of IEEE International Symposium on Information Theory, ISIT 2000, p. 215 (2000)","DOI":"10.1109\/ISIT.2000.866513"},{"key":"5_CR25","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. In: Proc. of WCC 2007, pp. 257\u2013268 (2007)"},{"issue":"2","key":"5_CR26","first-page":"2","volume":"5","author":"A. Perrig","year":"2002","unstructured":"Perrig, A., Canetti, R., Tyger, J.D., Song, D.: The TESLA broadcast authentication protocol. CryptoBytes\u00a05(2), 2\u201313 (Summer\/Fall 2002)","journal-title":"CryptoBytes"},{"issue":"5","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"5_CR29","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)"},{"key":"5_CR30","unstructured":"Suzuki, M., Kobara, K.: Privacy enhancing techniques on RFID systems. In: Development and Implementation of RFID Technology, January 2009, ch.\u00a016, pp. 305\u2013316. IN-TECH (2009) ISBN 978-3-902613-54-7"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. IEEE Trans. on IT\u00a021(6) (1975)","DOI":"10.1109\/TIT.1975.1055449"},{"key":"5_CR32","unstructured":"Umana, V.G., Leander, G.: Practical key recovery attacks on two McEliece variants (2009), http:\/\/eprint.iacr.org\/2009\/509"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Weis, S.A., Sarma, S.E., Rivest, R.L., Engels, D.W.: Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems. In: 1st Annual Conference on Security in Pervasive Computing (2003)","DOI":"10.1007\/978-3-540-39881-3_18"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:53:22Z","timestamp":1740506002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}