Layth Sliman

A Critical Comparison of Fingerprint Fuzzy Vault Techniques

Fuzzy Vault is an interesting error tolerant method to encrypt data. This method has been widely used in the field of biometrics because of the unstable nature of captured biometric modalities. In this paper, we present main works on Fuzzy Vault when used to secure fingerprint templates. We describe the contributions proposed in different stages of the two Fuzzy Vault phases. The purpose of this work is to show the implementation to be chosen at each stage of a specific Fuzzy Vault application. To this end, in this paper, we conduct a comparative study of these works from a theoretical point of view, and according to some practical criteria.

A Novel Security Architecture Based on Multi-level Rule Expression Language

This paper introduces an attack detection and response system based on multi-level rule expression language. It provides a framework to evaluate, identify, classify and defend against sophisticated attacks. Our approach helps simplifying complex rules’ expression and alert handling, thanks to a modular architecture and an intuitive rules along with a powerful expression language. The proposed system is flexible and takes into account several attack properties in order to simplify attack handling and aggregate defense mechanisms.

Score Level Fusion Scheme in Hybrid Multibiometric System

Multibiometric systems are a promising area that addresses a number of unimodal biometric systems drawbacks. The main limit of these systems is the lack of information in terms of quantity (number of discriminant features) and quality (diversity of information, correlation…). Using multiple sources of information and/or treatment is a solution to overcome these problems and enhance system performances. Performance requirements of current systems related to context use involve designed solutions that optimally satisfy security requirements. This can represent an optimization problem that aims at searching the optimal solution matching security needs. In our study, we are interested in combining different score level rules using an evolutionary algorithm. We use Genetic Algorithm to derive a score fusion function based on primitive operations. The process uses an optimized tree to determine function structure. We perform experiments on the XM2VTS score database based on a well-founded protocol for reliable results. The obtained results are promising and outperforms other fusion rules.

Compose: A Domain Specific Language for scientific code computation

In this paper we introduce a Domaine Specific Language called Compose. This language allows composing heterogeneous remote services. The domain of this language is Scientific Research Reproducibility. The main advantage of this language is its simplicity. In fact, this language is designed to be used by Business Domain Experts, in opposite to other business process composition languages, which are designed to be used by software experts. Furthermore, the design of this language covers the whole software application lifecycle. This includes specification phase, development phase and deployment phase, while transparently integrating the fault tolerance mechanisms necessary for each phase. It can also be used in association with other programming languages.

Towards an effective e-government framework: Tasks and instruments for design and evaluation of public sector websites

E-government initiatives utilizes Information and Communication Technology to improve public services and information access to citizens and users. This paper presents a description for the role of web sites in the context of the e-government perspective. Within this context, the core tasks of a web site of a public entity are proposed along with guidelines for implementation. Based on the core tasks proposed in this research, guidelines and tools are described to guide assessing public sector websites. Five websites are evaluated according to this paper proposal and comparison results are presented.

Lightweight Cryptography for Resource-Constrained Devices: A Comparative Study and Rectangle Cryptanalysis.

Several Lightweight cryptosystems were specially designed for constrained-devices. For this reason many papers have been comparing and assessing existing Lightweight cryptosystems. Our contribution; compared to those papers; is to analyse the recently and popular Lightweight cryptosystems using actual devices used in IoT context namely the Raspberry Pi 2 B and Arduino UNO. The evaluation is based on RAM and ROM consumption, speed performance by evaluating Encryption/Decryption time speed and clock cycle and security level. The results of this evaluation indicates the superiority of Speck in term of memory consumption, Rectangle in term of speed performance and Present in term of security level.

Behavioral Verification of Service Component Architecture

Currently,much research looks at treating the behavior properties beginning with the architectural design phase in SCA (Software Component Architectures) based applications. In this paper,we propose to map SCA onto the Wright ADL in order to verifythe behavioral consistency of SCA software architectures. To achieve this goal, we suggesttranslating this source software architecture into a Wright configuration. Using Wr2fdrtool, this Wright configuration can be automatically translated to a CSP specificationacceptable by the FDR2 model-checker.

UML2ADA for Early Verification of Concurrency Inside the UML2.0 Atomic Components

In recent years, the Unified Modeling Language (UML) has emerged as a de facto industrial standard for modeling Component-Based Software (CBS). However, in order to ensure the safety and vivacity of UML CBS, many approaches have been proposed to verify the concurrency between interconnected components. But, rare are the works that tackle concurrency verification inside atomic components. In this paper, our purpose was the verification of the concurrency inside UML2.0 atomic components endowed with behavioral specifications described by protocol state machines (PSM). To achieve this, we propose to translate the UML2.0/PSM source component to an Ada concurrent program. Using an Ada formal analysis tool such as FLAVERS or INCA tools, we could detect the potential behavioral concurrency properties such as the deadlock of an Ada concurrent program.

Towards an Ultra-lightweight Cryptosystem for IoT

With the spread of Internet of Things (IoT), ensuring security and privacy proves essential. However, given the limited computation resources of IoT objects, the mechanisms and techniques used to secure data exchange in these environments should consider many constraints such as power consumption, size, execution time … etc. To cope with these constraints, new lightweight encryption systems have been proposed. This work is intended to compare some recently proposed lightweight cryptosystem in order to identify and suggest the necessary recommendations to achieve an ultra-lightweight cryptosystem adapted to IoT environment.

Chaff-Points Generation Using Knapsack Problem Resolution in Fingerprint Fuzzy Vault

In this paper, we introduce a new chaff-points generation method in fuzzy vault fingerprint. Our method is based on squares boundaries and Knapsack problem. Chaff-points generation process consists of creating a set of chaff points similar to authentic minutiae feature representation. Squares based chaff-points generation consist of delimiting a square boundary around each chaff-point in such a way that a square must never overlap with other squares. Unlike the typical squares method where chaff-points and their boundaries are generated sequentially, in our proposal, the referred chaff-points are generated all together then the knapsack problem formulation is used along with 0/1 dynamic programing resolution to determine if each chaff-point respects the constraints. The experiments results show that the chaff-points generation based on Knapsack method generates the referred number of chaff-points with reduced computing time, and especially, a smaller standard deviation in comparison to the sequential squares chaff-points generation.