PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite

Kozhaya, David; Decouchant, Jérémie; Rahli, Vincent; Esteves-Veríssimo, Paulo

doi:10.1109/tpds.2021.3056718

Cited by 18 publications

(5 citation statements)

References 35 publications

(58 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reliable broadcast [8,32] in addition requires that if a correct node delivers 𝑚 then all correct nodes eventually deliver it, regardless of whether the sender is correct or not. A total order (or atomic) broadcast protocol additionally guarantees that correct nodes deliver messages in the same order [11,33]. Total order can be provided by a consensus protocol [10,51,53].…”

Section: Byzantine Committees and Broadcastmentioning

confidence: 99%

SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

Ersoy¹,

Decouchant²,

Kimble³

et al. 2022

Preprint

View full text Add to dashboard Cite

Payment channel networks (PCNs) enhance the scalability of blockchains by allowing parties to conduct transactions off-chain, i.e, without broadcasting every transaction to all blockchain participants. To conduct transactions, a sender and a receiver can either establish a direct payment channel with a funding blockchain transaction or leverage existing channels in a multi-hop payment. The security of PCNs usually relies on the synchrony of the underlying blockchain, i.e., evidence of misbehavior needs to be published on the blockchain within a time limit. Alternative payment channel proposals that do not require blockchain synchrony rely on quorum certificates and use a committee to register the transactions of a channel. However, these proposals do not support multi-hop payments, a limitation we aim to overcome.In this paper, we demonstrate that it is in fact impossible to design a multi-hop payment protocol with both network asynchrony and faulty channels, i.e., channels that may not correctly follow the protocol. We then detail two committee-based multi-hop payment protocols that respectively assume synchronous communications and possibly faulty channels, or asynchronous communication and correct channels. The first protocol relies on possibly faulty committees instead of the blockchain to resolve channel disputes, and enforces privacy properties within a synchronous network. The second one relies on committees that contain at most 𝑓 faulty members out of 3𝑓 +1 and successively delegate to each other the role of eventually completing a multi-hop payment. We show that both protocols satisfy the security requirements of a multi-hop payment and compare their communication complexity and latency. INTRODUCTIONPayment channel networks (PCNs) [25] allow faster, cheaper, and more energy-efficient transactions than blockchains. Their key advantage is that most transactions can be conducted using only local communication whereas blockchains usually require broadcasting transactions to all participants for verification. The largest PCN, Lightning [48], has a capacity of more than 100 million euros as of January 29, 2022 [1].In a PCN, two parties can open and fund bi-directional channels using a blockchain transaction. Once their channel has been opened, the two parties can conduct transactions by updating their shared This document is a preprint of a paper accepted at the ACM conference on Advances in Financial Technologies (AFT 2022).

show abstract

Section: Byzantine Committees and Broadcastmentioning

confidence: 99%

SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

Ersoy¹,

Decouchant²,

Kimble³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…When the user cannot obtain the desired information by using one role, he is likely to access it through another role to achieve his purpose, that is, this class The model is very vulnerable to Sybil attack. At the same time, the permissions corresponding to roles in the model are static and cannot change with the change of different conditions, so the model is less dynamic [17][18]. The basic architecture of RBAC is shown in Figure 4:…”

Section: Figure 2 Tbac Basic Architecturementioning

confidence: 99%

Distributed System Access Control for Fuzzy Mathematics and Probability Theory

2022

DPS

View full text Add to dashboard Cite

AC is to control and manage the access rights of legitimate users who enter the system on the basis of user identity authentication, so that the user's access rights are limited within the allowable range. It is an important part of information security technology. Implementing AC to users through technical means plays an important role in information security. The main purpose of this paper is to use fuzzy mathematics (FMs) and probability theory (PT) to study the access control (AC) of distributed systems (DS). This paper adds trust elements on the basis of the AC model, sets roles for each trust level, and sets a series of permissions for each role. The user determines the trust level to which he belongs by being judged by other users, and then obtains the corresponding authority through the role corresponding to the trust level. Experiments show that by evaluating the trust degree and the reputation value of user behavior, the ability of user trust degree and service and access behavior is greatly improved. Compared with the existing trust evaluation algorithm, it has a good correlation. At the same time, it satisfies the rule of "slow increase and sudden decrease" of the target change trust degree, which can effectively resist malicious users' phishing attacks, bleaching attacks, collusion attacks and other security attacks, and has higher security.

show abstract

“…Recently, Contagion [17] replaced quorums by smaller stochastic samples, and described an abstraction whose properties can be violated with a probability that depends on the size of the samples. Differently, RT-ByzCast [18] and PISTIS [19] aimed at providing real-time guarantees in probabilistically synchronous and reliable networks. The idea of using pseudorandomized message dissemination has been used to tolerate malicious or selfish behaviors in several works [20,21], which however only provide probabilistic guarantees, while we target exact deterministic guarantees.…”

Section: Related Workmentioning

confidence: 99%

Practical Byzantine Reliable Broadcast on Partially Connected Networks

Bonomi

Decouchant

Farina

et al. 2021

2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)

Self Cite

View full text Add to dashboard Cite

Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document.When citing, please reference the published version. Take down policy While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

show abstract

PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite

Cited by 18 publications

References 35 publications

SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

Distributed System Access Control for Fuzzy Mathematics and Probability Theory

Practical Byzantine Reliable Broadcast on Partially Connected Networks

Contact Info

Product

Resources

About