Resilience to Chain-Quality Attacks in Fair Separability

Vincent Gramoli; Zhenliang Lu; Qiang Tang; Pouriya Zarbafian

doi:10.1007/978-3-031-70903-6_13

Resilience to Chain-Quality Attacks in Fair Separability

Vincent Gramoli
, Zhenliang Lu^*
, Qiang Tang
, Pouriya Zarbafian

^*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

In recent years, a new research area called order-fairness has emerged within State Machine Replication (SMR). Its goal is to prevent malicious processes from reordering transactions, ensuring that the SMR output reflects the local orderings observed by processes. One of the advanced approaches to addressing this challenge is fair separability, which is designed to mitigate cyclic dependencies present in transaction dependency graphs. However, in the existing implementation of fair separability, a transaction input by a Byzantine process can be output with only O (1) resources, whereas outputting a transaction input by a correct process requires O (n) resources. This vulnerability exposes the protocol to chain-quality attacks.

In this paper, we propose an implementation of fair separability where the cost of outputting transactions remains consistent for the inputs of all processes, which enhances resilience to chain-quality attacks.

© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

Original language	English
Title of host publication	Computer Security - ESORICS 2024
Subtitle of host publication	29th European Symposium on Research in Computer Security, Proceedings, Part IV
Editors	Joaquin Garcia-Alfaro, Rafał Kozik, Michał Choraś, Sokratis Katsikas
Publisher	Springer, Cham
Pages	251-270
Edition	1
ISBN (Electronic)	978-3-031-70903-6
ISBN (Print)	978-3-031-70902-9
DOIs	https://doi.org/10.1007/978-3-031-70903-6_13
Publication status	Published - Sept 2024
Externally published	Yes
Event	29th European Symposium on Research in Computer Security (ESORICS 2024) - Bydgoszcz University of Science and Technology, Bydgoszcz, Poland Duration: 16 Sept 2024 → 20 Sept 2024 https://esorics2024.org/

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14985 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	29th European Symposium on Research in Computer Security (ESORICS 2024)
Place	Poland
City	Bydgoszcz
Period	16/09/24 → 20/09/24
Internet address	https://esorics2024.org/

Funding

This research is supported under Australian Research Council Future Fellowship funding scheme (project number 180100496) entitled \u201CThe Red Belly Blockchain: A Scalable Blockchain for Internet of Things\u201D.

Access Output

10.1007/978-3-031-70903-6_13

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Gramoli, V., Lu, Z., Tang, Q., & Zarbafian, P. (2024). Resilience to Chain-Quality Attacks in Fair Separability. In J. Garcia-Alfaro, R. Kozik, M. Choraś, & S. Katsikas (Eds.), Computer Security - ESORICS 2024: 29th European Symposium on Research in Computer Security, Proceedings, Part IV (1 ed., pp. 251-270). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14985 LNCS). Springer, Cham. https://doi.org/10.1007/978-3-031-70903-6_13

Gramoli, Vincent ; Lu, Zhenliang ; Tang, Qiang et al. / Resilience to Chain-Quality Attacks in Fair Separability. Computer Security - ESORICS 2024: 29th European Symposium on Research in Computer Security, Proceedings, Part IV. editor / Joaquin Garcia-Alfaro ; Rafał Kozik ; Michał Choraś ; Sokratis Katsikas. 1. ed. Springer, Cham, 2024. pp. 251-270 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fe36cca6ef02492d9742bcbf85ae9ab3,

title = "Resilience to Chain-Quality Attacks in Fair Separability",

abstract = "In recent years, a new research area called order-fairness has emerged within State Machine Replication (SMR). Its goal is to prevent malicious processes from reordering transactions, ensuring that the SMR output reflects the local orderings observed by processes. One of the advanced approaches to addressing this challenge is fair separability, which is designed to mitigate cyclic dependencies present in transaction dependency graphs. However, in the existing implementation of fair separability, a transaction input by a Byzantine process can be output with only O (1) resources, whereas outputting a transaction input by a correct process requires O (n) resources. This vulnerability exposes the protocol to chain-quality attacks. In this paper, we propose an implementation of fair separability where the cost of outputting transactions remains consistent for the inputs of all processes, which enhances resilience to chain-quality attacks. {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.",

author = "Vincent Gramoli and Zhenliang Lu and Qiang Tang and Pouriya Zarbafian",

year = "2024",

month = sep,

doi = "10.1007/978-3-031-70903-6\_13",

language = "English",

isbn = "978-3-031-70902-9",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Cham",

pages = "251--270",

editor = "Joaquin Garcia-Alfaro and Rafa{\l} Kozik and Micha{\l} Chora{\'s} and Sokratis Katsikas",

booktitle = "Computer Security - ESORICS 2024",

edition = "1",

note = "29th European Symposium on Research in Computer Security (ESORICS 2024) ; Conference date: 16-09-2024 Through 20-09-2024",

url = "https://esorics2024.org/",

}

Gramoli, V, Lu, Z, Tang, Q & Zarbafian, P 2024, Resilience to Chain-Quality Attacks in Fair Separability. in J Garcia-Alfaro, R Kozik, M Choraś & S Katsikas (eds), Computer Security - ESORICS 2024: 29th European Symposium on Research in Computer Security, Proceedings, Part IV. 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14985 LNCS, Springer, Cham, pp. 251-270, 29th European Symposium on Research in Computer Security (ESORICS 2024), Bydgoszcz, Poland, 16/09/24. https://doi.org/10.1007/978-3-031-70903-6_13

Resilience to Chain-Quality Attacks in Fair Separability. / Gramoli, Vincent; Lu, Zhenliang; Tang, Qiang et al.
Computer Security - ESORICS 2024: 29th European Symposium on Research in Computer Security, Proceedings, Part IV. ed. / Joaquin Garcia-Alfaro; Rafał Kozik; Michał Choraś; Sokratis Katsikas. 1. ed. Springer, Cham, 2024. p. 251-270 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14985 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Resilience to Chain-Quality Attacks in Fair Separability

AU - Gramoli, Vincent

AU - Lu, Zhenliang

AU - Tang, Qiang

AU - Zarbafian, Pouriya

PY - 2024/9

Y1 - 2024/9

N2 - In recent years, a new research area called order-fairness has emerged within State Machine Replication (SMR). Its goal is to prevent malicious processes from reordering transactions, ensuring that the SMR output reflects the local orderings observed by processes. One of the advanced approaches to addressing this challenge is fair separability, which is designed to mitigate cyclic dependencies present in transaction dependency graphs. However, in the existing implementation of fair separability, a transaction input by a Byzantine process can be output with only O (1) resources, whereas outputting a transaction input by a correct process requires O (n) resources. This vulnerability exposes the protocol to chain-quality attacks. In this paper, we propose an implementation of fair separability where the cost of outputting transactions remains consistent for the inputs of all processes, which enhances resilience to chain-quality attacks. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

AB - In recent years, a new research area called order-fairness has emerged within State Machine Replication (SMR). Its goal is to prevent malicious processes from reordering transactions, ensuring that the SMR output reflects the local orderings observed by processes. One of the advanced approaches to addressing this challenge is fair separability, which is designed to mitigate cyclic dependencies present in transaction dependency graphs. However, in the existing implementation of fair separability, a transaction input by a Byzantine process can be output with only O (1) resources, whereas outputting a transaction input by a correct process requires O (n) resources. This vulnerability exposes the protocol to chain-quality attacks. In this paper, we propose an implementation of fair separability where the cost of outputting transactions remains consistent for the inputs of all processes, which enhances resilience to chain-quality attacks. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

UR - https://www.scopus.com/pages/publications/85204383632

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85204383632&origin=recordpage

U2 - 10.1007/978-3-031-70903-6_13

DO - 10.1007/978-3-031-70903-6_13

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 978-3-031-70902-9

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 251

EP - 270

BT - Computer Security - ESORICS 2024

A2 - Garcia-Alfaro, Joaquin

A2 - Kozik, Rafał

A2 - Choraś, Michał

A2 - Katsikas, Sokratis

PB - Springer, Cham

T2 - 29th European Symposium on Research in Computer Security (ESORICS 2024)

Y2 - 16 September 2024 through 20 September 2024

ER -

Gramoli V, Lu Z, Tang Q, Zarbafian P. Resilience to Chain-Quality Attacks in Fair Separability. In Garcia-Alfaro J, Kozik R, Choraś M, Katsikas S, editors, Computer Security - ESORICS 2024: 29th European Symposium on Research in Computer Security, Proceedings, Part IV. 1 ed. Springer, Cham. 2024. p. 251-270. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2024 Sept 5. doi: 10.1007/978-3-031-70903-6_13

Resilience to Chain-Quality Attacks in Fair Separability

Abstract

Publication series

Conference

Funding

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this