{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:37:43Z","timestamp":1649158663873},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018,11,1]]},"DOI":"10.1587\/transinf.2017icp0020","type":"journal-article","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T22:46:56Z","timestamp":1541026016000},"page":"2688-2697","source":"Crossref","is-referenced-by-count":1,"title":["Zero-Knowledge Identification Scheme Using LDPC Codes"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Haruka","family":"ITO","sequence":"first","affiliation":[{"name":"Graduate School of Science and Engineering, Saga University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanori","family":"HIROTOMO","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Engineering, Saga University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youji","family":"FUKUTA","sequence":"additional","affiliation":[{"name":"School of Science and Technology Department of Information Science, Kindai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"MOHRI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Gifu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"SHIRAISHI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] M.B. Barcena and C. Wueest, \u201cInsecurity in Internet of Things,\u201d Symantec Security Response, https:\/\/www.a51.nl\/sites\/default\/files\/pdf\/insecurity-in-the-internet-of-things.pdf, March. 2015."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J. Stern, \u201cA new paradigm for public key identification,\u201d IEEE Trans. Inf. Theory, vol.42, no.6, pp.1757-1768, Nov. 1996. 10.1109\/18.556672","DOI":"10.1109\/18.556672"},{"key":"3","unstructured":"[3] R.J. McEliece, \u201cA public-key cryptosystem based on algebraic coding theory,\u201d DSN Progress Report 42, pp.114-116, 1978."},{"key":"4","unstructured":"[4] H. Niederreiter, \u201cKnapsack-type cryptosystem based on algebraic coding theory,\u201d Problems of Control and Information Theory, vol.15, no.2, pp.157-166, 1986."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Monico, J. Rosenthal, and A. Shokrollahi, \u201cUsing low density parity check codes in the McEliece cryptosystem,\u201d Proc. 2000 IEEE Int. Symp. Inf. Theory (ISIT 2000), Sorrento, Italy, p.215, 2000. 10.1109\/isit.2000.866513","DOI":"10.1109\/ISIT.2000.866513"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Baldi, M. Bodrato, and F. Chiaraluce, \u201cA new analysis of the McEliece cryptosystem based on QC-LDPC codes,\u201d Security and Cryptography for Networks (SCN 2008), R. Ostrovsky, R.D. Prisco, and I. Visconti Eds., Lecture Notes in Computer Science, vol.5229, pp.246-262, Springer, Berlin, Heidelberg, 2008. 10.1007\/978-3-540-85855-3_17","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] R. Misoczki, J.-P. Tillich, N. Sendrier, and P.S.L.M. Barreto, \u201cMDPC-McEliece: New McEliece variants from moderate density parity-check codes,\u201d Proc. 2013 IEEE Int. Symp. Inf. Theory (ISIT 2013), Istanbul, Turkey, pp.2069-2073, 2013. 10.1109\/isit.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"8","unstructured":"[8] A. Fiat and A. Shamir, \u201cHow to prove yourself Practical solutions to identification and signature problems,\u201d Crypto 86, Lecture Notes in Computer Science, vol.263, pp.181-187, 1986."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Gaborit and M. Girault, \u201cLightweight code-based identification and signature,\u201d Proc. 2007 IEEE Int. Symp. Inf. Theory (ISIT 2007), Nice, France, pp.191-195, 2007. 10.1109\/isit.2007.4557225","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] P. V\u00e9ron, \u201cImproved identification schemes based on error-correcting codes,\u201d Applicable Algebra in Engineering, Communication and Computing, vol.8, no.1, pp.57-69, Jan. 1997. 10.1007\/s002000050053","DOI":"10.1007\/s002000050053"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] P.-L. Cayrel, P. V\u00e9ron, and S.M.E.Y. Alaoui, \u201cA zero-knowledge identification scheme based on the q-ary syndrome decoding problem,\u201d Proc. 17th Int. Workshop on Selected Areas in Cryptography (SAC 2010), A. Biryukov, G. Gong, D. Stinson, Eds., Lecture Notes in Computer Science, vol.6544, pp.171-186, Springer, Berlin, Heidelberg, 2011. 10.1007\/978-3-642-19574-7_12","DOI":"10.1007\/978-3-642-19574-7_12"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Hu, K. Morozov, and T. Takagi, \u201cOn zero-knowledge identification based on q-ary syndrome decoding,\u201d Proc. 8th Asia Joint Conference on Information Security (AsiaJCIS 2013), Seoul, South Korea, pp.12-18, July 2013. 10.1109\/asiajcis.2013.10","DOI":"10.1109\/ASIAJCIS.2013.10"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] C. Aguilar, P. Gaborit, and J. Schrek, \u201cA new zero-knowledge code based identification scheme with reduced communication,\u201d Proc. 2011 IEEE Information Theory Workshop (ITW 2011), Paraty, Brazil, pp.648-652, Oct. 2011. 10.1109\/itw.2011.6089577","DOI":"10.1109\/ITW.2011.6089577"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] E. Berlekamp, R. McEliece, and H. van Tilborg, \u201cOn the inherent intractability of certain coding problems,\u201d IEEE Trans. Inf. Theory, vol.24, no.3, pp.384-386, May 1978. 10.1109\/tit.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] R.G. Gallager, Low Density Parity Check Codes, Cambridge, MA: MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Stern, \u201cA method for finding codewords of small weight,\u201d Coding Theory and Applicatins 1988, G. Cohen and J. Wolfmann Eds., Lecture Notes in Computer Science, vol.388, pp.106-113, New York: Springer-Verlag, 1989.","DOI":"10.1007\/BFb0019850"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] F. Chabaud, \u201cOn the security of some cryptosystems based on error-correcting codes,\u201d Advances in Cryptology-EUROCRYPT'94, Lecture Notes in Computer Science, vol.950, pp.131-139, Springer, Berlin, Heidelberg, 1995. 10.1007\/bfb0053430","DOI":"10.1007\/BFb0053430"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Canteaut and N. Sendrier, \u201cCryptanalysis of the original McEliece cryptosystem,\u201d Advances in Cryptology-ASIACRYPT'98, Lecture Notes in Computer Science, vol.1514, pp.187-199, Springer, Berlin, Heidelberg, 1998. 10.1007\/3-540-49649-1_16","DOI":"10.1007\/3-540-49649-1_16"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] A. Canteaut and F. Chabaud, \u201cA new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511,\u201d IEEE Trans. Inf. Theory, vol.44, no.1, pp.367-378, Jan. 1998. 10.1109\/18.651067","DOI":"10.1109\/18.651067"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] D.J. Bernstein, T. Lange, and C. Peters, \u201cAttacking and defending the McEliece cryptosystem,\u201d Post-Quantum Cryptography (PQCrypto 2008), J. Buchmann and J. Ding Eds., Lecture Notes in Computer Science, vol.5299, pp.31-46, Springer, Berlin, Heidelberg, 2008. 10.1007\/978-3-540-88403-3_3","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] D.J. Bernstein, T. Lange, and C. Peters, \u201cSmaller decoding exponents: Ball-collision decoding,\u201d Advances in Cryptology (CRYPTO 2011), P. Rogaway Ed., Lecture Notes in Computer Science, vol.6841, pp.743-760, Springer, Berlin, Heidelberg, 2011. 10.1007\/978-3-642-22792-9_42","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Repka and P. Zajac, \u201cOverview of the Mceliece cryptosystem and its security,\u201d Journal of Slovak Academy of Sciences, vol.60, no.1, pp.57-83, Sept. 2014. 10.2478\/tmmp-2014-0025","DOI":"10.2478\/tmmp-2014-0025"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/11\/E101.D_2017ICP0020\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,14]],"date-time":"2020-11-14T12:08:05Z","timestamp":1605355685000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/11\/E101.D_2017ICP0020\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017icp0020","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,1]]}}}