{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:26Z","timestamp":1742912666427,"version":"3.40.3"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780196"},{"type":"electronic","value":"9783031780202"}],"license":[{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78020-2_1","type":"book-chapter","created":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T09:38:40Z","timestamp":1732959520000},"page":"3-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-authority Functional Encryption with\u00a0Bounded Collusions from\u00a0Standard Assumptions"],"prefix":"10.1007","author":[{"given":"Rishab","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5965-1057","authenticated-orcid":false,"given":"Saikumar","family":"Yadugiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-40084-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption: new perspectives and lower bounds. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 500\u2013518. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_28"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-90453-1_8","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Goyal, R., Tomida, J.: Multi-party functional encryption. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 224\u2013255. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_8"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-84259-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Maitra, M., Vempati, N.S., Yamada, S.: Functional encryption for Turing machines with dynamic bounded collusion from LWE. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 239\u2013269. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_9"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-70500-2_7","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2017","unstructured":"Agrawal, S., Rosen, A.: Functional encryption for bounded collusions, revisited. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 173\u2013205. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_7"},{"key":"1_CR5","unstructured":"Ambrona, M., Gay, R.: Multi-authority ABE, revisited. Cryptology ePrint Archive (2021)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-26954-8_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Jain, A., Lin, H., Matt, C., Sahai, A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 284\u2013332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_10"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation from functional encryption for simple functions. Cryptology ePrint Archive (2015)","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-36030-6_8","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Vaikuntanathan, V.: Optimal bounded-collusion secure functional encryption. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 174\u2013198. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_8"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Comput. Complex. 15(2), 115\u2013162 (2006)","DOI":"10.1007\/s00037-006-0211-8"},{"key":"1_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"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"BenOr, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC\u201988), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: FOCS (2015)","DOI":"10.1007\/978-3-662-49096-9_4"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223\u2013238. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_14"},{"key":"1_CR18","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":"1_CR19","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":"1_CR20","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"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1090\/conm\/324\/05731","volume":"324","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Silverberg, A.: Applications of multilinear forms to cryptography. Contemp. Math. 324(1), 71\u201390 (2003)","journal-title":"Contemp. Math."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_29"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"1_CR24","unstructured":"Brakerski, Z., Chandran, N., Goyal, V., Jain, A., Sahai, A., Segev, G.: Hierarchical functional encryption. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-70936-7_28","volume-title":"Theory of Cryptography","author":"M Chase","year":"2007","unstructured":"Chase, M.: Multi-authority attribute based encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 515\u2013534. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_28"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Chase, M., Chow, S.S.M.: Improving privacy and security in multi-authority attribute-based encryption. In: ACM Conference on Computer and Communications Security, pp. 121\u2013130 (2009)","DOI":"10.1145\/1653662.1653678"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C Cocks","year":"2001","unstructured":"Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_32"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-77870-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Datta","year":"2021","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for DNFs from LWE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 177\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_7"},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s00145-023-09445-7","volume":"36","author":"P Datta","year":"2023","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for NC 1 from BDH. J. Cryptol. 36(2), 6 (2023)","journal-title":"J. Cryptol."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-031-31368-4_21","volume-title":"Public-Key Cryptography - PKC 2023","author":"P Datta","year":"2023","unstructured":"Datta, P., Pal, T.: Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13940, pp. 587\u2013621. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_21"},{"issue":"6","key":"1_CR31","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.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: Multiuser cryptographic techniques. In: AFIPS National Computer Conference, pp. 109\u2013112 (1976)","DOI":"10.1145\/1499799.1499815"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: International Conference on the Theory and Applications of Cryptographic Techniques (2002)","DOI":"10.1007\/3-540-46035-7_5"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-61204-1_19","volume-title":"Applied Cryptography and Network Security","author":"C Freitag","year":"2017","unstructured":"Freitag, C., et al.: Signature schemes with randomized verification. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 373\u2013389. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_19"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-031-57728-4_3","volume-title":"Public-Key Cryptography - PKC 2024","author":"R Garg","year":"2024","unstructured":"Garg, R., Goyal, R., Lu, G.: Dynamic collusion functional encryption and multi-authority attribute-based encryption. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14604, pp. 69\u2013104. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57728-4_3"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-031-07085-3_25","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"R Garg","year":"2022","unstructured":"Garg, R., Goyal, R., Lu, G., Waters, B.: Dynamic collusion bounded functional encryption from identity-based encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 736\u2013763. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_25"},{"issue":"3","key":"1_CR37","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-642-28914-9_32","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2012","unstructured":"Goldwasser, S., Lewko, A., Wilson, D.A.: Bounded-collusion IBE from key homomorphism. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 564\u2013581. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_32"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 162\u2013179. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: STOC (2013)","DOI":"10.1145\/2488608.2488677"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Predicate encryption for circuits from LWE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 612\u2013621 (2017)","DOI":"10.1109\/FOCS.2017.62"},{"key":"1_CR43","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: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 89\u201398 (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Kitagawa, F., Morimae, T., Nishimaki, R., Pal, T., Yamakawa, T.: Certified everlasting secure collusion-resistant functional encryption. Technical report, and more. Cryptology ePrint Archive, Report 2023\/236 (2023)","DOI":"10.1007\/978-3-031-58734-4_15"},{"key":"1_CR45","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting functional encryption. arXiv preprint arXiv:2207.13878 (2022)"},{"key":"1_CR46","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":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-031-06944-4_23","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"A Jain","year":"2022","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{f}_p$$, DLIN, and PRGs in $$\\text{ NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23"},{"issue":"4","key":"1_CR48","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Katz","year":"2008","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 146\u2013162. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_9"},{"key":"1_CR50","unstructured":"Kim, S.: Multi-authority attribute-based encryption from LWE in the OT model. Cryptology ePrint Archive (2019)"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-20465-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Decentralizing attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 568\u2013588. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_31"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"key":"1_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-319-98989-1_27","volume-title":"Computer Security","author":"Y Michalevsky","year":"2018","unstructured":"Michalevsky, Y., Joye, M.: Decentralized policy-hiding ABE with receiver privacy. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 548\u2013567. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_27"},{"issue":"1","key":"1_CR54","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1587\/transfun.2019CIP0008","volume":"103","author":"T Okamoto","year":"2020","unstructured":"Okamoto, T., Takashima, K.: Decentralized attribute-based encryption and signatures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103(1), 41\u201373 (2020)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Proceedings of the 17th ACM Conference on Computer and Communications Security. pp. 463\u2013472 (2010)","DOI":"10.1145\/1866307.1866359"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"},{"issue":"11","key":"1_CR58","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","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"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-17259-6_4","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Fan, X., Liu, F.-H.: FE for inner products and its application to decentralized ABE. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 97\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_4"},{"key":"1_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7"},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 600\u2013611 (2017)","DOI":"10.1109\/FOCS.2017.61"},{"key":"1_CR63","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-78020-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T10:02:22Z","timestamp":1732960942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78020-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"ISBN":["9783031780196","9783031780202"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78020-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,30]]},"assertion":[{"value":"30 November 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}