{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:37Z","timestamp":1742913817343,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319121598"},{"type":"electronic","value":"9783319121604"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12160-4_21","type":"book-chapter","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T11:14:47Z","timestamp":1413630887000},"page":"342-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory"],"prefix":"10.1007","author":[{"given":"K. Preetha","family":"Mathew","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Vasant","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-46035-7_6","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"JH An","year":"2002","unstructured":"An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83\u2013107. Springer, Heidelberg (2002)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45664-3_6","volume-title":"Public Key Cryptography","author":"J Baek","year":"2002","unstructured":"Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, p. 80. Springer, Heidelberg (2002)"},{"key":"21_CR3","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem. CoRR, abs\/1108.2462 (2011)"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jss.2010.09.016","volume":"84","author":"PSLM Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Misoczki, R.: One-time signature scheme from syndrome decoding over generic error-correcting codes. J. Syst. Softw. 84(2), 198\u2013204 (2011). http:\/\/dx.doi.org\/10.1016\/j.jss.2010.09.016","journal-title":"J. Syst. Softw."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., Vantilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR6","unstructured":"Blake, I.F., Studholme, C.: Properties of random matrices and applications (2006). http:\/\/www.cs.utoronto.ca\/~cvs\/coding\/random_report.pdf. Accessed 15 Dec 2006"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","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. IEEE Trans. Inf. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR8","unstructured":"Corbella, I.M., Pellikaan, R.: Error-correcting pairs for a public-key cryptosystem. CoRR, abs\/1205.3647 (2012)"},{"key":"21_CR9","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":"NT 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. 2248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. INRIA Report (2001)","DOI":"10.1007\/3-540-45682-1_10"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-88353-1_6","volume-title":"Research in Cryptology","author":"L Dallot","year":"2008","unstructured":"Dallot, L.: Towards a concrete security proof of courtois, finiasz and sendrier signature scheme. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol. 4945, pp. 65\u201377. Springer, Heidelberg (2008)"},{"key":"21_CR12","unstructured":"Faug\u00e9re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys - toward a complexity analysis. In: SCC \u201910: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pp. 45\u201355. RHUL, June 2010"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J-C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate McEliece cryptosystems. In: IEEE Information Theory Workshop (ITW) (2011)","DOI":"10.1109\/ITW.2011.6089437"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of mceliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-19574-7_11","volume-title":"Selected Areas in Cryptography","author":"M Finiasz","year":"2011","unstructured":"Finiasz, M.: Parallel-CFS: strengthening the CFS McEliece-based signature scheme. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 159\u2013170. Springer, Heidelberg (2011)"},{"key":"21_CR16","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. 5912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-58265-7_4","volume-title":"Error Control, Cryptology, and Speech Compression","author":"EM Gabidulin","year":"1994","unstructured":"Gabidulin, E.M., Kjelsen, O.: How to avoid the Sidel\u2019nikov-Shestakov attack. In: Chmora, A., Wicker, S.B. (eds.) Information Protection 1993. LNCS, vol. 829, pp. 25\u201332. Springer, Heidelberg (1994)"},{"key":"21_CR18","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theor. 15, 159\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theor."},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Cryptography and Coding","author":"G Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.J.M.: A digital signature scheme based on random error-correcting codes. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 161\u2013167. Springer, Heidelberg (1997)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-73408-6_6","volume-title":"Public Key Infrastructure","author":"CK Li","year":"2007","unstructured":"Li, C.K., Yang, G., Wong, D.S., Deng, X., Chow, S.S.M.: An efficient signcryption scheme with key privacy. In: L\u00f3pez, J., Samarati, P., Ferrer, J.L. (eds.) EuroPKI 2007. LNCS, vol. 4582, pp. 78\u201393. Springer, Heidelberg (2007)"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"YX Li","year":"1994","unstructured":"Li, Y.X., Deng, R.H., Wang, X.M.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Trans. Inf. Theory 40(1), 271\u2013274 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36563-X_14","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"J Malone-Lee","year":"2003","unstructured":"Malone-Lee, J., Mao, W.: Two birds one stone: signcryption using RSA. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 211\u2013225. Springer, Heidelberg (2003)"},{"key":"21_CR24","unstructured":"Garey, M., Johnson, D.: Computers and intractability. A guide to the theory of incompleteness (1979)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-25405-5_7","volume-title":"Post-Quantum Cryptography","author":"A Otmani","year":"2011","unstructured":"Otmani, A., Tillich, J.-P.: An efficient attack on all concrete KKS proposals. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 98\u2013116. Springer, Heidelberg (2011)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. pp. 95\u2013137 (2008)","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43, 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR28","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, pp. 114\u2013116 (1978)"},{"key":"21_CR29","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. 7071, pp. 51\u201367. Springer, Heidelberg (2011)"},{"key":"21_CR30","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. 773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: IEEE International Symposium on Information Theory, pp. 1733\u20131737 (2006)","DOI":"10.1109\/ISIT.2006.261651"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BFb0052234","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"Y Zheng","year":"1997","unstructured":"Zheng, Y.: Digital signcryption or how to achieve cost(signature & encryption) $${\\ll }$$ cost(signature) + cost(encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165\u2013179. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology -- ICISC 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12160-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T01:17:22Z","timestamp":1675127842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12160-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319121598","9783319121604"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12160-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}