{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:09:56Z","timestamp":1764886196602,"version":"3.46.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12290-2_16","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:09Z","timestamp":1764886029000},"page":"478-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Verifiable Random Functions Without Obfuscation and\u00a0Friends"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5120-6346","authenticated-orcid":false,"given":"Nicholas","family":"Brandt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2505-4246","authenticated-orcid":false,"given":"Miguel","family":"Cueto Noval","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5790-695X","authenticated-orcid":false,"given":"Christoph U.","family":"G\u00fcnther","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8929-0221","authenticated-orcid":false,"given":"Akin","family":"\u00dcnal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4609-6599","authenticated-orcid":false,"given":"Stella","family":"Wohnig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-01001-9_32","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M Abdalla","year":"2009","unstructured":"Abdalla, M., Catalano, D., Fiore, D.: Verifiable random functions from identity-based key encapsulation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 554\u2013571. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_32"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-319-29485-8_24","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"H Abusalah","year":"2016","unstructured":"Abusalah, H., Fuchsbauer, G., Pietrzak, K.: Constrained PRFs for unbounded inputs. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 413\u2013428. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_24"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-64375-1_6","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Wichs, D., Yamada, S.: Optimal broadcast encryption from LWE and pairings in the standard model. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 149\u2013178. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_6"},{"key":"16_CR4","unstructured":"Akiyama, R., et al.: QR-UOV. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"16_CR5","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-03298-1_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M Belenkiy","year":"2009","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: Compact E-cash and simulatable VRFs revisited. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 114\u2013131. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_9"},{"key":"16_CR7","unstructured":"Benadjila, R., Bouillaguet, C., Feneuil, T., Rivain, M.: MQOM \u2014 MQ on my Mind. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Beullens, W., Campos, F., Celi, S., Hess, B., Kannwischer, M.J.: MAYO. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures","DOI":"10.46586\/tches.v2024.i2.252-275"},{"key":"16_CR9","unstructured":"Beullens, W., et al.: UOV \u2014 Unbalanced Oil and Vinegar. Technical report, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-70503-3_19","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N.: Verifiable random functions from non-interactive witness-indistinguishable proofs. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 567\u2013594. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_19"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00145-019-09331-1","volume":"33","author":"N Bitansky","year":"2019","unstructured":"Bitansky, N.: Verifiable random functions from non-interactive witness-indistinguishable proofs. J. Cryptol. 33(2), 459\u2013493 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09331-1","journal-title":"J. Cryptol."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-91098-2_8","volume-title":"Advances in Cryptology - EUROCRYPT 2025","author":"D Boneh","year":"2025","unstructured":"Boneh, D., Haitner, I., Lindell, Y., Segev, G.: Exponent-VRFs and their applications. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025, pp. 195\u2013224. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_8"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Montgomery, H.W., Raghunathan, A.: Algebraic pseudorandom functions with improved efficiency from the augmented cascade. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 131\u2013140. ACM Press (2010). https:\/\/doi.org\/10.1145\/1866307.1866323","DOI":"10.1145\/1866307.1866323"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Brandt, N., Hofheinz, D., Kastner, J., \u00dcnal, A.: The price of verifiability: lower bounds for verifiable random functions. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 747\u2013776. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_26","DOI":"10.1007\/978-3-031-22365-5_26"},{"key":"16_CR17","unstructured":"Brandt, N., Noval, M.C., G\u00fcnther, C.U., \u00dcnal, A., Wohnig, S.: Constrained verifiable random functions without obfuscation and friends. Cryptology ePrint Archive, Paper 2025\/1045 (2025). https:\/\/eprint.iacr.org\/2025\/1045"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Brzuska, C., \u00dcnal, A., Woo, I.K.Y.: Evasive LWE assumptions: definitions, classes, and counterexamples. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 418\u2013449. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_14","DOI":"10.1007\/978-981-96-0894-2_14"},{"key":"16_CR19","unstructured":"Chandran, N., Raghuraman, S., Vinayagamurthy, D.: Constrained pseudorandom functions: verifiable and delegatable. Cryptology ePrint Archive, Report 2014\/522 (2014). https:\/\/eprint.iacr.org\/2014\/522"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-33027-8_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"C-M Cheng","year":"2012","unstructured":"Cheng, C.-M., Chou, T., Niederhagen, R., Yang, B.-Y.: Solving quadratic equations with XL on parallel architectures. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 356\u2013373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_21"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"N Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Dao, Q., Jain, A., Jin, Z.: Non-interactive zero-knowledge from LPN and MQ. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 321\u2013360. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_10","DOI":"10.1007\/978-3-031-68400-5_10"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Datta, P.: Constrained pseudorandom functions from functional encryption. Theor. Comput. Sci. 809, 137\u2013170 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.12.004. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397519307662","DOI":"10.1016\/j.tcs.2019.12.004"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-54388-7_16","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"P Datta","year":"2017","unstructured":"Datta, P., Dutta, R., Mukhopadhyay, S.: Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 463\u2013493. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_16"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Datta, P., Dutta, R., Mukhopadhyay, S.: Constrained pseudorandom functions for turing machines revisited: how to achieve verifiability and key delegation. Algorithmica 81(9), 3245\u20133390 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00576-7","DOI":"10.1007\/s00453-019-00576-7"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-662-49896-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Deshpande","year":"2016","unstructured":"Deshpande, A., Koppula, V., Waters, B.: Constrained pseudorandom functions for unconstrained inputs. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 124\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_5"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-10879-7_7","volume-title":"Security and Cryptography for Networks","author":"G Fuchsbauer","year":"2014","unstructured":"Fuchsbauer, G.: Constrained verifiable random functions. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 95\u2013114. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_7"},{"issue":"4","key":"16_CR29","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986). https:\/\/doi.org\/10.1145\/6490.6503","journal-title":"J. ACM"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-70503-3_18","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Hohenberger, S., Koppula, V., Waters, B.: A generic approach to constructing and proving verifiable random functions. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 537\u2013566. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_18"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-031-91832-2_6","volume-title":"Public-Key Cryptography - PKC 2025","author":"AB Hansen","year":"2025","unstructured":"Hansen, A.B., Nielsen, J.B., Simkin, M.: Ocash: fully anonymous payments between blockchain light clients. In: Jager, T., Pan, J. (eds.) PKC 2025, pp. 169\u2013202. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91832-2_6"},{"issue":"4","key":"16_CR32","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-662-49096-9_14","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Jager, T.: Verifiable random functions from standard assumptions. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 336\u2013362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_14"},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., Kastner, J., Klein, K.: The power of undirected rewindings for adaptive security. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 725\u2013758. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_24","DOI":"10.1007\/978-3-031-38545-2_24"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/978-3-642-13190-5_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Hohenberger","year":"2010","unstructured":"Hohenberger, S., Waters, B.: Constructing verifiable random functions with large input spaces. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 656\u2013672. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_33"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-46497-7_5","volume-title":"Theory of Cryptography","author":"T Jager","year":"2015","unstructured":"Jager, T.: Verifiable random functions from weaker assumptions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 121\u2013143. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_5"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-70700-6_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Katsumata","year":"2017","unstructured":"Katsumata, S.: On the untapped potential of encoding predicates by arithmetic circuits and\u00a0their\u00a0applications. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 95\u2013125. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_4"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516668","DOI":"10.1145\/2508859.2516668"},{"key":"16_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17259-6_14","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"L Kohl","year":"2019","unstructured":"Kohl, L.: Hunting and gathering \u2013 verifiable random functions from standard assumptions with short proofs. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 408\u2013437. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_14"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. In: 17th ACM STOC, pp. 363\u2013365. ACM Press (1985). https:\/\/doi.org\/10.1145\/22145.22185","DOI":"10.1145\/22145.22185"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-26059-4_3","volume-title":"Provable Security","author":"B Liang","year":"2015","unstructured":"Liang, B., Li, H., Chang, J.: Constrained verifiable random functions from indistinguishability obfuscation. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 43\u201360. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_3"},{"issue":"1","key":"16_CR42","doi-asserted-by":"publisher","first-page":"4187892","DOI":"10.1155\/2019\/4187892","volume":"2019","author":"M Liu","year":"2019","unstructured":"Liu, M., Zhang, P., Wu, Q.: A novel construction of constrained verifiable random functions. Secur. Commun. Netw. 2019(1), 4187892 (2019). https:\/\/doi.org\/10.1155\/2019\/4187892","journal-title":"Secur. Commun. Netw."},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_38"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"16_CR45","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, pp. 120\u2013130. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"16_CR46","unstructured":"Mohamed, M.S.E., Ding, J., Buchmann, J.: Algebraic cryptanalysis of MQQ public key cryptosystem by MutantXL. Cryptology ePrint Archive, Report 2008\/451 (2008). https:\/\/eprint.iacr.org\/2008\/451"},{"key":"16_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-88403-3_14","volume-title":"Post-Quantum Cryptography","author":"MSE Mohamed","year":"2008","unstructured":"Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: solving polynomial equations over GF(2) using an improved mutant strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203\u2013215. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_14"},{"key":"16_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-75248-4_3","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"D Niehues","year":"2021","unstructured":"Niehues, D.: Verifiable random functions with\u00a0optimal tightness. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 61\u201391. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_3"},{"key":"16_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-030-00434-7_22","volume-title":"Cryptology and Network Security","author":"R Ro\u015fie","year":"2018","unstructured":"Ro\u015fie, R.: Adaptive-secure VRFs with shorter keys from static assumptions. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 440\u2013459. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_22"},{"key":"16_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"16_CR51","doi-asserted-by":"publisher","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"16_CR52","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"16_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Yamada","year":"2017","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 161\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_6"},{"key":"16_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11496618_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B-Y Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL family: theory and practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67\u201386. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496618_7"},{"key":"16_CR55","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-031-45933-7_22","volume-title":"Science of Cyber Security","author":"Y Zan","year":"2023","unstructured":"Zan, Y., Li, H., Xu, H.: Adaptively secure constrained verifiable random function. In: Yung, M., Chen, C., Meng, W. (eds.) Science of Cyber Security, pp. 367\u2013385. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-45933-7_22"}],"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-032-12290-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:10Z","timestamp":1764886030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","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":"Aarhus","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}