PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 2, 2026The Computer Journal0 citations

Authentication safety: safe on-demand concurrent authentication under transient faults and arbitrary initialization

View Full Paper
MKMehmet Hakan KaraataKuwait UniversityADAisha DabeesKuwait University

Key Points

  • To develop a fault-tolerant algorithm for concurrent authentication that ensures safety amidst transient faults.
  • Proposed an on-demand authentication algorithm for multiple processes.
  • Verified legitimacy of server and communication path processes.
  • Established propagation safety through interactions between processes.
  • Demonstrated scalability by allowing arbitrary system configurations.
  • Ensured that authentication occurs only if all involved processes are safe.
  • Achieved authentication activation only upon requests, enhancing efficiency.
  • Limited authentication rounds to O(n), based on the broadcast tree height.

Abstract

Abstract In this paper, we propose a novel, safe, and fault-tolerant on-demand concurrent authentication algorithm that concurrently verifies authentication requests of multiple processes by checking the legitimacy (or safety) of the server processes and those in the communication path between the requesters and their servers to implement propagation safety in the presence of transient faults and upon starting in an arbitrary system configuration. A server is the central trusted computing entity providing some services to the other processes in a communication network. A transient fault refers to a fault that perturbs the state of system processes but not their programs. Since the algorithm is safe, it ensures that authentication for a process is always achieved iff all the processes between the process and its corresponding server process are safe. Due to being able to start in an arbitrary system configuration, the proposed algorithm is scalable and does not require a reset or an initial setup. The on-demand property of the algorithm ensures that the authentication is activated only if some authentication requests are present. The authentication starts upon a request without a delay and takes O (n) rounds, where n is the height of the broadcast tree.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Karaata et al. (2025) studied this question.

synapsesocial.com/papers/6980ff49c1c9540dea81234ehttps://doi.org/10.1093/comjnl/bxaf150
Ask AI
Helpful
Bookmark
Share
View Full Paper