{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:11:20Z","timestamp":1743070280784,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477539"},{"type":"electronic","value":"9783031477546"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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-47754-6_1","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:02:35Z","timestamp":1701334955000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Executing and\u00a0Proving Over\u00a0Dirty Ledgers"],"prefix":"10.1007","author":[{"given":"Christos","family":"Stefo","sequence":"first","affiliation":[]},{"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Lefteris","family":"Kokoris-Kogias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"1_CR1","unstructured":"Bringing the World to Ethereum $$|$$ Polygon. www.polygon.technology"},{"key":"1_CR2","unstructured":"Fuel Network. www.fuel.network"},{"key":"1_CR3","unstructured":"Neon Team. Neon EVM. www.neon-labs.org\/Neon_EVM.pdf. Accessed 3 Aug 2022"},{"key":"1_CR4","unstructured":"Optimism. www.optimism.io"},{"key":"1_CR5","unstructured":"Optimistic rollups: How they work and why they matter (2021). www.medium.com\/stakefish\/optimistic-rollups-how-they-work-and-why-they-matter-3f677a504fcf"},{"key":"1_CR6","unstructured":"What is a zero-knowledge (ZK) rollup? (2022). www.zebpay.com\/blog\/what-is-a-zero-knowledge-rollup-zk"},{"key":"1_CR7","unstructured":"Al-Bassam, M.: LazyLedger: a distributed data availability ledger with client-side smart contracts. arXiv preprint arXiv:1905.09274 (2019)"},{"key":"1_CR8","unstructured":"Al-Bassam, M., Sonnino, A., Buterin, V.: Fraud proofs: maximising light client security and scaling blockchains with dishonest majorities. arXiv preprint arXiv:1809.09044, 160 (2018)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Androulaki, E., et al.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: Proceedings of the Thirteenth EuroSys Conference, pp. 1\u201315 (2018)","DOI":"10.1145\/3190508.3190538"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"key":"1_CR11","unstructured":"Buchman, E.: Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. thesis, University of Guelph (2016)"},{"key":"1_CR12","unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OSDI, vol. 99, pp. 173\u2013186 (1999)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, S., Goren, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Proof of availability & retrieval in a modular blockchain architecture. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-47751-5_3"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.; Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/1041680.1041682","volume":"36","author":"X D\u00e9fago","year":"2004","unstructured":"D\u00e9fago, X., Schiper, A., Urb\u00e1n, P.: Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput. Surv. (CSUR) 36(4), 372\u2013421 (2004)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Faleiro, J.M., Abadi, D.J.: Rethinking serializable multiversion concurrency control. arXiv preprint arXiv:1412.2324 (2014)","DOI":"10.14778\/2809974.2809981"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security, FC 2022. LNCS, vol. 13411, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Gelashvili, R., et al.: Block-STM: scaling blockchain execution by turning ordering curse to a performance blessing. arXiv preprint arXiv:2203.06871 (2022)","DOI":"10.1145\/3572848.3577524"},{"key":"1_CR19","doi-asserted-by":"crossref","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, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"1_CR20","unstructured":"Giridharan, N., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Bullshark: DAG BFT protocols made practical. arXiv preprint arXiv:2201.05677 (2022)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"1_CR22","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. USENIX Association (2016)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. In: Concurrency: The Works of Leslie Lamport, pp. 203\u2013226 (2019)","DOI":"10.1145\/3335772.3335936"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Nayak, K., Ren, L.: Flexible Byzantine fault tolerance. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1041\u20131053 (2019)","DOI":"10.1145\/3319535.3354225"},{"key":"1_CR25","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"1_CR26","unstructured":"Polynya: Rollups, data availability layers & modular blockchains: introductory meta post (2021). www.polynya.medium.com\/rollups-data-availability-layers-modular-blockchains-introductory-meta-post-5a1e7a60119d"},{"key":"1_CR27","unstructured":"Stathakopoulou, C., David, T., Pavlovic, M., Vukoli\u0107, M.: Mir-BFT: high-throughput robust BFT for decentralized networks. arXiv preprint arXiv:1906.05552 (2019)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Stefo, C., Xiang, Z., Kokoris-Kogias, L.: Executing and proving over dirty ledgers. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-47754-6_1"},{"key":"1_CR29","unstructured":"Tas, E.N., Zindros, D., Yang, L., Tse, D.: Light clients for lazy blockchains. arXiv preprint arXiv:2203.15968 (2022)"},{"key":"1_CR30","unstructured":"The DiemBFT Team: State machine replication in the diem blockchain (2021). www.developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"}],"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-031-47754-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T12:01:23Z","timestamp":1730721683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47754-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477539","9783031477546"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47754-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","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":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}