{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T05:40:04Z","timestamp":1768369204843,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00145-023-09479-x","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T16:01:42Z","timestamp":1691078502000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fine-Grained Secure Attribute-Based Encryption"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1198-1903","authenticated-orcid":false,"given":"Yuyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7459-6850","authenticated-orcid":false,"given":"Jiaxin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-1281","authenticated-orcid":false,"given":"Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"key":"9479_CR1","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography in NC$$^0$$, in 45th FOCS. (IEEE Computer Society Press, 2004), pp. 166\u2013175"},{"key":"9479_CR2","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, New techniques for zero-knowledge: Leveraging inefficient provers to reduce assumptions, interaction, and trust, in Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172 (Springer, Heidelberg, 2020), pp. 674\u2013703","DOI":"10.1007\/978-3-030-56877-1_24"},{"key":"9479_CR3","doi-asserted-by":"crossref","unstructured":"D.A.M. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in $$\\text{NC}^1$$, in 18th ACM STOC (ACM Press, 1986), pp. 1\u20135","DOI":"10.1145\/12130.12131"},{"key":"9479_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Goldwasser, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs, in Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol. 435 (Springer, Heidelberg, 1990), pp. 194\u2013211","DOI":"10.1007\/0-387-34805-0_19"},{"key":"9479_CR5","doi-asserted-by":"crossref","unstructured":"O. Blazy, E. Kiltz, J. Pan, (Hierarchical) identity-based encryption from affine message authentication, in Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0I. LNCS, vol. 8616 (Springer, Heidelberg, 2014), pp. 408\u2013425","DOI":"10.1007\/978-3-662-44371-2_23"},{"key":"9479_CR6","doi-asserted-by":"crossref","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing, in Kilian, J. (ed.) CRYPTO\u00a02001. LNCS, vol. 2139 (Springer, Heidelberg, 2001), pp. 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9479_CR7","doi-asserted-by":"crossref","unstructured":"D. Boneh, P.A. Papakonstantinou, C. Rackoff, Y. Vahlis, B. Waters, On the impossibility of basing identity based encryption on trapdoor permutations, in 49th FOCS (IEEE Computer Society Press, 2008), pp. 283\u2013292","DOI":"10.1109\/FOCS.2008.67"},{"key":"9479_CR8","first-page":"1326","volume":"2020","author":"C Brzuska","year":"2020","unstructured":"C. Brzuska, G. Couteau, Towards fine-grained one-way functions from strong average-case hardness. IACR Cryptol. ePrint Arch. 2020, 1326 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9479_CR9","doi-asserted-by":"crossref","unstructured":"M. Campanelli, R. Gennaro, Fine-grained secure computation, in Beimel, A., Dziembowski, S. (eds.) TCC\u00a02018, Part\u00a0II. LNCS, vol. 11240 (Springer, Heidelberg, 2018), pp. 66\u201397","DOI":"10.1007\/978-3-030-03810-6_3"},{"key":"9479_CR10","doi-asserted-by":"crossref","unstructured":"J. Chen, R. Gay, H. Wee, Improved dual system ABE in prime-order groups via predicate encodings, in Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 595\u2013624","DOI":"10.1007\/978-3-662-46803-6_20"},{"key":"9479_CR11","doi-asserted-by":"crossref","unstructured":"J. Chen, H. Wee, Fully, (almost) tightly secure IBE and dual system groups, in Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043 (Springer, Heidelberg, 2013), pp. 435\u2013460","DOI":"10.1007\/978-3-642-40084-1_25"},{"key":"9479_CR12","doi-asserted-by":"crossref","unstructured":"C. Cocks, An identity based encryption scheme based on quadratic residues, in Honary, B. (ed.) 8th IMA International Conference on Cryptography and Coding. LNCS, vol. 2260 (Springer, Heidelberg, 2001), pp. 360\u2013363","DOI":"10.1007\/3-540-45325-3_32"},{"key":"9479_CR13","doi-asserted-by":"crossref","unstructured":"A. Degwekar, V. Vaikuntanathan, P.N. Vasudevan, Fine-grained cryptography, in Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0III. LNCS, vol. 9816 (Springer, Heidelberg, 2016), pp. 533\u2013562","DOI":"10.1007\/978-3-662-53015-3_19"},{"key":"9479_CR14","doi-asserted-by":"crossref","unstructured":"S. Egashira, Y. Wang, K. Tanaka, Fine-grained cryptography revisited, in Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11923 (Springer, Heidelberg, 2019), pp. 637\u2013666","DOI":"10.1007\/978-3-030-34618-8_22"},{"issue":"3","key":"9479_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00145-021-09390-3","volume":"34","author":"S Egashira","year":"2021","unstructured":"S. Egashira, Y. Wang, K. Tanaka, Fine-grained cryptography revisited. J. Cryptol.34(3), 23 (2021)","journal-title":"J. Cryptol."},{"key":"9479_CR16","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, E. Kiltz, J. Loss, The algebraic group model and its applications, in Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992 (Springer, Heidelberg, 2018), pp. 33\u201362","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"9479_CR17","doi-asserted-by":"crossref","unstructured":"C. Gentry, A. Silverberg, Hierarchical ID-based cryptography, in Zheng, Y. (ed.) ASIACRYPT\u00a02002. LNCS, vol. 2501 (Springer, Heidelberg, 2002), pp. 548\u2013566","DOI":"10.1007\/3-540-36178-2_34"},{"key":"9479_CR18","doi-asserted-by":"crossref","unstructured":"V. Goyal, O. Pandey, A. Sahai, B. Waters, Attribute-based encryption for fine-grained access control of encrypted data, in: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006 (ACM Press, 2006), Available as Cryptology ePrint Archive Report 2006\/309, pp. 89\u201398","DOI":"10.1145\/1180405.1180418"},{"key":"9479_CR19","doi-asserted-by":"crossref","unstructured":"J. Groth, A. Sahai, Efficient non-interactive proof systems for bilinear groups, in Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol. 4965 (Springer, Heidelberg, 2008), pp. 415\u2013432","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"9479_CR20","doi-asserted-by":"crossref","unstructured":"J. Horwitz, B. Lynn, Toward hierarchical identity-based encryption, in Knudsen, L.R. (ed.) EUROCRYPT\u00a02002. LNCS, vol. 2332 (Springer, Heidelberg, 2002), pp. 466\u2013481","DOI":"10.1007\/3-540-46035-7_31"},{"key":"9479_CR21","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Randomizing polynomials: A new representation with applications to round-efficient secure computation, in 41st FOCS (IEEE Computer Society Press, 2000), pp. 294\u2013304","DOI":"10.1109\/SFCS.2000.892118"},{"key":"9479_CR22","doi-asserted-by":"crossref","unstructured":"C.S. Jutla, A. Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces, in Sako, K., Sarkar, P. (eds.) ASIACRYPT\u00a02013, Part\u00a0I. LNCS, vol. 8269 (Springer, Heidelberg, 2013), pp. 1\u201320","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"9479_CR23","doi-asserted-by":"crossref","unstructured":"E. Kiltz, H. Wee, Quasi-adaptive NIZK for linear subspaces revisited, in Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 101\u2013128","DOI":"10.1007\/978-3-662-46803-6_4"},{"key":"9479_CR24","doi-asserted-by":"crossref","unstructured":"A.B. Lewko, B. Waters, New techniques for dual system encryption and fully secure HIBE with short ciphertexts, in: Micciancio, D. (ed.) TCC\u00a02010. LNCS, vol. 5978 (Springer, Heidelberg, 2010), pp. 455\u2013479","DOI":"10.1007\/978-3-642-11799-2_27"},{"key":"9479_CR25","doi-asserted-by":"crossref","unstructured":"U.M. Maurer, Abstract models of computation in cryptography (invited paper), in: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol. 3796 (Springer, Heidelberg, 2005), pp. 1\u201312","DOI":"10.1007\/11586821_1"},{"issue":"4","key":"9479_CR26","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"RC Merkle","year":"1978","unstructured":"R.C. Merkle, Secure communications over insecure channels. Commun. ACM21(4), 294\u2013299 (1978)","journal-title":"Commun. ACM"},{"key":"9479_CR27","doi-asserted-by":"crossref","unstructured":"P. Morillo, C. R\u00e0fols, J.L.. Villar, The kernel matrix Diffie\u2013Hellman assumption, in Cheon, J.H., Takagi, T. (eds.) ASIACRYPT\u00a02016, Part\u00a0I. LNCS, vol. 10031 (Springer, Heidelberg, 2016), pp. 729\u2013758","DOI":"10.1007\/978-3-662-53887-6_27"},{"key":"9479_CR28","doi-asserted-by":"crossref","unstructured":"A.A. Razborov, Lower bounds on the size of bounded depth circuits over a complete basis with logical addition, in Mathematical notes of the Academy of Sciences of the USSR 41(4) (1987)","DOI":"10.1007\/BF01137685"},{"key":"9479_CR29","doi-asserted-by":"crossref","unstructured":"A. Shamir, Identity-based cryptosystems and signature schemes, in Blakley, G.R., Chaum, D. (eds.) CRYPTO\u201984. LNCS, vol. 196 (Springer, Heidelberg, 1984), pp. 47\u201353","DOI":"10.1007\/3-540-39568-7_5"},{"key":"9479_CR30","doi-asserted-by":"crossref","unstructured":"V. Shoup, Lower bounds for discrete logarithms and related problems, in Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol. 1233 (Springer, Heidelberg, 1997), pp. 256\u2013266","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9479_CR31","doi-asserted-by":"crossref","unstructured":"R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in: Aho, A. (ed.) 19th ACM STOC (ACM Press, 1987), pp. 77\u201382","DOI":"10.1145\/28395.28404"},{"key":"9479_CR32","doi-asserted-by":"crossref","unstructured":"Y. Wang, J. Pan, Non-interactive zero-knowledge proofs with fine-grained security, in Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276 (Springer, Heidelberg, 2022), pp. 305\u2013335","DOI":"10.1007\/978-3-031-07085-3_11"},{"key":"9479_CR33","doi-asserted-by":"crossref","unstructured":"Y. Wang, J. Pan, Unconditionally secure NIZK in the fine-grained setting, in Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792 (Springer, Heidelberg, 2022), pp. 437\u2013465","DOI":"10.1007\/978-3-031-22966-4_15"},{"key":"9479_CR34","doi-asserted-by":"crossref","unstructured":"Y. Wang, J. Pan, Y. Chen, Fine-grained secure attribute-based encryption, in Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828 (Springer, Heidelberg, 2021), pp. 179\u2013207","DOI":"10.1007\/978-3-030-84259-8_7"},{"key":"9479_CR35","doi-asserted-by":"crossref","unstructured":"B. Waters, Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions, in Halevi, S. (ed.) CRYPTO\u00a02009. LNCS, vol. 5677 (Springer, Heidelberg, 2009), pp. 619\u2013636","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"9479_CR36","doi-asserted-by":"crossref","unstructured":"H. Wee, Dual system encryption via predicate encodings, in Lindell, Y. (ed.) TCC\u00a02014. LNCS, vol. 8349 (Springer, Heidelberg, 2014), pp. 616\u2013637","DOI":"10.1007\/978-3-642-54242-8_26"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09479-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T16:58:48Z","timestamp":1729875528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09479-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["9479"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09479-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"29 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"33"}}