{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:43:46Z","timestamp":1780069426867,"version":"3.54.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T00:00:00Z","timestamp":1204761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10623-008-9175-9","type":"journal-article","created":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T17:00:58Z","timestamp":1204736458000},"page":"289-305","source":"Crossref","is-referenced-by-count":85,"title":["Semantic security for the McEliece cryptosystem without random oracles"],"prefix":"10.1007","volume":"49","author":[{"given":"Ryo","family":"Nojima","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazukuni","family":"Kobara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,3,6]]},"reference":[{"key":"9175_CR1","doi-asserted-by":"crossref","unstructured":"Bellare M., Rogaway P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of CCS, pp. 62\u201373 (1993).","DOI":"10.1145\/168588.168596"},{"key":"9175_CR2","unstructured":"Bellare M., Rogaway P.: Optimal asymmetric encryption \u2013 how to encrypt with RSA. In: EUROCRYPT \u201994, LNCS vol. 950, pp. 92\u2013111 (1995)."},{"key":"9175_CR3","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. Berlekamp","year":"1978","unstructured":"Berlekamp E., McEliece R.J., van Tilborg H.C.A. (1978). On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24, 384\u2013386","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9175_CR4","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum A., Kalai A., Wasserman H. (2003). Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4): 506\u2013519","journal-title":"J. ACM"},{"issue":"1","key":"9175_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut A., Chabaud F. (1998). A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511. IEEE Trans. Inform. Theory 44(1): 367\u2013378","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9175_CR6","doi-asserted-by":"crossref","unstructured":"Cayrel P.-L., Gaborit P., Girault M.: Identity based identification and signature schemes using correcting codes. In: WCC \u201907, pp. 69\u201378 (2007).","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"9175_CR7","doi-asserted-by":"crossref","unstructured":"Courtois N., Finiasz M., Sendrier N.: How to achieve a McEliece-based digital signature scheme. In: Asiacrypt \u201901, LNCS vol. 2248, pp. 157\u2013174 (2001).","DOI":"10.1007\/3-540-45682-1_10"},{"key":"9175_CR8","doi-asserted-by":"crossref","unstructured":"Cramer R., Shoup V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Crypto \u201998, LNCS vol. 1462, pp. 13\u201325 (1998).","DOI":"10.1007\/BFb0055717"},{"issue":"4","key":"9175_CR9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El Gamal","year":"1985","unstructured":"El Gamal T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31(4): 469\u2013472","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9175_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1515\/JMC.2007.009","volume":"1","author":"D. Engelbert","year":"2007","unstructured":"Engelbert D., Overbeck R., Schmidt A. (2007). A summary of McEliece-type cryptosystems and their security. J. Math. Cryptol. 1(2): 151\u2013199","journal-title":"J. Math. Cryptol."},{"key":"9175_CR11","unstructured":"Fischer J.-B., Stern J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Eurocrypt \u201996, LNCS vol. 1070, pp. 245\u2013255 (1996)."},{"key":"9175_CR12","doi-asserted-by":"crossref","unstructured":"Fujisaki E., Okamoto T.: Secure integration of asymmetric and symmetric encryption schemes. In: Crypto \u201999, LNCS vol. 1666, pp. 537\u2013554 (1999).","DOI":"10.1007\/3-540-48405-1_34"},{"key":"9175_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich O.: Foundation of Cryptography, Basic Tools. Cambridge University Press (2001).","DOI":"10.1017\/CBO9780511546891"},{"key":"9175_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich O., Levin L.A.: A hard-core predicate for all one-way functions. In: STOC \u201989, pp. 25\u201332 (1989).","DOI":"10.1145\/73007.73010"},{"key":"9175_CR15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S., Micali S. (1984). Probabilistic encryption. J. Comp. Syst. Sci. 28, 270\u2013299","journal-title":"J. Comp. Syst. Sci."},{"key":"9175_CR16","unstructured":"Katz J., Shin J.S.: Parallel and concurrent security of the HB and HB+ protocols. In: Eurocrypt \u201906, LNCS vol. 4004, pp. 73\u201387 (2006)."},{"key":"9175_CR17","doi-asserted-by":"crossref","unstructured":"Kabatiansky G., Krouk E., Semenov S.: Error Correcting Codes and Security for Data Networks. Wiley (2005).","DOI":"10.1002\/0470867574"},{"key":"9175_CR18","unstructured":"Kobara K., Imai H.: Semantically secure McEliece public-key cryptosystems \u2013 conversions for McEliece PKC. In: PKC \u201901, LNCS vol. 1992, pp. 19\u201335 (2001)."},{"issue":"5","key":"9175_CR19","doi-asserted-by":"crossref","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J.S. Leon","year":"2001","unstructured":"Leon J.S. (2001). A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory 34(5): 1354\u20131359","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9175_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"Y.X. Li","year":"1994","unstructured":"Li Y.X., Deng R.H., Wang X.M. (1994). The equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Trans. Inform. Theory 40, 271\u2013273","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"9175_CR21","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P. Loidreau","year":"2001","unstructured":"Loidreau P., Sendrier N. (2001). Weak keys in the McEliece public-key cryptosystem. IEEE Trans. Inform. Theory 47(3): 1207\u20131211","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9175_CR22","unstructured":"McEliece R.J.: The theory of information and coding. In: The Encyclopedia of Mathematics and Its Applications, vol. 3. Addison-Wesley (1977)."},{"key":"9175_CR23","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Network Prog. Rep. (1978)."},{"issue":"2","key":"9175_CR24","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter H. (1986). Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inform. Theory 15(2): 159\u2013166","journal-title":"Prob. Control Inform. Theory"},{"key":"9175_CR25","unstructured":"Paillier P.: Public-key cryptosystem based on discrete logarithm residues. In: Eurocrypt \u201999, LNCS vol. 1592, pp. 223\u2013238 (1999)."},{"key":"9175_CR26","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E. Petrank","year":"1997","unstructured":"Petrank E., Roth R.M. (1997). Is code equivalence easy to decide?. IEEE Trans. Inform. Theory 43, 1602\u20131604","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9175_CR27","doi-asserted-by":"crossref","unstructured":"Pointcheval D.: Chosen-ciphertext security for any one-way cryptosystem. In: PKC \u201900, LNCS vol. 1751, pp. 129\u2013146 (2000).","DOI":"10.1007\/978-3-540-46588-1_10"},{"issue":"4","key":"9175_CR28","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier N. (2000). Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inform. Theory 46(4): 1193\u20131203","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9175_CR29","doi-asserted-by":"crossref","unstructured":"Shoup V.: OAEP reconsidered. In: Crypto \u201901, LNCS vol. 2139, pp. 239\u2013259 (2001).","DOI":"10.1007\/3-540-44647-8_15"},{"key":"9175_CR30","doi-asserted-by":"crossref","unstructured":"Stern J.: A method for finding codewords of small weight. In: Coding Theory and Applications, LNCS vol. 388, pp. 106\u2013113 (1989).","DOI":"10.1007\/BFb0019850"},{"key":"9175_CR31","doi-asserted-by":"crossref","unstructured":"Suzuki M., Kobara K., Imai H.: Privacy enhanced and light weight RFID system without tag synchronization and exhaustive search. In: IEEE SMC (2006).","DOI":"10.1109\/ICSMC.2006.384886"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9175-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9175-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9175-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:09Z","timestamp":1559231409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9175-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,6]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9175"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9175-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,6]]}}}