{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:57:06Z","timestamp":1764997026297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"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_31","type":"book-chapter","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T11:14:47Z","timestamp":1413630887000},"page":"517-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model"],"prefix":"10.1007","author":[{"given":"K.","family":"Preetha Mathew","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Vasant","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"key":"31_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. 6110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes [23], pp. 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic encryption: definitional equivalences and constructions without random oracles. In: Wagner [35], pp. 360\u2013378","DOI":"10.1007\/978-3-540-85174-5_20"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner [35], pp. 335\u2013359","DOI":"10.1007\/978-3-540-85174-5_19"},{"issue":"4","key":"31_CR6","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 51(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33, 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-02181-7_17","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"Y Cui","year":"2009","unstructured":"Cui, Y., Morozov, K., Kobara, K., Imai, H.: Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE. In: Bras-Amor\u00f3s, M., H\u00f8holdt, T. (eds.) AAECC-18 2009. LNCS, vol. 5527, pp. 159\u2013168. Springer, Heidelberg (2009)"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"31_CR10","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. 5473, pp. 240\u2013251. Springer, Heidelberg (2009)"},{"key":"31_CR11","doi-asserted-by":"crossref","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, RHUL, June 2010, pp. 45\u201355 (2010)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"31_CR12","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: Information Theory Workshop (ITW). IEEE (2011)","DOI":"10.1109\/ITW.2011.6089437"},{"key":"31_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":"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":"31_CR14","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":"DM 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. 6056, pp. 279\u2013295. Springer, Heidelberg (2010)"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-28914-9_33","volume-title":"Theory of Cryptography","author":"B Fuller","year":"2012","unstructured":"Fuller, B., O\u2019Neill, A., Reyzin, L.: A unified approach to deterministic encryption: new constructions and a connection to computational entropy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 582\u2013599. Springer, Heidelberg (2012)"},{"key":"31_CR17","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inf. Theor. 15, 159\u2013166 (1986)","journal-title":"Prob. Contr. Inf. Theor."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes [23], pp. 553\u2013571","DOI":"10.1007\/978-3-540-74143-5_31"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-01001-9_34","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"E Kiltz","year":"2009","unstructured":"Kiltz, E., Pietrzak, K., Stam, M., Yung, M.: A new randomness extraction paradigm for hybrid encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 590\u2013609. Springer, Heidelberg (2009)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-28628-8_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K Kurosawa","year":"2004","unstructured":"Kurosawa, K., Desmedt, Y.G.: A new paradigm of hybrid encryption scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 426\u2013442. Springer, Heidelberg (2004)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-36178-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"S Lucks","year":"2002","unstructured":"Lucks, S.: A variant of the Cramer-Shoup cryptosystem for groups of unknown order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 27\u201345. Springer, Heidelberg (2002)"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-31448-3_13","volume-title":"Information Security and Privacy","author":"K Preetha Mathew","year":"2012","unstructured":"Preetha Mathew, K., Vasant, S., Venkatesan, S., Pandu Rangan, C.: An efficient IND-CCA2 secure variant of the Niederreiter encryption scheme in the standard model. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 166\u2013179. Springer, Heidelberg (2012)"},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2007","year":"2007","unstructured":"Menezes, A. (ed.): CRYPTO 2007. LNCS, vol. 4622. Springer, Heidelberg (2007)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-34159-5_1","volume-title":"Research in Cryptology","author":"R Niebuhr","year":"2012","unstructured":"Niebuhr, R., Cayrel, P.-L.: Broadcast attacks against code-based schemes. In: Armknecht, F., Lucks, S. (eds.) WEWoRC 2011. LNCS, vol. 7242, pp. 1\u201317. Springer, Heidelberg (2012)"},{"issue":"1\u20133","key":"31_CR26","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 Cryptogr. 49(1\u20133), 289\u2013305 (2008)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N Patterson","year":"1975","unstructured":"Patterson, N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theor. 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"31_CR28","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":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-38616-9_12","volume-title":"Post-Quantum Cryptography","author":"E Persichetti","year":"2013","unstructured":"Persichetti, E.: Secure and anonymous hybrid encryption from coding theory. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 174\u2013187. Springer, Heidelberg (2013)"},{"key":"31_CR30","unstructured":"Persichetti, E.: On a CCA2-secure variant of McEliece in the standard model. In: IACR Cryptology ePrint Archive (2012). http:\/\/eprint.iacr.org\/2012\/268"},{"key":"31_CR31","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, pp. 114\u2013116 (1978)"},{"key":"31_CR32","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. 5444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"key":"31_CR33","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial time algorithms for discrete logarithms and factoring on a quantum computer. In: ANTS, p. 289 (1994)","DOI":"10.1007\/3-540-58691-1_68"},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Using hash functions as a hedge against chosen ciphertext attack. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 275. Springer, Heidelberg (2000)"},{"key":"31_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","year":"2008","unstructured":"Wagner, D. (ed.): CRYPTO 2008. LNCS, vol. 5157. Springer, Heidelberg (2008)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T04:15:38Z","timestamp":1675829738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12160-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319121598","9783319121604"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12160-4_31","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"}}]}}