{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:06:46Z","timestamp":1767978406194,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","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-031-22318-1_20","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"559-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Mahmoody","sequence":"first","affiliation":[]},{"given":"Wei","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Ahmadreza","family":"Rahimi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452\u2013473. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_29","DOI":"10.1007\/978-3-540-40061-5_29"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24","DOI":"10.1007\/3-540-48285-7_24"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Blocki, J., Holman, B.: Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions. Cryptology ePrint Archive, Paper 2022\/832 (2022). eprint.iacr.org\/2022\/832","DOI":"10.1007\/978-3-031-15982-4_8"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_33","DOI":"10.1007\/3-540-69053-0_33"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Cheng, Z., Comley, R., Vasiu, L.: Remove key escrow from the identity-based encryption system. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IIFIP, vol. 155, pp. 37\u201350. Springer, Boston, MA (2004). https:\/\/doi.org\/10.1007\/1-4020-8141-3_6","DOI":"10.1007\/1-4020-8141-3_6"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Cong, K., Eldefrawy, K., Smart, N.P.: Optimizing registration based encryption. In: Paterson, M.B. (ed.) IMACC 2021. LNCS, vol. 13129, pp. 129\u2013157. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92641-0_7","DOI":"10.1007\/978-3-030-92641-0_7"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Chow, S.S.M.: Removing escrow from identity-based encryption. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 256\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_15","DOI":"10.1007\/978-3-642-00468-1_15"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5","DOI":"10.1007\/3-540-45708-9_5"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S.: Identity-based encryption from the diffie-hellman assumption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 537\u2013569. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_18","DOI":"10.1007\/978-3-319-63688-7_18"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Emura, K., Katsumata, S., Watanabe, Y.: Identity-based encryption with security against the KGC: a formal model and its instantiation from lattices. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 113\u2013133. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_6","DOI":"10.1007\/978-3-030-29962-0_6"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual Symposium on Foundations of Computer Science, 26\u201329 Oct 2013, pp. 40\u201349. IEEE Computer Society Press, Berkeley, CA, USA (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A., Sekar, S.: Registration-based encryption from standard assumptions. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_3","DOI":"10.1007\/978-3-030-17259-6_3"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A.: Registration-based encryption: removing private-key generator from IBE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 689\u2013718. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_25","DOI":"10.1007\/978-3-030-03807-6_25"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lu, S., Sahai, A., Waters, B.: Black-box accountable authority identity-based encryption. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 427\u2013436. ACM (2008)","DOI":"10.1145\/1455770.1455824"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Reducing trust in the PKG in identity based cryptosystems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 430\u2013447. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_24","DOI":"10.1007\/978-3-540-74143-5_24"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Goyal, R., Vusirikala, S.: Verifiable registration-based encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 621\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_21","DOI":"10.1007\/978-3-030-56784-2_21"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) ITCS 2015: 6th Conference on Innovations in Theoretical Computer Science, 11\u201313 Jan 2015, pp. 163\u2013172. Association for Computing Machinery, Rehovot, Israel (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"20_CR21","unstructured":"Rogaway, P.: The moral character of cryptographic work. Cryptology ePrint Archive, Report 2015\/1162 (2015). eprint.iacr.org\/2015\/1162"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_5","DOI":"10.1007\/3-540-39568-7_5"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Wei, Q., Qi, F., Tang, Z.: Remove key escrow from the BF and Gentry identity-based encryption with non-interactive key generation. Telecommunication Systems, pp. 1\u201310 (2018)","DOI":"10.1007\/s11235-018-0461-1"}],"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-22318-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:16Z","timestamp":1766278936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_20","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":"21 December 2022","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":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"139","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":"60","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":"43% - 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.1","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":"9.9","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"}]}}