A Compact and Secure Access Control Solution Based on a Deterministic Finite Automaton

2023

Closed access Metadata (CSL-JSON)
DOI 10.1109/icai58806.2023.10339058
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Access control systems are critical in ensuring the security of various facilities, ranging from residential buildings to corporate offices and government institutions. Traditional access control mechanisms usually use a hash function to generate specific signatures. However, these signatures are unable to meet the security requirements of high-security environments. In this paper, we introduce a new secure access control solution based on a deterministic finite automaton (DFA). We also provide a simulation of the solution to demonstrate its potential for use in access control systems. The automaton's adaptability and customizability allow it to cater to a wide range of security requirements. The automation's unique hash value generation mechanism enhances its preimage resist, second preimage resistance, and collision resistance properties, further contributing to its security. The paper presents these results to demonstrate that the proposed approach significantly outperforms traditional filter schemas, opening up new possibilities for secure and reliable access control in the future.