{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:37:55Z","timestamp":1779935875279,"version":"3.53.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486173","type":"print"},{"value":"9783031486180","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48618-0_10","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T17:02:02Z","timestamp":1701018122000},"page":"279-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Security with\u00a0Functional Re-encryption from\u00a0CPA"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Akavia, A., Gentry, C., Halevi, S., Vald, M.: Achievable CCA2 relaxation for homomorphic encryption. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7\u201310, 2022, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13748, pp. 70\u201399. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_3, also available from https:\/\/ia.cr\/2022\/282","DOI":"10.1007\/978-3-031-22365-5_3"},{"key":"10_CR2","unstructured":"Akavia, A., Vald, M.: private communication, November 2022"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00145-017-9254-z","volume":"31","author":"SG Choi","year":"2017","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: A black-box construction of non-malleable encryption from semantically secure encryption. J. Cryptol. 31(1), 172\u2013201 (2017). https:\/\/doi.org\/10.1007\/s00145-017-9254-z","journal-title":"J. Cryptol."},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-017-0348-2","volume":"86","author":"SG Choi","year":"2017","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Improved, black-box, non-malleable encryption from semantic security. Des. Codes Crypt. 86(3), 641\u2013663 (2017). https:\/\/doi.org\/10.1007\/s10623-017-0348-2","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1984","DOI":"10.1007\/s00145-020-09361-0","volume":"33","author":"S Coretti","year":"2020","unstructured":"Coretti, S., Dodis, Y., Maurer, U., Tackmann, B., Venturi, D.: Non-malleable encryption: simpler, shorter, stronger. J. Cryptol. 33(4), 1984\u20132033 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09361-0","journal-title":"J. Cryptol."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Cramer, R., Hanaoka, G., Hofheinz, D., Imai, H., Kiltz, E., Pass, R., Shelat, A., Vaikuntanathan, V.: Bounded cca2-secure encryption. In: Kurosawa, K. (ed.) Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2\u20136, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4833, pp. 502\u2013518. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_31","DOI":"10.1007\/978-3-540-76900-2_31"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC \u201999, Kamakura, Japan, March 1\u20133, 1999, Proceedings. Lecture Notes in Computer Science, vol. 1560, pp. 53\u201368. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_5","DOI":"10.1007\/3-540-49162-7_5"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/978-3-030-56784-2_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Hohenberger","year":"2020","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Chosen ciphertext security from injective trapdoor functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 836\u2013866. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_28"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Myers, S.A., Sergi, M., Shelat, A.: Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness. J. Comput. Secur. 21(5), 721\u2013748 (2013). https:\/\/doi.org\/10.3233\/JCS-130485","DOI":"10.3233\/JCS-130485"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Ortiz, H. (ed.) Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13\u201317, 1990, Baltimore, Maryland, USA, pp. 427\u2013437. ACM (1990). https:\/\/doi.org\/10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Pass, R., shelat, Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 271\u2013289. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_16","DOI":"10.1007\/11818175_16"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, 17\u201318 October, 1999, pp. 543\u2013553. IEEE Computer Society, New York (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48618-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:40Z","timestamp":1764118960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48618-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486173","9783031486180"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48618-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"168","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":"68","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":"40% - 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":"3","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":"13","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}