{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:53:30Z","timestamp":1779900810920,"version":"3.53.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030971304","type":"print"},{"value":"9783030971311","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-97131-1_11","type":"book-chapter","created":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T20:35:11Z","timestamp":1645907711000},"page":"316-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Security Notion for\u00a0PKC in\u00a0the\u00a0Standard Model: Weaker, Simpler, and\u00a0Still Realizing Secure Channels"],"prefix":"10.1007","author":[{"given":"Wasilij","family":"Beskorovajnov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roland","family":"Gr\u00f6ll","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Astrid","family":"Ottenhues","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rebecca","family":"Schwerdt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,27]]},"reference":[{"key":"11_CR1","unstructured":"Badertscher, C., Maurer, U., Portmann, C., Rito, G.: Revisiting (R)CCA security and replay protection. IACR Cryptol, pp. 177 (2020). ePrint Arch. 2020. https:\/\/eprint.iacr.org\/2020\/177"},{"key":"11_CR2","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). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_3"},{"key":"11_CR3","unstructured":"Beskorovajnov, W., Groll, R., Muller-Quade, J., Ottenhues, A., Schwerdt, R.: A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels, cryptology. ePrint Archive, Report 2021\/1649 (2021). https:\/\/ia.cr\/2021\/1649"},{"key":"11_CR4","unstructured":"Bogos, S., Tramer, F., Vaudenay, S.: On solving LPN using BKW and variants. IACR Cryptol. ePrint Arch. (2015). http:\/\/eprint.iacr.org\/2015\/049"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36(5), 1301\u20131328 (2007)","journal-title":"SIAM J. Comput."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-30574-3_8","volume-title":"Topics in Cryptology","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Katz, J.: Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 87\u2013103. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_8"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Callas, J., Donnerhacke, L., Finney, H., Shaw, D., Thayer, R.: OpenPGP Message Format. RFC 4880, pp. 1\u201390 (2007). https:\/\/doi.org\/10.17487\/RFC4880","DOI":"10.17487\/RFC4880"},{"key":"11_CR8","unstructured":"Canetti, R.: Security and Composition of Multi-party Cryptographic Protocols, Cryptology ePrint Archive, Report 1998\/018 (1998). https:\/\/eprint.iacr.org\/1998\/018"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11_CR10","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited, Cryptology ePrint Archive, Report 1998\/011 (1998). https:\/\/eprint.iacr.org\/1998\/011"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-540-45146-4_33","volume-title":"Advances in Cryptology","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565\u2013582. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_33"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_16"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/978-3-030-01950-1_46","volume-title":"Information and Communications Security","author":"H Cheng","year":"2018","unstructured":"Cheng, H., Li, X., Qian, H., Yan, D.: Simpler CCA secure PKE from LPN problem without double-trapdoor. In: Naccache, D., Xu, S., Qing, S., Samarati, P., Blanc, G., Lu, R., Zhang, Z., Meddahi, A. (eds.) ICICS 2018. LNCS, vol. 11149, pp. 756\u2013766. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01950-1_46"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Chow, S.S.M., Franklin, M.K., Zhang, H.: Practical dual-receiver encryption - soundness, complete non-malleability, and applications. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, pp. 85\u2013105. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3319-04852-9","DOI":"10.1007\/978-3319-04852-9"},{"issue":"1","key":"11_CR15","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(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR16","unstructured":"Damgard, I., Park, S.: Is Public-Key Encryption Based on LPN Practical? IACR Cryptol. ePrint Arch. (2012). http:\/\/eprint.iacr.org\/2012\/699"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Diament, T., Lee, H.K., Keromytis, A.D., Yung, M.: The dual receiver cryptosystem and its applications. In: Atluri, V., Pfitzmann, B., McDaniel, P. (eds.) ACM CCS 2004, pp. 330\u2013343. ACM Press (2004). https:\/\/doi.org\/10.1145\/1030083","DOI":"10.1145\/1030083"},{"issue":"6","key":"11_CR18","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 Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR19","unstructured":"Dottling, N., Dowsley, R., Mxiller-Quade, J., Nascimento, A.C.A.: A CCA2 Secure Variant of the McEliece Cryptosystem, Cryptology ePrint Archive, Report 2008\/468 (2008). https:\/\/eprint.iacr.org\/2008\/468"},{"key":"11_CR20","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","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). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_17"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/11681878_30","volume-title":"Theory of Cryptography","author":"E Kiltz","year":"2006","unstructured":"Kiltz, E.: Chosen-ciphertext security from tag-based encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 581\u2013600. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_30"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54631-0_1","volume-title":"Public-Key Cryptography","author":"E Kiltz","year":"2014","unstructured":"Kiltz, E., Masny, D., Pietrzak, K.: Simple chosen-ciphertext security from low-noise LPN. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 1\u201318. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_1"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology","author":"E Kiltz","year":"2010","unstructured":"Kiltz, E., Mohassel, P., O\u2019Neill, A.: Adaptive trapdoor functions and chosen-ciphertext security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 673\u2013692. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_34"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"MacKenzie, P.D., Reiter, M.K., Yang, K.: Alternatives to non-malleability: definitions, constructions, and applications (extended ebstract). In: Naor, M. (ed.) TCC 2004. LNCS, pp. 171\u2013190. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/9783-540-24638-1","DOI":"10.1007\/9783-540-24638-1"},{"issue":"1\u20133","key":"11_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/sl0623-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). https:\/\/doi.org\/10.1007\/sl0623-008-9175-9","journal-title":"Des. Codes Cryptogr."},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Peikert, C, Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 187\u2013196. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374406","DOI":"10.1145\/1374376.1374406"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Rackoff, O., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, pp. 433\u2013444. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-l_35","DOI":"10.1007\/3-540-46766-l_35"},{"key":"11_CR30","volume-title":"Towards Applying Cryptographic Security Models to Real-World Systems","author":"J Rill","year":"2020","unstructured":"Rill, J.: Towards Applying Cryptographic Security Models to Real-World Systems. Karlsruhe Institute of Technology, Germany (2020)"},{"key":"11_CR31","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). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_25"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Schaad, J., Ramsdell, B., Turner, S.: Secure\/multipurpose internet mail extensions (S\/MIME) version 4.0 message specification. RFC 8551, pp. 1\u201363 (2019). https:\/\/doi.org\/10.17487\/RFC8551","DOI":"10.17487\/RFC8551"},{"issue":"1","key":"11_CR33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1515\/popets-2018-0003","volume":"2018","author":"N Unger","year":"2018","unstructured":"Unger, N., Goldberg, I.: Improved strongly deniable authenticated key exchanges for secure messaging. PoPETs 2018(1), 21\u201366 (2018)","journal-title":"PoPETs"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-662-53018-4_9","volume-title":"Advances in Cryptology","author":"Y YU","year":"2016","unstructured":"YU, Y., Zhang, J.: Cryptography with auxiliary input and trapdoor from constant-noise LPN. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 214\u2013243. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_9"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97131-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:02:14Z","timestamp":1740524534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97131-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030971304","9783030971311"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97131-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}