{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:38:43Z","timestamp":1767339523134,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031769337"},{"type":"electronic","value":"9783031769344"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-76934-4_8","type":"book-chapter","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T18:16:12Z","timestamp":1734459372000},"page":"119-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Verifiable Random Function with Compact Proof"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4574-0067","authenticated-orcid":false,"given":"Ahmet Ramazan","family":"A\u011f\u0131rta\u015f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6505-7038","authenticated-orcid":false,"given":"Arda Bu\u011fra","family":"\u00d6zer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7575-3272","authenticated-orcid":false,"given":"Z\u00fclf\u00fckar","family":"Sayg\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8945-2780","authenticated-orcid":false,"given":"O\u011fuz","family":"Yayla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"8_CR1","unstructured":"Akhunov, A., Ben\u00a0Sasson, E., Brand, T., Guthmann, L., Levy, A.: EIP-2028: transaction data gas cost reduction. Ethereum Improvement Proposals, no. 2028 (2019). https:\/\/eips.ethereum.org\/EIPS\/eip-2028. Accessed 30 Aug 2024"},{"key":"8_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-031-17140-6_2","volume-title":"ESORICS 2022","author":"M Buser","year":"2022","unstructured":"Buser, M., et al.: Post-quantum verifiable random function from symmetric primitives in PoS blockchain. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13554, pp. 25\u201345. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17140-6_2"},{"key":"8_CR3","unstructured":"Chainlink: chainlink VRF (2024). https:\/\/docs.chain.link\/vrf. Accessed 30 Aug 2024"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36288-6_1","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 1\u201317. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_1"},{"key":"8_CR6","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":"8_CR7","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., et al.: 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":"8_CR8","doi-asserted-by":"publisher","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 427\u2013438 (1987). https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Galindo, D., Liu, J., Ordean, M., Wong, J.M.: Fully distributed verifiable random functions and their application to decentralised random beacons. In: 2021 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 88\u2013102 (2021). https:\/\/doi.org\/10.1109\/EuroSP51992.2021.00017","DOI":"10.1109\/EuroSP51992.2021.00017"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20, 51\u201383 (2007). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptol."},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP 2017 pp. 51\u201368. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Goldberg, S., Reyzin, L., Papadopoulos, D., V\u010del\u00e1k, J.: Verifiable Random Functions (VRFs). RFC 9381 (2023). https:\/\/doi.org\/10.17487\/RFC9381. https:\/\/www.rfc-editor.org\/info\/rfc9381","DOI":"10.17487\/RFC9381"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Hanke, T., Movahedi, M., Williams, D.: Dfinity technology overview series, consensus system (2018). https:\/\/doi.org\/10.48550\/arXiv.1805.04548","DOI":"10.48550\/arXiv.1805.04548"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Kate, A., Mangipudi, E.V., Maradana, S., Mukherjee, P.: Flexirand: output private (distributed) VRFs and application to blockchains. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1776\u20131790 (2023). https:\/\/doi.org\/10.1145\/3576915.3616601","DOI":"10.1145\/3576915.3616601"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-02937-5_14","volume-title":"Cryptology and Network Security","author":"V Kuchta","year":"2013","unstructured":"Kuchta, V., Manulis, M.: Unique aggregate signatures with applications to distributed verifiable random functions. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol. 8257, pp. 251\u2013270. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02937-5_14"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science (cat. No. 99CB37039), pp. 120\u2013130. IEEE (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"8_CR17","unstructured":"Papadopoulos, D., et al.: Making NSEC5 practical for DNSSEC. Cryptology ePrint Archive, Paper 2017\/099 (2017). https:\/\/eprint.iacr.org\/2017\/099"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Patel, S., Persiano, G., Seo, J.Y., Yeo, K.: Efficient secret sharing for large-scale applications. Cryptology ePrint Archive, Paper 2024\/1045 (2024). https:\/\/doi.org\/10.1145\/3658644.3670379","DOI":"10.1145\/3658644.3670379"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"8_CR21","unstructured":"Polkadot: cryptography on polkadot (2024). https:\/\/wiki.polkadot.network\/docs\/learn-cryptography. Accessed 30 Aug 2024"},{"issue":"11","key":"8_CR22","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"8_CR23","unstructured":"Vlasov, A., Olson, K., Stokes, A., Sanso, A.: EIP-2537: precompile for BLS12-381 curve operations [draft]. Ethereum improvement proposals, no. 2537 (2020). https:\/\/eips.ethereum.org\/EIPS\/eip-2537. Accessed 30 Aug 2024"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-76934-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T19:03:05Z","timestamp":1734462185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-76934-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9783031769337","9783031769344"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-76934-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","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":"20 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}