{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:00:32Z","timestamp":1767315632994,"version":"3.48.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070340","type":"print"},{"value":"9783032070357","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-07035-7_15","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:58:00Z","timestamp":1767315480000},"page":"243-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Short Paper: Rewardable Naysayer Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6975-0851","authenticated-orcid":false,"given":"Gennaro","family":"Avitabile","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1813-1132","authenticated-orcid":false,"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2381-5846","authenticated-orcid":false,"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Pinkas, B., Yanai, A.: Blinder - scalable, robust anonymous committed broadcast. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1233\u20131252. ACM Press (2020)","DOI":"10.1145\/3372297.3417261"},{"key":"15_CR2","series-title":"Part II, volume 14005 of LNCS","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-031-30617-4_10","volume-title":"EUROCRYPT 2023","author":"H Abusalah","year":"2023","unstructured":"Abusalah, H., Cini, V.: An incremental PoSW for general weight distributions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Part II, volume 14005 of LNCS, pp. 282\u2013311. Springer, Cham (2023)"},{"key":"15_CR3","series-title":"Part II, volume 11477 of LNCS","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-17656-3_10","volume-title":"EUROCRYPT 2019","author":"H Abusalah","year":"2019","unstructured":"Abusalah, H., Kamath, C., Klein, K., Pietrzak, K., Walter, M.: Reversible proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part II, volume 11477 of LNCS, pp. 277\u2013291. Springer, Cham (2019)"},{"key":"15_CR4","unstructured":"Ambrona, M., Beunardeau, M., Toledo, R.R.: Timed commitments revisited. Cryptology ePrint Archive, Report 2023\/977 (2023)"},{"key":"15_CR5","unstructured":"Arbitrum. Docs. https:\/\/docs.arbitrum.io"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., Chiang, J.H., David, B., Frederiksen, T.K., Gentile, L.: Sok: mitigation of front-running in decentralized finance. In: Matsuo, S., et al. (eds.) FC 2022 International Workshops, LNCS. vol. 13412, pp. 250\u2013271. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-32415-4_17","DOI":"10.1007\/978-3-031-32415-4_17"},{"key":"15_CR7","unstructured":"Bebel, J., Ojha, D.: Ferveo: threshold decryption for mempool privacy in BFT networks. Cryptology ePrint Archive, Report 2022\/898 (2022)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-030-77870-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J Burdges","year":"2021","unstructured":"Burdges, J., De Feo, L.: Delay encryption. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 302\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_11"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Goldwasser, S.: An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack (extended abstract). In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 90\u2013106. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_7"},{"key":"15_CR12","unstructured":"Chen, E., Chon, A.: Injective protocol: a collision resistant decentralized exchange protocol (2018)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Choi, K., Manoj, A., Bonneau, J.: SoK: distributed randomness beacons. In: 2023 IEEE Symposium on Security and Privacy, pp. 75\u201392. IEEE Computer Society Press (2023)","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"15_CR14","unstructured":"Choudhuri, A.R., Garg, S., Piet, J., Policharla, G.V.: Mempool privacy via batched threshold encryption: attacks and defenses. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: 2020 IEEE Symposium on Security and Privacy, pp. 910\u2013927. IEEE Computer Society Press (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-17656-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Lai, R.W.F., Malavolta, G.: Incremental proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 292\u2013323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_11"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-030-43725-1_13","volume-title":"Financial Cryptography and Data Security","author":"S Eskandari","year":"2020","unstructured":"Eskandari, S., Moosavi, S., Clark, J.: SoK: transparent dishonesty: front-running attacks on blockchain. In: Bracciali, A., Clark, J., Pintore, F., R\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 170\u2013189. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_13"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., Pietrzak, K.: Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation. Cryptology ePrint Archive, Paper 2024\/481 (2024)","DOI":"10.1007\/978-3-031-91820-9_2"},{"key":"15_CR21","unstructured":"Linea. Documentation. https:\/\/docs.linea.build\/"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Lu, D., Yurek, T., Kulshreshtha, S., Govind, R., Kate, A., Miller, A.: Honeybadgermpc and asynchromix: practical asynchronous mpc and its application to anonymous communication. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, pp. 887\u2013903. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3319535.3354238"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) ITCS 2013, pp. 373\u2013388. ACM (2013)","DOI":"10.1145\/2422436.2422479"},{"key":"15_CR24","unstructured":"Optimism. Docs. https:\/\/docs.optimism.io\/"},{"key":"15_CR25","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) ITCS 2019, vol. 124, pp. 60:1\u201360:15. LIPIcs (2019)"},{"key":"15_CR26","unstructured":"Sariboz, E., Panwar, G., Vishwanathan, R., Misra, S.: FIRST: frontrunning resilient smart contracts. CoRR arxiv:2204.00955 (2022)"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Seres, I.A., Glaeser, N., Bonneau, J.: Short paper: Naysayer proofs. In: Clark, J., Shi, E. (eds.) FC 2024, March 2024, Revised Selected Papers, Part II. LNCS, vol. 14745, pp. 22\u201332. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-78679-2_2","DOI":"10.1007\/978-3-031-78679-2_2"},{"key":"15_CR28","unstructured":"StarkEx. Documentation. https:\/\/docs.starkware.co\/starkex\/overview.html"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, Arguments, and Zero-Knowledge (2023)","DOI":"10.1561\/9781638281252"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part III. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07035-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:58:02Z","timestamp":1767315482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07035-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070340","9783032070357"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07035-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}