{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:54:45Z","timestamp":1758124485096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031514814"},{"type":"electronic","value":"9783031514821"}],"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-51482-1_17","type":"book-chapter","created":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:02:47Z","timestamp":1704866567000},"page":"332-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Aion: Secure Transaction Ordering Using TEEs"],"prefix":"10.1007","author":[{"given":"Pouriya","family":"Zarbafian","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,11]]},"reference":[{"key":"17_CR1","first-page":"18","volume":"3","author":"T Alves","year":"2004","unstructured":"Alves, T.: TrustZone: integrated hardware and software security. Inf. Q. 3, 18\u201324 (2004)","journal-title":"Inf. Q."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Antoniadis, K., Desjardins, A., Gramoli, V., Guerraoui, R., Zablotchi, I.: Leaderless consensus. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 392\u2013402. IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00045"},{"key":"17_CR3","unstructured":"Antoniadis, K., Guerraoui, R., Malkhi, D., Seredinschi, D.-A.: State machine replication is more expensive than consensus. In: Schmid, U., Widder, J. (eds), 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 7:1\u20137:18. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Anwar, F.M., Garcia, L., Han, X., Srivastava, M.: Securing time in untrusted operating systems with timeseal. In: 2019 IEEE Real-Time Systems Symposium (RTSS), pp. 80\u201392 (2019)","DOI":"10.1109\/RTSS46320.2019.00018"},{"key":"17_CR5","unstructured":"Anwar, F.M., Srivastava, M.: Applications and challenges in securing time. In: 12th USENIX Workshop on Cyber Security Experimentation and Test (CSET 19) (2019)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Arun, B., Peluso, S., Palmieri, R., Losa, G., Ravindran, B.: Speeding up consensus by chasing fast decisions. In: 2017 47th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 49\u201360 (2017)","DOI":"10.1109\/DSN.2017.35"},{"key":"17_CR7","unstructured":"Back, A., et\u00a0al.: Hashcash-a denial of service counter-measure (2013)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Cachin, C., . Mi\u0107i\u0107, J., Steinhauer, N., Zanolini, L.: Quick order fairness. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security. FC 2022. Lecture Notes in Computer Science, vol. 13411, pp. 316\u2013333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_15","DOI":"10.1007\/978-3-031-18283-9_15"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/COMST.2021.3063980","volume":"23","author":"M Chiesa","year":"2021","unstructured":"Chiesa, M., Kamisi\u0144ski, A., Rak, J., Retvari, G., Schmid, S.: A survey of fast-recovery mechanisms in packet-switched networks. IEEE Commun. Surv. Tutorials 23(2), 1253\u20131301 (2021)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"17_CR11","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 (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"issue":"4","key":"17_CR12","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. 36(4), 372\u2013421 (2004)","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"17_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288\u2013323 (1988)","journal-title":"J. ACM (JACM)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Eskandari, S., Moosavi, S., Clark, J.: Transparent dishonesty: front-running attacks on blockchain. In: 3rd Workshop on Trusted Smart Contracts (WTSC) (2019)","DOI":"10.1007\/978-3-030-43725-1_13"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TDSC.2008.13","volume":"7","author":"M Fallah","year":"2008","unstructured":"Fallah, M.: A puzzle-based defense strategy against flooding attacks using game theory. IEEE Trans. Dependable Secure Comput. 7(1), 5\u201319 (2008)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 211\u2013220 (2003)","DOI":"10.1145\/872035.872066"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Gelashvili, R., et al.: Block-STM: scaling blockchain execution by turning ordering curse to a performance blessing. In: Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, pp. 232\u2013244 (2023)","DOI":"10.1145\/3572848.3577524"},{"key":"17_CR20","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":"17_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, S., Rahnama, S., Pandey, S., Crooks, N., Sadoghi, M.: Dissecting BFT consensus: in trusted components we trust! In: Proceedings of the Seventeenth European Conference on Computer Systems (EuroSys), (2023)","DOI":"10.1145\/3552326.3587455"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Heimbach, L., Wattenhofer, R.: SoK: preventing transaction reordering manipulations in decentralized Finance. In: 4th ACM Conference on Advances in Financial Technologies (2022)","DOI":"10.1145\/3558535.3559784"},{"key":"17_CR23","unstructured":"Kelkar, M., Deb, S., Long, S., Juels, A., Kannan, S.: Themis: fast, strong order-fairness in byzantine consensus. In: ConsensusDays 21 (2021)"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-030-56877-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III","author":"M Kelkar","year":"2020","unstructured":"Kelkar, M., Zhang, F., Goldfeder, S., Juels, A.: Order-fairness for byzantine consensus. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III, pp. 451\u2013480. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_16"},{"key":"17_CR25","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":"17_CR26","doi-asserted-by":"crossref","unstructured":"Kursawe, K.: Wendy, the good little fairness widget: achieving order fairness for blockchains. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pp. 25\u201336 (2020)","DOI":"10.1145\/3419614.3423263"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Laishun, Z., Minglei, Z., Yuanbo, G.: A client puzzle based defense mechanism to resist dos attacks in WLAN. In: 2010 International Forum on Information Technology and Applications, vol.\u00a03, pp. 424\u2013427. IEEE (2010)","DOI":"10.1109\/IFITA.2010.288"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Lamport, L.: In: Time, Clocks, and the Ordering of Events in a Distributed System, pp. 179\u2013196. Association for Computing Machinery (2019)","DOI":"10.1145\/3335772.3335934"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: In: The Byzantine Generals Problem, pp. 203\u2013226. Association for Computing Machinery (2019)","DOI":"10.1145\/3335772.3335936"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Sommer, P., Wattenhofer, R.: Optimal clock synchronization in networks. In: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, pp. 225\u2013238 (2009)","DOI":"10.1145\/1644038.1644061"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Liao, J., Zhang, F., Sun, W., Shi, W.: Speedster: an efficient multi-party state channel via enclaves. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 637\u2013651 (2022)","DOI":"10.1145\/3488932.3523259"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Lind, J., Naor, O., Eyal, I., Kelbert, F., Sirer, E.G., Pietzuch, P.: Teechain: a secure payment network with asynchronous blockchain access. In: Proceedings of the 27th ACM Symposium on Operating Systems Principles, pp. 63\u201379 (2019)","DOI":"10.1145\/3341301.3359627"},{"issue":"1","key":"17_CR33","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2018.2860009","volume":"68","author":"J Liu","year":"2018","unstructured":"Liu, J., Li, W., Karame, G.O., Asokan, N.: Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans. Comput. 68(1), 139\u2013151 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-00975-4_5","volume-title":"Passive and Active Network Measurement","author":"C Lumezanu","year":"2009","unstructured":"Lumezanu, C., Baden, R., Spring, N., Bhattacharjee, B.: Triangle inequality and routing policy violations in the internet. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds.) PAM 2009. LNCS, vol. 5448, pp. 45\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00975-4_5"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Lundelius, J., Lynch, N.: A new fault-tolerant algorithm for clock synchronization. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 75\u201388 (1984)","DOI":"10.1145\/800222.806738"},{"issue":"4","key":"17_CR36","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"17_CR37","unstructured":"Malkhi, D., Szalachowski, P.: Maximal extractable value (MEV) protection on a DAG. In: 4th International Conference on Blockchain Economics Security and Protocols (2022)"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"McKeen, F., et al.: Innovative instructions and software model for isolated execution. In: HASP 2013: Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy, vol. 10, p. 1 (2013)","DOI":"10.1145\/2487726.2488368"},{"key":"17_CR39","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":"17_CR40","unstructured":"Mouchet, M., Vaton, S., Chonavel, T.: Statistical characterization of round-trip times with nonparametric hidden Markov models. In: 2019 IFIP\/IEEE Symposium on Integrated Network and Service Management (IM), pp. 43\u201348. IEEE (2019)"},{"key":"17_CR41","doi-asserted-by":"publisher","first-page":"16771","DOI":"10.1109\/ACCESS.2020.2968380","volume":"8","author":"M Mouchet","year":"2020","unstructured":"Mouchet, M., Vaton, S., Chonavel, T., Aben, E., Den Hertog, J.: Large-scale characterization and segmentation of internet path delays with infinite HMMs. IEEE Access 8, 16771\u201316784 (2020)","journal-title":"IEEE Access"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Murdock, K., Oswald, D., Garcia, F.D., Van Bulck, J., Gruss, D., Piessens, F.: Plundervolt: software-based fault injection attacks against intel SGX. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 1466\u20131482. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00057"},{"key":"17_CR43","unstructured":"Nakamoto, S.: Bitcoin: A Peer-to-peer Electronic Cash System. Decentralized Business Review, p. 21260 (2008)"},{"key":"17_CR44","doi-asserted-by":"crossref","unstructured":"Natoli, C., Gramoli, V.: The blockchain anomaly. In: 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), pp. 310\u2013317. IEEE (2016)","DOI":"10.1109\/NCA.2016.7778635"},{"issue":"2","key":"17_CR45","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Qin, K., Zhou, L., Gervais, A.: Quantifying blockchain extractable value: how dark is the forest? In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 198\u2013214 (2022)","DOI":"10.1109\/SP46214.2022.9833734"},{"key":"17_CR47","unstructured":"Rezende, T.F., Sutra, P.: Leaderless state-machine replication: specification, properties, limits. In: 34th International Symposium on Distributed Computing (DISC 2020), volume 179 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 24:1\u201324:17 (2020)"},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Sabt, M., Achemlal, M., Bouabdallah, A.: Trusted execution environment: what it is, and what it is not. In: 2015 IEEE Trustcom\/BigDataSE\/Ispa, vol. 1, pp. 57\u201364. IEEE (2015)","DOI":"10.1109\/Trustcom.2015.357"},{"issue":"11","key":"17_CR49","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)","journal-title":"Commun. ACM"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C., R\u00fcsch, S., Brandenburger, M., Vukoli\u0107, M.: Adding fairness to order: preventing front-running attacks in BFT protocols using tees. In: 2021 40th International Symposium on Reliable Distributed Systems (SRDS), pp. 34\u201345. IEEE (2021)","DOI":"10.1109\/SRDS53918.2021.00013"},{"key":"17_CR51","unstructured":"Wang, X., Reiter, M.K.: Defending against denial-of-service attacks with puzzle auctions. In: 2003 Symposium on Security and Privacy, 2003, pp. 78\u201392. IEEE (2003)"},{"issue":"2014","key":"17_CR52","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Pap. 151(2014), 1\u201332 (2014)","journal-title":"Ethereum Proj. Yellow Pap."},{"issue":"1","key":"17_CR53","first-page":"168","volume":"10","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Zhao, Z., Bao, F., Deng, R.H.: Software puzzle: a countermeasure to resource-inflated denial-of-service attacks. IEEE Trans. Inf. Forensics Secur. 10(1), 168\u2013177 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR54","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"},{"key":"17_CR55","doi-asserted-by":"crossref","unstructured":"Zarbafian, P., Gramoli, V.: Lyra: fast and scalable resilience to reordering attacks in blockchains. In: 2023 IEEE International Parallel & Distributed Processing Symposium. IEEE (2023)","DOI":"10.1109\/IPDPS54959.2023.00097"},{"key":"17_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: TBFT: efficient byzantine fault tolerance using trusted execution environment. In: ICC 2022 - IEEE International Conference on Communications, pp. 1004\u20131009 (2022)","DOI":"10.1109\/ICC45855.2022.9839169"},{"key":"17_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhao, M., Li, T., Han, H.: Survey of attacks and defenses against SGX. In: 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC), pp. 1492\u20131496. IEEE (2020)","DOI":"10.1109\/ITOEC49072.2020.9141835"},{"key":"17_CR58","unstructured":"Zhang, Y., Setty, S., Chen, Q., Zhou, L., Alvisi, L.: Byzantine ordered consensus without byzantine oligarchy. In: Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation, pp. 633\u2013649 (2020)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-51482-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T20:14:10Z","timestamp":1731010450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-51482-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031514814","9783031514821"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-51482-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"478","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":"93","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":"0","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":"19% - 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-4","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":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}