{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:26:16Z","timestamp":1722385576234},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"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":[[2024,7]]},"DOI":"10.1007\/s00145-024-09503-8","type":"journal-article","created":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T22:01:16Z","timestamp":1715637676000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact NIZKs from Standard Assumptions on Bilinear Maps"],"prefix":"10.1007","volume":"37","author":[{"given":"Shuichi","family":"Katsumata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"9503_CR1","unstructured":"H. Abusalah, Generic instantiations of the hidden bits model for non-interactive zero-knowledge proofs for NP. Master\u2019s thesis, RWTH-Aachen University (2013)"},{"key":"9503_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2011.12.004","volume":"422","author":"N Attrapadung","year":"2012","unstructured":"N. Attrapadung, J. Herranz, F. Laguillaumie, B. Libert, E. de\u00a0Panafieu, C. R\u00e0fols, Attribute-based encryption schemes with constant-size ciphertexts. Theor. Comput. Sci.422, 15\u201338 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9503_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography in nc$${}^{\\text{0 }}$$. SIAM J. Comput.36(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"9503_CR4","doi-asserted-by":"crossref","unstructured":"N. Attrapadung, B. Libert, E. de\u00a0Panafieu, Expressive key-policy attribute-based encryption with constant-size ciphertexts, in D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi, editors, PKC 2011. LNCS, vol. 6571 (Springer, Heidelberg, 2011), pp. 90\u2013108","DOI":"10.1007\/978-3-642-19379-8_6"},{"issue":"4","key":"9503_CR5","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"PW Beame","year":"1986","unstructured":"P.W. Beame, S.A. Cook, H. James Hoover, Log depth circuits for division and related problems. SIAM J. Comput.15(4), 994\u20131003 (1986)","journal-title":"SIAM J. Comput."},{"key":"9503_CR6","doi-asserted-by":"crossref","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing, in J. Kilian, editor, CRYPTO\u00a02001. LNCS, vol. 2139 (Springer, Heidelberg, 2001), pp. 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9503_CR7","doi-asserted-by":"crossref","unstructured":"D. Boneh, D.M. Freeman, Homomorphic signatures for polynomial functions, in K.G. Paterson, editor, EUROCRYPT\u00a02011. LNCS, vol. 6632 (Springer, Heidelberg, 2011), pp. 149\u2013168","DOI":"10.1007\/978-3-642-20465-4_10"},{"key":"9503_CR8","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications (extended abstract), in 20th ACM STOC (ACM Press, 1988), pp. 103\u2013112","DOI":"10.1145\/62212.62222"},{"key":"9503_CR9","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, Breaking the circuit size barrier for secure computation under DDH, in M. Robshaw, J. Katz, editors, CRYPTO\u00a02016, Part\u00a0I. LNCS, vol. 9814 (Springer, Heidelberg, 2016), pp. 509\u2013539","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"9503_CR10","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, V. Koppula, T. Mour, NIZK from LPN and trapdoor hash via correlation intractability for approximable relations, in D. Micciancio, T. Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172 (Springer, Heidelberg, 2020), pp. 738\u2013767","DOI":"10.1007\/978-3-030-56877-1_26"},{"key":"9503_CR11","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation, in Y. Dodis, J.B. Nielsen, editors, TCC\u00a02015, Part\u00a0II. LNCS, vol. 9015 (Springer, Heidelberg, 2015), pp. 401\u2013427","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"9503_CR12","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, D. Wichs, Perfect structure on the edge of chaos - trapdoor permutations from indistinguishability obfuscation, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A, Part\u00a0I. LNCS, vol. 9562 (Springer, Heidelberg, 2016), pp. 474\u2013502","DOI":"10.1007\/978-3-662-49096-9_20"},{"issue":"3","key":"9503_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00208000","volume":"9","author":"M Bellare","year":"1996","unstructured":"M. Bellare, M. Yung, Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation. J. Cryptol.9(3), 149\u2013166 (1996)","journal-title":"J. Cryptol."},{"key":"9503_CR14","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2000). https:\/\/eprint.iacr.org\/2000\/067"},{"key":"9503_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd FOCS (IEEE Computer Society Press, 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9503_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Chen, J. Holmgren, A. Lombardi, G.N. Rothblum, R.D. Rothblum, D. Wichs, Fiat-Shamir: from practice to theory, in M. Charikar, E. Cohen, editors, 51st ACM STOC (ACM Press, 2019), pp. 1082\u20131090","DOI":"10.1145\/3313276.3316380"},{"key":"9503_CR17","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Chen, L. Reyzin, R.D. Rothblum, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, in J.B. Nielsen, V. Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820 (Springer, Heidelberg, 2018), pp. 91\u2013122","DOI":"10.1007\/978-3-319-78381-9_4"},{"issue":"4","key":"9503_CR18","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0214058","volume":"14","author":"SA Cook","year":"1985","unstructured":"S.A. Cook, H.J. Hoover, A depth-universal circuit. SIAM J. Comput., 14(4), 833\u2013839 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9503_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-006-0442-5","volume":"20","author":"R Canetti","year":"2007","unstructured":"R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme. Journal of Cryptology20(3), 265\u2013294 (2007)","journal-title":"J. Cryptol."},{"key":"9503_CR20","doi-asserted-by":"crossref","unstructured":"G. Couteau, S. Katsumata, B. Ursu, Non-interactive zero-knowledge in pairing-free groups from weaker assumptions, in A. Canteaut, Y. Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107 (Springer, Heidelberg, 2020), pp. 442\u2013471","DOI":"10.1007\/978-3-030-45727-3_15"},{"key":"9503_CR21","doi-asserted-by":"crossref","unstructured":"R. Canetti, A. Lichtenberg, Certifying trapdoor permutations, revisited, in A. Beimel, S. Dziembowski, editors, TCC\u00a02018, Part\u00a0I. LNCS, vol. 11239 (Springer, Heidelberg, 2018), pp. 476\u2013506","DOI":"10.1007\/978-3-030-03807-6_18"},{"key":"9503_CR22","doi-asserted-by":"crossref","unstructured":"R. Cohen, A. Shelat, D. Wichs, Adaptively secure MPC with sublinear communication complexity, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693 (Springer, Heidelberg, 2019), pp. 30\u201360","DOI":"10.1007\/978-3-030-26951-7_2"},{"key":"9503_CR23","doi-asserted-by":"crossref","unstructured":"G. Danezis, C. Fournet, J. Groth, M. Kohlweiss, Square span programs with applications to succinct NIZK arguments, in P. Sarkar, T. Iwata, editors, ASIACRYPT\u00a02014, Part\u00a0I. LNCS, vol. 8873 (Springer, Heidelberg, 2014), pp. 532\u2013550","DOI":"10.1007\/978-3-662-45611-8_28"},{"key":"9503_CR24","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, Y. Ishai, G. Malavolta, T. Mour, R. Ostrovsky, Trapdoor hash functions and their applications, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694 (Springer, Heidelberg, 2019), pp. 3\u201332","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"9503_CR25","doi-asserted-by":"crossref","unstructured":"A. Escala, G. Herold, E. Kiltz, C. R\u00e0fols, J. Villar, An algebraic framework for Diffie\u2013Hellman assumptions, in R. Canetti, J.A. Garay, editors, CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043 (Springer, Heidelberg, 2013), pp. 129\u2013147","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"9503_CR26","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, Z. Jafargholi, K. Pietrzak, A quasipolynomial reduction for generalized selective decryption on trees, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0I. LNCS, vol. 9215 (Springer, Heidelberg, 2015), pp. 601\u2013620","DOI":"10.1007\/978-3-662-47989-6_29"},{"key":"9503_CR27","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, M. Konstantinov, K. Pietrzak, V. Rao, Adaptive security of constrained PRFs, in P. Sarkar, T. Iwata, editors, ASIACRYPT\u00a02014, Part\u00a0II. LNCS, vol. 8874 (Springer, Heidelberg, 2014), pp. 82\u2013101","DOI":"10.1007\/978-3-662-45608-8_5"},{"issue":"1","key":"9503_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput.29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"9503_CR29","unstructured":"C. Gentry, A fully homomorphic encryption scheme (2009). Ph.D. thesis, Stanford University"},{"key":"9503_CR30","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, A. Sahai, B. Waters, Attribute-based encryption for circuits from multilinear maps, in R. Canetti and J.A. Garay, editors, CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043 (Springer, Heidelberg, 2013), pp. 479\u2013499","DOI":"10.1007\/978-3-642-40084-1_27"},{"issue":"3","key":"9503_CR31","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput.45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9503_CR32","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/s00145-014-9184-y","volume":"28","author":"C Gentry","year":"2015","unstructured":"C. Gentry, J. Groth, Y. Ishai, C. Peikert, A. Sahai, A.D. Smith, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. Journal of Cryptology28(4), 820\u2013843 (2015)","journal-title":"J. Cryptol."},{"key":"9503_CR33","doi-asserted-by":"crossref","unstructured":"R. Gennaro, C. Gentry, B. Parno, M. Raykova, Quadratic span programs and succinct NIZKs without PCPs, in T. Johansson, P.Q. Nguyen, editors, EUROCRYPT\u00a02013. LNCS, vol. 7881 (Springer, Heidelberg, 2013), pp. 626\u2013645","DOI":"10.1007\/978-3-642-38348-9_37"},{"issue":"1","key":"9503_CR34","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput.18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9503_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"O. Goldreich, Y. Oren, Definitions and properties of zero-knowledge proof systems. J. Cryptol.7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"key":"9503_CR36","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of cryptography: Volume 2, basic applications (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9503_CR37","doi-asserted-by":"crossref","unstructured":"J. Groth, R. Ostrovsky, A. Sahai, New techniques for noninteractive zero-knowledge. J. ACM59(3), 11:1\u201311:35 (2012)","DOI":"10.1145\/2220357.2220358"},{"key":"9503_CR38","doi-asserted-by":"crossref","unstructured":"J. Groth, Short non-interactive zero-knowledge proofs, in M. Abe, editor, ASIACRYPT\u00a02010. LNCS, vol. 6477 (Springer, Heidelberg, 2010), pp. 341\u2013358","DOI":"10.1007\/978-3-642-17373-8_20"},{"key":"9503_CR39","doi-asserted-by":"crossref","unstructured":"J. Groth, Short pairing-based non-interactive zero-knowledge arguments, in M. Abe, editor, ASIACRYPT\u00a02010. LNCS, vol. 6477 (Springer, Heidelberg, 2010), pp. 321\u2013340","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"9503_CR40","doi-asserted-by":"crossref","unstructured":"J. Groth, On the size of pairing-based non-interactive arguments, in M. Fischlin, J.-S. Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol. 9666 (Springer, Heidelberg, 2016), pp. 305\u2013326","DOI":"10.1007\/978-3-662-49896-5_11"},{"issue":"5","key":"9503_CR41","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J Groth","year":"2012","unstructured":"J. Groth, A. Sahai, Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput.41(5), 1193\u20131232 (2012)","journal-title":"SIAM J. Comput."},{"key":"9503_CR42","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, D. Wichs, Leveled fully homomorphic signatures from standard lattices, in R.A. Servedio, R. Rubinfeld, editors, 47th ACM STOC (ACM Press, 2015), pp. 469\u2013477","DOI":"10.1145\/2746539.2746576"},{"key":"9503_CR43","doi-asserted-by":"crossref","unstructured":"C. Gentry, D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, in L. Fortnow, S.P. Vadhan, editors, 43rd ACM STOC (ACM Press, 2011), pp. 99\u2013108","DOI":"10.1145\/1993636.1993651"},{"key":"9503_CR44","doi-asserted-by":"crossref","unstructured":"A. Gonz\u00e1lez, A. Zacharakis, Fully-succinct publicly verifiable delegation from constant-size assumptions, in K. Nissim, B. Waters, editors, TCC\u00a02021, Part\u00a0I. LNCS, vol. 13042 (Springer, Heidelberg, 2021), pp. 529\u2013557","DOI":"10.1007\/978-3-030-90459-3_18"},{"key":"9503_CR45","doi-asserted-by":"crossref","unstructured":"B. Hemenway, Z. Jafargholi, R. Ostrovsky, A. Scafuro, D. Wichs, Adaptively secure garbled circuits from one-way functions, in M. Robshaw, J. Katz, editors, CRYPTO\u00a02016, Part\u00a0III. LNCS, vol. 9816 (Springer, Heidelberg, 2016), pp. 149\u2013178","DOI":"10.1007\/978-3-662-53015-3_6"},{"key":"9503_CR46","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, B. Waters, Attribute-based encryption with fast decryption, in K. Kurosawa, G. Hanaoka, editors, PKC\u00a02013. LNCS, vol. 7778 (Springer, Heidelberg, 2013), pp. 162\u2013179","DOI":"10.1007\/978-3-642-36362-7_11"},{"key":"9503_CR47","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Perfect constant-round secure computation via perfect randomizing polynomials, in P. Widmayer, F.T. Ruiz, R.M. Bueno, M. Hennessy, S. Eidenbenz, R. Conejo, editors, ICALP 2002. LNCS, vol. 2380 (Springer, Heidelberg, 2002), pp. 244\u2013256","DOI":"10.1007\/3-540-45465-9_22"},{"key":"9503_CR48","doi-asserted-by":"crossref","unstructured":"A. Jain, Z. Jin, Non-interactive zero knowledge from sub-exponential DDH, in A. Canteaut, F.-X. Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696 (Springer, Heidelberg, 2021), pp. 3\u201332","DOI":"10.1007\/978-3-030-77870-5_1"},{"key":"9503_CR49","doi-asserted-by":"crossref","unstructured":"Z. Jafargholi, C. Kamath, K. Klein, I. Komargodski, K. Pietrzak, D. Wichs. Be adaptive, avoid overcommitting, in J. Katz and H. Shacham, editors, CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401 (Springer, Heidelberg, 2017), pp. 133\u2013163","DOI":"10.1007\/978-3-319-63688-7_5"},{"key":"9503_CR50","doi-asserted-by":"crossref","unstructured":"C.S. Jutla, A. Roy, Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces, in J.A. Garay, R. Gennaro, editors, CRYPTO\u00a02014, Part\u00a0II. LNCS, vol. 8617 (Springer, Heidelberg, 2014), pp. 295\u2013312","DOI":"10.1007\/978-3-662-44381-1_17"},{"issue":"4","key":"9503_CR51","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1007\/s00145-016-9243-7","volume":"30","author":"CS Jutla","year":"2017","unstructured":"C.S. Jutla, A. Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces. J. Cryptol.30(4), 1116\u20131156 (2017)","journal-title":"J. Cryptol."},{"key":"9503_CR52","doi-asserted-by":"crossref","unstructured":"Z. Jafargholi, D. Wichs, Adaptive security of Yao\u2019s garbled circuits, in M. Hirt, A.D. Smith, editors, TCC\u00a02016-B, Part\u00a0I. LNCS, vol. 9985 (Springer, Heidelberg, 2016), pp. 433\u2013458","DOI":"10.1007\/978-3-662-53641-4_17"},{"key":"9503_CR53","doi-asserted-by":"crossref","unstructured":"S. Katsumata, R. Nishimaki, S. Yamada, T. Yamakawa, Designated verifier\/prover and preprocessing NIZKs from Diffie-Hellman assumptions, in Y. Ishai, V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477 (Springer, Heidelberg, 2019), pp. 622\u2013651","DOI":"10.1007\/978-3-030-17656-3_22"},{"key":"9503_CR54","doi-asserted-by":"crossref","unstructured":"S. Katsumata, R. Nishimaki, S. Yamada, T. Yamakawa, Exploring constructions of compact NIZKs from various assumptions, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694 (Springer, Heidelberg, 2019), pp. 639\u2013669","DOI":"10.1007\/978-3-030-26954-8_21"},{"key":"9503_CR55","doi-asserted-by":"crossref","unstructured":"S. Katsumata, R. Nishimaki, S. Yamada, T. Yamakawa, Compact NIZKs from standard assumptions on bilinear maps, in A. Canteaut, Y. Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107 (Springer, Heidelberg, 2020), pp. 379\u2013409","DOI":"10.1007\/978-3-030-45727-3_13"},{"issue":"4","key":"9503_CR56","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00145-021-09408-w","volume":"34","author":"S Katsumata","year":"2021","unstructured":"S. Katsumata, R. Nishimaki, S. Yamada, T. Yamakawa, Compact designated verifier nizks from the CDH assumption without pairings. J. Cryptol.34(4), 42 (2021)","journal-title":"J. Cryptol."},{"key":"9503_CR57","doi-asserted-by":"crossref","unstructured":"Y.T. Kalai, O. Paneth, L. Yang, How to delegate computations publicly, in M. Charikar, E. Cohen, editors, 51st ACM STOC (ACM Press, 2019), pp. 1115\u20131124","DOI":"10.1145\/3313276.3316411"},{"key":"9503_CR58","doi-asserted-by":"crossref","unstructured":"Y.T. Kalai, G.N. Rothblum, R.D. Rothblum, From obfuscation to the security of Fiat-Shamir for proofs, in J. Katz and H. Shacham, editors, CRYPTO\u00a02017, Part\u00a0II. LNCS, vol. 10402 (Springer, Heidelberg, 2017), pp. 224\u2013251","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"9503_CR59","doi-asserted-by":"crossref","unstructured":"E. Kiltz, H. Wee, Quasi-adaptive NIZK for linear subspaces revisited, in E. Oswald, M. Fischlin, editors, EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 101\u2013128","DOI":"10.1007\/978-3-662-46803-6_4"},{"key":"9503_CR60","doi-asserted-by":"crossref","unstructured":"S. Kim, D.J. Wu, Multi-theorem preprocessing NIZKs from lattices, in H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992 (Springer, Heidelberg, 2018), pp. 733\u2013765","DOI":"10.1007\/978-3-319-96881-0_25"},{"issue":"3","key":"9503_CR61","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00145-019-09335-x","volume":"33","author":"L Kowalczyk","year":"2020","unstructured":"L. Kowalczyk, H. Wee, Compact adaptively secure ABE for $$\\text{ NC}^1$$ from $$k$$-Lin. J. Cryptol.33(3), 954\u20131002 (2020)","journal-title":"J. Cryptol."},{"key":"9503_CR62","doi-asserted-by":"crossref","unstructured":"H. Lipmaa, Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments, in R. Cramer, editor, TCC\u00a02012. LNCS, vol. 7194 (Springer, Heidelberg, 2012), pp. 169\u2013189","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"9503_CR63","doi-asserted-by":"crossref","unstructured":"H.K. Maji, M. Prabhakaran, M. Rosulek, Attribute-based signatures, in A. Kiayias, editor, CT-RSA\u00a02011. LNCS, vol. 6558 (Springer, Heidelberg, 2011), pp. 376\u2013392","DOI":"10.1007\/978-3-642-19074-2_24"},{"key":"9503_CR64","doi-asserted-by":"crossref","unstructured":"M. Naor, On cryptographic assumptions and challenges (invited talk), in D. Boneh, editor, CRYPTO\u00a02003. LNCS, vol. 2729 (Springer, Heidelberg, 2003), pp. 96\u2013109","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"9503_CR65","doi-asserted-by":"crossref","unstructured":"D. Naccache, J. Stern, A new public key cryptosystem based on higher residues, in L. Gong, M.K. Reiter, editors, ACM CCS 98 (ACM Press, 1998), pp. 59\u201366","DOI":"10.1145\/288090.288106"},{"key":"9503_CR66","doi-asserted-by":"crossref","unstructured":"T. Okamoto, K. Takashima, Efficient attribute-based signatures for non-monotone predicates in the standard model, in D. Catalano, N. Fazio, Rosario Gennaro, Antonio Nicolosi, editors, PKC\u00a02011. LNCS, vol. 6571 (Springer, Heidelberg, 2011), pp. 35\u201352","DOI":"10.1007\/978-3-642-19379-8_3"},{"key":"9503_CR67","doi-asserted-by":"crossref","unstructured":"R. Pass, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, in A. Sahai, editor, TCC\u00a02013. LNCS, vol. 7785 (Springer, Heidelberg, 2013), pp. 334\u2013354","DOI":"10.1007\/978-3-642-36594-2_19"},{"key":"9503_CR68","doi-asserted-by":"crossref","unstructured":"C. Peikert, S. Shiehian, Noninteractive zero knowledge for NP from (plain) learning with errors, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692 (Springer, Heidelberg, 2019), pp. 89\u2013114","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"9503_CR69","doi-asserted-by":"crossref","unstructured":"A. Sahai, B. Waters, How to use indistinguishability obfuscation: deniable encryption, and more, in D.B. Shmoys, editor, 46th ACM STOC (ACM Press, 2014), pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9503_CR70","doi-asserted-by":"crossref","unstructured":"R. Tsabary, An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both, in Y. Kalai, L. Reyzin, editors, TCC\u00a02017, Part\u00a0II. LNCS, vol. 10678 (Springer, Heidelberg, 2017), pp. 489\u2013518","DOI":"10.1007\/978-3-319-70503-3_16"},{"key":"9503_CR71","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Universal circuits (preliminary report) 196\u2013203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"9503_CR72","doi-asserted-by":"crossref","unstructured":"V.\u00a0Vinod, A. Narayanan, K.\u00a0Srinathan, C.\u00a0Pandu Rangan, K. Kim, On the power of computational secret sharing, in T. Johansson and S. Maitra, editors, INDOCRYPT\u00a02003. LNCS, vol. 2904 (Springer, Heidelberg, 2003), pp. 162\u2013176","DOI":"10.1007\/978-3-540-24582-7_12"},{"key":"9503_CR73","doi-asserted-by":"crossref","unstructured":"B. Waters, Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions, in S. Halevi, editor, CRYPTO\u00a02009. LNCS, vol. 5677 (Springer, Heidelberg, 2009), pp. 619\u2013636","DOI":"10.1007\/978-3-642-03356-8_36"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09503-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09503-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09503-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T10:02:49Z","timestamp":1722333769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09503-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9503"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09503-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"28 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"23"}}