{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T18:33:52Z","timestamp":1784399632621,"version":"3.55.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587368","type":"print"},{"value":"9783031587375","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58737-5_6","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T07:01:52Z","timestamp":1714201312000},"page":"142-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Unbiasable Verifiable Random Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5294-6648","authenticated-orcid":false,"given":"Emanuele","family":"Giunta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4886-1056","authenticated-orcid":false,"given":"Alistair","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"6_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":"6_CR2","unstructured":"Burdges, J., Alper, H.K., Stewart, A., Vasilyev, S.: Ethical identity, ring VRFs, and zero-knowledge continuations. Cryptology ePrint Archive, Report 2023\/002 (2023). https:\/\/eprint.iacr.org\/2023\/002"},{"key":"6_CR3","unstructured":"Burdges, J., Alper, H.K., Stewart, A., Vasilyev, S.: Sassafras and semi-anonymous single leader election. Cryptology ePrint Archive, Report 2023\/031 (2023). https:\/\/eprint.iacr.org\/2023\/031"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 913\u2013930. ACM Press, October 2018","DOI":"10.1145\/3243734.3243848"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Gazi, P., Querejeta-Azurmendi, I., Russell, A.: A composable security treatment of ECVRF and batch verifications. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13556, pp. 22\u201341. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17143-7_2","DOI":"10.1007\/978-3-031-17143-7_2"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-00457-5_33","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2009","unstructured":"Brakerski, Z., Goldwasser, S., Rothblum, G.N., Vaikuntanathan, V.: Weak verifiable random functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 558\u2013576. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_33"},{"key":"6_CR7","doi-asserted-by":"crossref","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, October 2010","DOI":"10.1145\/1866307.1866323"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00208000","volume":"9","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Yung, M.: Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation. J. Cryptol. 9(3), 149\u2013166 (1996)","journal-title":"J. Cryptol."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"6_CR10","series-title":"LNCS","first-page":"537","volume-title":"ACNS 17","author":"I Cascudo","year":"2017","unstructured":"Cascudo, I., David, B.: SCRAPE: Scalable randomness attested by public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 17. LNCS, vol. 10355, pp. 537\u2013556. Springer, Heidelberg (2017)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-64840-4_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"I Cascudo","year":"2020","unstructured":"Cascudo, I., David, B.: ALBATROSS: publicly attestabLe BATched randomness based on secret sharing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 311\u2013341. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_11"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-78381-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Camenisch","year":"2018","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random Oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-78375-8_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"H Corrigan-Gibbs","year":"2018","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The discrete-logarithm problem with\u00a0preprocessing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 415\u2013447. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_14"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-74143-5_17","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Chase","year":"2007","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable VRFs with applications to multi-theorem NIZK. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 303\u2013322. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_17"},{"key":"6_CR15","unstructured":"Chen, J., Micali, S.: Algorand. arXiv preprint arXiv:1607.01341 (2016)"},{"key":"6_CR16","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake protocol. Cryptology ePrint Archive, Report 2017\/573 (2017). https:\/\/eprint.iacr.org\/2017\/573"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-64331-0_29","volume-title":"Financial Cryptography and Data Security","author":"MF Esgin","year":"2021","unstructured":"Esgin, M.F., Kuchta, V., Sakzad, A., Steinfeld, R., Zhang, Z., Sun, S., Chu, S.: Practical post-quantum few-time verifiable random function with applications to Algorand. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 560\u2013578. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_29"},{"key":"6_CR18","unstructured":"Esgin, M.F., Steinfeld, R., Liu, D., Ruj, S.: Efficient hybrid exact\/relaxed lattice proofs and applications to rounding and VRFs. Cryptology ePrint Archive, Report 2022\/141 (2022). https:\/\/eprint.iacr.org\/2022\/141"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st FOCS, pp. 308\u2013317. IEEE Computer Society Press, October 1990","DOI":"10.1109\/FSCS.1990.89549"},{"key":"6_CR21","series-title":"LNCS","first-page":"95","volume-title":"SCN 14","author":"G Fuchsbauer","year":"2014","unstructured":"Fuchsbauer, G.: Constrained verifiable random functions. In: Abdalla, M., De Prisco, R. (eds.) SCN 14. LNCS, vol. 8642, pp. 95\u2013114. Springer, Heidelberg (2014)"},{"issue":"4","key":"6_CR22","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 (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Galindo, D., Liu, J., Ordean, M., Wong, J.-M.: Fully distributed verifiable random functions and their application to decentralised random beacons, pp. 88\u2013102 (2021)","DOI":"10.1109\/EuroSP51992.2021.00017"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Goldberg, S., Naor, M., Papadopoulos, D., Reyzin, L., Vasant, S., Ziv, A.: NSEC5: provably preventing DNSSEC zone enumeration. Cryptology ePrint Archive, Report 2014\/582 (2014). https:\/\/eprint.iacr.org\/2014\/582","DOI":"10.14722\/ndss.2015.23211"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Goldberg, S., Reyzin, L., Papadopoulos, D., V\u010del\u00e1k, J.: Verifiable Random Functions (VRFs). RFC 9381, August 2023","DOI":"10.17487\/RFC9381"},{"key":"6_CR26","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":"6_CR27","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":"6_CR28","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":"6_CR29","unstructured":"Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. Cryptology ePrint Archive, Report 1998\/010 (1998). https:\/\/eprint.iacr.org\/1998\/010"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Lai, Y.-F.: CAPYBARA and TSUBAKI: verifiable random functions from group actions and isogenies. Cryptology ePrint Archive, Report 2023\/182 (2023). https:\/\/eprint.iacr.org\/2023\/182","DOI":"10.62056\/avr-11zn4"},{"issue":"4","key":"6_CR32","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3390\/cryptography4040037","volume":"4","author":"B Liang","year":"2020","unstructured":"Liang, B., Banegas, G., Mitrokotsa, A.: Statically aggregate verifiable random functions and application to e-lottery. Cryptography 4(4), 37 (2020)","journal-title":"Cryptography"},{"issue":"2","key":"6_CR33","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"6_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"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)"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-45760-7_11","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"S Micali","year":"2002","unstructured":"Micali, S., Rivest, R.L.: Micropayments revisited. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 149\u2013163. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_11"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, pp. 120\u2013130. IEEE Computer Society Press, October 1999","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"6_CR37","unstructured":"Papadopoulos, D., et al.: Making NSEC5 practical for DNSSEC. Cryptology ePrint Archive, Report 2017\/099 (2017). https:\/\/eprint.iacr.org\/2017\/099"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press, November 1994","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58737-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:03:46Z","timestamp":1777248226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58737-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587368","9783031587375"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58737-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}