Non-blocking Atomic Commitment with Byzantine Faults

Author(s):  
Aldelir Fernando Luiz ◽  
Lau Cheuk Lung ◽  
Miguel Correia ◽  
Valdir Stumm Junior
2021 ◽  
Vol 14 (7) ◽  
pp. 1166-1166
Author(s):  
Sujaya Maiyya ◽  
Faisal Nawab ◽  
Divyakant Agrawal ◽  
Amr El Abbadi

This errata article discusses and corrects a minor error in our work published in VLDB 2019. The discrepancy specifically pertains to Algorithms 3 and 4. The algorithms presented in the paper are biased towards a commit decision in a specific failure scenario. We explain the error using an example before correcting the algorithm.


2019 ◽  
pp. 889-902
Author(s):  
Mohammed A. AlZain ◽  
Alice S. Li ◽  
Ben Soh ◽  
Mehedi Masud

One of the main challenges in cloud computing is to build a healthy and efficient storage for securely managing and preserving data. This means a cloud service provider needs to make sure that its clients' outsourced data are stored securely and, data queries and retrievals are executed correctly and privately. On the other hand, it may also mean businesses are willing to outsource their data to a third party only if they trust their data are not accessible and visible to the service provider and other non-authorized parties. However, one of the major obstacles faced here for ensuring data reliability and security is Byzantine faults. While Byzantine fault tolerance (BFT) has received growing attention from the academic research community, the research done is generally from the distributed computing point of view, and hence finds little practical use in cloud computing. To that end, the focus of this paper is to discuss how these faults can be tolerated with the authors' proposed conceptualization of Byzantine data faults and fault-tolerant architecture in cloud data management.


Author(s):  
Wenbing Zhao

In this article, we point out the threats to online gaming applications and present two strategies that can be used to build secure and dependable online gaming applications. These strategies not only seek the solution for gathering entropy to seed the PRNG used in such applications, but also intend to eliminate malicious intrusions to protect the seed and to maintain replica consistency. By applying these techniques, the online gaming applications can ensure its service integrity (both the service providers and the innocent players are protected) and guarantee high availability despite the presence of Byzantine faults. Finally, we outline some open research issues in this field.


2016 ◽  
Vol 7 (3) ◽  
pp. 86-98 ◽  
Author(s):  
Mohammed A. AlZain ◽  
Alice S. Li ◽  
Ben Soh ◽  
Mehedi Masud

One of the main challenges in cloud computing is to build a healthy and efficient storage for securely managing and preserving data. This means a cloud service provider needs to make sure that its clients' outsourced data are stored securely and, data queries and retrievals are executed correctly and privately. On the other hand, it may also mean businesses are willing to outsource their data to a third party only if they trust their data are not accessible and visible to the service provider and other non-authorized parties. However, one of the major obstacles faced here for ensuring data reliability and security is Byzantine faults. While Byzantine fault tolerance (BFT) has received growing attention from the academic research community, the research done is generally from the distributed computing point of view, and hence finds little practical use in cloud computing. To that end, the focus of this paper is to discuss how these faults can be tolerated with the authors' proposed conceptualization of Byzantine data faults and fault-tolerant architecture in cloud data management.


Sign in / Sign up

Export Citation Format

Share Document