{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:25:45Z","timestamp":1762341945907,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171390"},{"type":"electronic","value":"9783031171406"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17140-6_13","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:19:49Z","timestamp":1664000389000},"page":"259-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generic Construction of\u00a0Trace-and-Revoke Inner Product Functional Encryption"],"prefix":"10.1007","author":[{"given":"Fucai","family":"Luo","sequence":"first","affiliation":[]},{"given":"Saif","family":"Al-Kuwari","sequence":"additional","affiliation":[]},{"given":"Haiyan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Weihong","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-34618-8_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Gay, R.: From single-input to multi-client inner-product functional encryption. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_19"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_33"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-71677-8_24","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"M Abdalla","year":"2007","unstructured":"Abdalla, M., Dent, A.W., Malone-Lee, J., Neven, G., Phan, D.H., Smart, N.P.: Identity-based traitor tracing. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 361\u2013376. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_24"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Gong, J., Wee, H.: Functional encryption for attribute-weighted sums from k-lin. IACR Cryptol. ePrint Arch. 2020, 762 (2020)","DOI":"10.1007\/978-3-030-56784-2_23"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Bhattacherjee, S., Phan, D.H., Stehl\u00e9, D., Yamada, S.: Efficient public trace and revoke from standard assumptions: extended abstract. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 2277\u20132293. ACM (2017)","DOI":"10.1145\/3133956.3134041"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Agrawal","year":"2016","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 333\u2013362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_12"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-45721-1_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Yamada, S.: Optimal broadcast encryption from pairings and LWE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 13\u201343. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_2"},{"key":"13_CR8","unstructured":"Ak, M., Kiayias, A., Pehlivanoglu, S., Sel\u00e7uk, A.A.: Generic construction of trace and revoke schemes. IACR Cryptol. ePrint Arch. 2012, 531 (2012)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-56620-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Ananth","year":"2017","unstructured":"Ananth, P., Sahai, A.: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 152\u2013181. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_6"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-03298-1_16","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"N Attrapadung","year":"2009","unstructured":"Attrapadung, N., Imai, H.: Conjunctive broadcast and attribute-based encryption. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 248\u2013265. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_16"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-63688-7_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"CEZ Baltico","year":"2017","unstructured":"Baltico, C.E.Z., Catalano, D., Fiore, D., Gay, R.: Practical functional encryption for quadratic functions with applications to predicate encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 67\u201398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_3"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-34931-7_19","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Lange, T.: Computing small discrete logarithms faster. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 317\u2013338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_19"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-85093-9_17","volume-title":"Information Theoretic Security","author":"O Billet","year":"2008","unstructured":"Billet, O., Phan, D.H.: Efficient traitor tracing from collusion secure codes. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 171\u2013182. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85093-9_17"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D Boneh","year":"1998","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48\u201363. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054851"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338\u2013353. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_22"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","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"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled Circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: A fully collusion resistant broadcast, trace, and revoke system. In: Juels, A., Wright, R.N., di Vimercati, S.D.C. (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, 30 Oct\u20133 Nov 2006, pp. 211\u2013220. ACM (2006)","DOI":"10.1145\/1180405.1180432"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 575\u2013584. ACM (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-030-40186-3_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"XT Do","year":"2020","unstructured":"Do, X.T., Phan, D.H., Pointcheval, D.: Traceable inner product functional encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 564\u2013585. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_24"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480\u2013491. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_40"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-48405-1_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"E Gafni","year":"1999","unstructured":"Gafni, E., Staddon, J., Yin, Y.L.: Efficient methods for integrating traceability and broadcast encryption. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 372\u2013387. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_24"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324\u2013337. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_26"},{"key":"13_CR27","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 IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26\u201329 Oct 2013, pp. 40\u201349. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-49099-0_18","volume-title":"Theory of Cryptography","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Functional encryption without obfuscation. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 480\u2013511. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_18"},{"key":"13_CR29","first-page":"95","volume":"18","author":"C Ge","year":"2020","unstructured":"Ge, C., Susilo, W., Liu, Z., Xia, J., Szalachowski, P., Liming, F.: Secure keyword search and data sharing mechanism for cloud computing. IEEE Trans. Dependable Sec. Comput. 18, 95\u2013108 (2020)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Ge, C., Yin, C., Liu, Z., Fang, L., Zhu, J., Ling, H.: A privacy preserve big data analysis system for wearable wireless sensor network. Comput. Sec. 96, 101887 (2020)","DOI":"10.1016\/j.cose.2020.101887"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 660\u2013670. ACM (2018)","DOI":"10.1145\/3188745.3188844"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-36033-7_6","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Koppula, V., Waters, B.: New approaches to traitor tracing with embedded identities. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 149\u2013179. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_6"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1007\/978-3-030-26954-8_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Quach, W., Waters, B., Wichs, D.: Broadcast and trace with $$N^{\\varepsilon }$$ ciphertext size from standard assumptions. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 826\u2013855. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_27"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17259-6_1","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Vusirikala, S., Waters, B.: Collusion resistant broadcast and trace from positional witness encryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_1"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., di Vimercati, S.D.C. (eds.)Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, 30 Oct\u20133 Nov 2006, pp. 89\u201398. ACM (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-33167-1_35","volume-title":"Computer Security \u2013 ESORICS 2012","author":"F Guo","year":"2012","unstructured":"Guo, F., Mu, Y., Susilo, W.: Identity-based traitor tracing with short private key and short ciphertext. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 609\u2013626. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33167-1_35"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45708-9_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Halevy","year":"2002","unstructured":"Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47\u201360. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_4"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-85538-5_5","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"V Iovino","year":"2008","unstructured":"Iovino, V., Persiano, G.: Hidden-vector encryption with groups of prime order. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 75\u201388. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_5"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-662-53890-6_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Katsumata","year":"2016","unstructured":"Katsumata, S., Yamada, S.: Partitioning via non-linear polynomial functions: more compact IBEs from ideal lattices and Bilinear Maps. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 682\u2013712. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_23"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-40061-5_23","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"CH Kim","year":"2003","unstructured":"Kim, C.H., Hwang, Y.H., Lee, P.J.: An efficient public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 359\u2013373. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_23"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-64834-3_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"S Kim","year":"2020","unstructured":"Kim, S., Wu, D.J.: Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 66\u201397. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_3"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-319-98989-1_26","volume-title":"Computer Security","author":"J Lai","year":"2018","unstructured":"Lai, J., Tang, Q.: Making Any attribute-based encryption accountable, efficiently. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 527\u2013547. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_26"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Z., Cao, Z., Wong, D.S.: Blackbox traceable CP-ABE: how to catch people leaking their keys by selling decryption devices on ebay. In: Sadeghi, A., Gligor, V.D., Yung, M. (eds.) 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 Nov 2013, pp. 475\u2013486. ACM (2013)","DOI":"10.1145\/2508859.2516683"},{"issue":"7","key":"13_CR44","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1093\/comjnl\/bxv101","volume":"59","author":"Z Liu","year":"2016","unstructured":"Liu, Z., Wong, D.S.: Practical attribute-based encryption: Traitor tracing, revocation and large universe. Comput. J. 59(7), 983\u20131004 (2016)","journal-title":"Comput. J."},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_3"},{"key":"13_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","volume-title":"Financial Cryptography","author":"M Naor","year":"2001","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 1\u201320. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45472-1_1"},{"key":"13_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-49896-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Nishimaki","year":"2016","unstructured":"Nishimaki, R., Wichs, D., Zhandry, M.: Anonymous traitor tracing: How to embed arbitrary information in a key. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 388\u2013419. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_14"},{"key":"13_CR48","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. IACR Cryptol. ePrint Arch., p. 556 (2010)"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree Residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"13_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-24316-5_15","volume-title":"Provable Security","author":"DH Phan","year":"2011","unstructured":"Phan, D.H., Trinh, V.C.: Identity-based trace and revoke schemes. In: Boyen, X., Chen, X. (eds.) ProvSec 2011. LNCS, vol. 6980, pp. 204\u2013221. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24316-5_15"},{"issue":"4","key":"13_CR51","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"JM Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. J. Cryptol. 13(4), 437\u2013447 (2000)","journal-title":"J. Cryptol."},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"13_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-32009-5_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A Sahai","year":"2012","unstructured":"Sahai, A., Seyalioglu, H., Waters, B.: Dynamic credentials and ciphertext delegation for attribute-based encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 199\u2013217. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_13"},{"issue":"3","key":"13_CR54","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J Staddon","year":"2001","unstructured":"Staddon, J., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"13_CR55","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11(1), 41\u201353 (1998)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48892-8_12","volume-title":"Selected Areas in Cryptography","author":"DR Stinson","year":"1999","unstructured":"Stinson, D.R., Wei, R.: Key preassigned traceability schemes for broadcast encryption. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 144\u2013156. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48892-8_12"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17140-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T10:18:04Z","timestamp":1676888284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17140-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171390","9783031171406"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17140-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.compute.dtu.dk\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"562","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":"104","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":"6","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":"19% - 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.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)"}}]}}