{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:44:59Z","timestamp":1725896699693},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314476"},{"type":"electronic","value":"9783642314483"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31448-3_13","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T22:03:32Z","timestamp":1341439412000},"page":"166-179","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model"],"prefix":"10.1007","author":[{"given":"K.","family":"Preetha Mathew","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Vasant","sequence":"additional","affiliation":[]},{"given":"Sridhar","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S. Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient Lattice (H)IBE in the Standard Model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jss.2010.09.016","volume":"84","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Misoczki, R., Simpl\u00edcio Jr., M.A.: One-time signature scheme from syndrome decoding over generic error-correcting codes. Journal of Systems and Software\u00a084(2), 198\u2013204 (2011)","journal-title":"Journal of Systems and Software"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BFb0052237","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"T.A. Berson","year":"1997","unstructured":"Berson, T.A.: Failure of the McEliece Public-Key Cryptosystem under Message-Resend and Related-Message Attack. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 213\u2013220. Springer, Heidelberg (1997)"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-Based Encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 207\u2013222. Springer, Heidelberg (2004)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-00862-7_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"R. Dowsley","year":"2009","unstructured":"Dowsley, R., M\u00fcller-Quade, J., Nascimento, A.C.A.: A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 240\u2013251. Springer, Heidelberg (2009)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Faug\u00e9re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic Cryptanalysis of McEliece variants with compact keys \u2013 toward a complexity analysis. In: SCC 2010: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pp. 45\u201355. RHUL (June 2010)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"13_CR10","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.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J.-B. Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An Efficient Pseudo-random Generator Provably as Secure as Syndrome Decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 245\u2013255. Springer, Heidelberg (1996)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13013-7_17","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"D.M. Freeman","year":"2010","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 279\u2013295. Springer, Heidelberg (2010)"},{"key":"13_CR13","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theor.\u00a015, 159\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theor."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. H\u00e5stad","year":"1988","unstructured":"H\u00e5stad, J.: Solving simultaneous modular equations of low degree. SIAM J. Comput.\u00a017(2), 336\u2013341 (1988)","journal-title":"SIAM J. Comput."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","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. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 19\u201335. Springer, Heidelberg (2001)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","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.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Transactions on Information Theory\u00a040(1), 271\u2013273 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437. ACM (1990)","DOI":"10.1145\/100216.100273"},{"issue":"1-3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R. Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Cryptography\u00a049(1-3), 289\u2013305 (2008)","journal-title":"Des. Codes Cryptography"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork, C. (ed.) STOC, pp. 187\u2013196. ACM (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"R.L. Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM\u00a026(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"key":"13_CR22","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114\u2013116 (1978)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"issue":"5","key":"13_CR24","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 J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31448-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:01:04Z","timestamp":1620129664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31448-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314476","9783642314483"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31448-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}