Usamos cookies para melhorar nosso site e a sua experiência. Ao continuar a navegar no site, você aceita a nossa política de cookies. Ver mais
Aceitar Rejeitar
  • Menu
de interesse


  • Nome

    Houssam Ahmad Yactin
  • Cluster

  • Cargo

    Estudante Externo
  • Desde

    15 março 2016


On the feasibility of byzantine agreement to secure fog/edge data management

Shoker, A; Yactine, H;

Advances in Information Security

Fog/Edge computing improves the latency and security of data by keeping storage and computation close to the data source. Nevertheless, this raises other security challenges against malicious, a.k.a, Byzantine, attacks that can exploit the isolation of nodes, or when access to distributed data is required in untrusted environments. In this work, we study the feasibility of deploying Byzantine Agreement protocols to improve the security of fog/edge systems in untrusted environments. In particular, we explore existing Byzantine Agreement protocols, heavily developed in the Blockchain area, emphasizing the Consistency, Availability, and Partition-Tolerance tradeoffs in a geo-replicated system. Our work identifies and discusses three different approaches that follow the Strong Consistency, Eventual Consistency, and Strong Eventual Consistency models. Our conclusions show that Byzantine Agreement protocols are still immature to be used by fog/edge computing in untrusted environment due to their high finality latency; however, they are promising candidates that encourage further research in this direction. © 2021, Springer Nature Switzerland AG.


Semantic Wikis Distributed on Structured Peer-to-Peer Networks

Rahhal, C;

The International Journal of E-Learning and Educational Technologies in the Digital Media



As Secure as Possible Eventual Consistency: Work in Progress

Shoker, A; Yactine, H; Baquero, C;

Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC@EuroSys 2017, Belgrade, Serbia, April 23 - 26, 2017

Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, trades prompt consistency for high availability. Although, this model has shown to be promising and greatly adopted by industry, the state of the art only assumes that replicas can crash and recover. However, a Byzantine replica (i.e., arbitrary or malicious) can hamper the eventual convergence of replicas to a global consistent state, thus compromising the entire service. Classical BFT state machine replication protocols cannot solve this problem due to the blocking nature of consensus, something at odd with the availability via replica divergence in the EC model. In this work in progress paper, we introduce a new secure highly available protocol for the EC model that assumes a fraction of replicas and any client can be Byzantine. To respect the essence of EC, the protocol gives priority to high availability, and thus Byzantine detection is performed off the critical path on a consistent data offset. The paper concisely explains the protocol and discusses its feasibility. We aim at presenting a more comprehensive and empirical study in the future. © 2017 ACM.