Paper Accepted ‘Evaluation of Encrypted Matching Criteria using Homomorphic Encryption Based FSM’
After further research and development in the direction of encrypted privacy-preserving matching, our paper, Mahmoud A. Sayed and Mostafa Taha ‘Evaluation of Encrypted Matching Criteria using Homomorphic Encryption Based FSM‘ is accepted for publication in the Journal of Cryptographic Engineering – Springer Nature
The paper carries the model of Oblivious Network Intrusion Detection System (O-NIDS) of our previous work to a new level, where it extends its capabilities to include matching against complex encrypted rules in the form of regular expressions. These regular expressions are implemented using encrypted finite state machines which, in turn, are built using the hybrid and fully homomorphic encryption gates.
Similar to our previous work, this paper also introduces different models and implementations which adapts and fine tunes the performance and security levels to the requirements of the application. The paper shows different experiments and benchmarks that highlight the actual performance and the effect of model choice and parameters tuning on the performance.