Journal article - peer reviewed (12)
BELGUITH Sana, KAANICHE Nesrine, LAURENT Maryline, JEMAI Abderrazak , ATTIA Rabah
PHOABE: securely outsourcing multi-authority attribute based encryption with policy hidden for cloud assisted IoT. Computer networks - The international journal of computer and telecommunications networking, march 2018, vol. 133, pp. 141-156
[PDF]
abstract
Attribute based encryption (ABE) is an encrypted access control mechanism that ensures efficient data sharing among dynamic group of users. Nevertheless, this encryption technique presents two main drawbacks, namely high decryption cost and publicly shared access policies, thus leading to possible users' privacy leakage. In this paper, we introduce PHOABE, a Policy-Hidden Outsourced ABE scheme. Our construction presents several advantages. First, it is a multi-attribute authority ABE scheme. Second, the expensive computations for the ABE decryption process is partially delegated to a Semi Trusted Cloud Server. Third, users' privacy is protected thanks to a hidden access policy. Fourth, PHOABE is proven to be selectively secure, verifiable and policy privacy preserving under the random oracle model. Five, estimation of the processing overhead proves its feasibility in IoT constrained environments
BRANDWAJN Alexandre, BEGIN Thomas, CASTEL-TALEB Hind, ATMACA Tülin
A study of systems with multiple operating levels, probabilistic thresholds and hysteresis. IEEE transactions on parallel and distributed systems, april 2018, vol. 29, n° 4, pp. 748-757
URL: https://hal.archives-ouvertes.fr/hal-01670974/document
abstract
Current architecture of many computer systems relies on dynamic allocation of a pool of resources according to workload 5 conditions to meet specific performance objectives while minimizing cost (e.g., energy or billing). In such systems, different levels of 6 operation may be defined, and switching between operating levels occurs at certain thresholds of system congestion. To avoid rapid 7 oscillations between levels of service, "hysteresis" is introduced by using different thresholds for increasing and decreasing workload 8 levels, respectively. We propose a model of such systems with general arrivals, arbitrary number of servers and operating levels where 9 each higher operating level may correspond to an arbitrary number of additional servers and soft (i.e., non-deterministic) thresholds to 10 account for "inertia" in switching between operating levels. In our model, request service times are assumed to be memoryless and 11 server processing rates may be a function of the current operating level and of the number of requests (users) in the system. 12 Additionally, we allow for delays in the activation of additional operating levels. We use simple mathematics to obtain a semi-numerical 13 solution of our model. We illustrate the versatility of our model using several case study examples inspired by features of real systems. 14 In particular, we explore optimal thresholds as a tradeoff between performance and energy consumption.
DIEYE Mouhamad, AHVAR Shohreh, SAHOO Jagruti, AHVAR Ehsan, GLITHO Roch, ELBIAZE Halima, CRESPI Noel
CPVNF: Cost-efficient Proactive VNF placement and chaining for value-added services in content delivery networks. IEEE transactions on network and service management, june 2018, vol. 15, n° 2, pp. 774-786
abstract
Value-added services (e.g., overlaid video advertisements) have become an integral part of today's Content Delivery Networks (CDNs). To offer cost-efficient, scalable and more agile provisioning of new value-added services in CDNs, Network Functions Virtualization (NFV) paradigm may be leveraged to allow implementation of fine-grained services as a chain of Virtual Network Functions (VNFs) to be placed in CDN. The manner in which these chains are placed is critical as it both affects the quality of service (QoS) and provider cost. The problem is however, very challenging due to the specifics of the chains (e.g.,one of their end-points is not known prior to the placement). We formulate it as an Integer Linear Program (ILP) and propose a cost efficient Proactive VNF placement and chaining (CPVNF)algorithm. The objective is to find the optimal number of VNFs along with their locations in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of servers and end-users is an important feature of the proposed algorithm. Through simulations, the algorithm's behaviour for small-scale to large-scale CDN networks is analyzed
GENSOLLEN Nicolas, GAUTHIER Vincent, BECKER Monique, MAROT Michel
Stability and performance of coalitions of prosumers through diversification in the smart grid. IEEE transactions on smart grid, march 2018, vol. 9, n° 2, pp. 963-970
[PDF]
abstract
In the context of the smart grid, we propose in this paper an algorithm that forms coalitions of agents, called prosumers, that both produce and consume. It is designed to be used by aggregators that aim at selling aggregated surplus of production of the prosumers they control. We rely on real weather data sampled across stations of a given territory in order to simulate realistic production and consumption patterns for each prosumer. This enables us to capture geographical correlations among the agents while preserving the diversity due to different behaviors. As aggregators are bound to the market operator by a contract, they seek to maximize their offer while minimizing their risk. The proposed graph based algorithm takes the underlying correlation structure of the agents into account and outputs coalitions with both high productivity and low variability. We show that the resulting diversified coalitions are able to generate higher benefits on a constrained energy market, and are more resilient to random failures of the agents
GONZALEZ GRANADILLO Gustavo Daniel, DUBUS Samuel, MOTZEK Alexander, GARCIA-ALFARO Joaquin, ALVAREZ LOPEZ Ender Yesid, MERIALDO Matteo , PAPILLON Serge, DEBAR Hervé
Dynamic risk management response system to handle cyber threats. Future generation computer systems (FGCS), june 2018, vol. 83, pp. 535-552
abstract
Appropriate response strategies against new and ongoing cyber attacks must be able to reduce risks down to acceptable levels, without sacrificing a mission for security. Existing approaches either evaluate impacts without considering missions' negative-side effects, or are manually based on traditional risk assessments, leaving aside technical difficulties. In this paper we propose a dynamic risk management response system (DRMRS) consisting of a proactive and reactive management software aiming at evaluating threat scenarios in an automated manner, as well as anticipating the occurrence of potential attacks. We adopt a quantitative risk-aware approach that provides a comprehensive view of the threats, by considering their likelihood of success, the induced impact, the cost of the possible responses, and the negative side-effects of a response. Responses are selected and proposed to operators based on financial, operational and threat assessments. The DRMRS is applied to a real case study of a critical infrastructure with multiple threat scenarios
GONZALEZ GRANADILLO Gustavo Daniel, RUBIO-HERNAN Jose, GARCIA-ALFARO Joaquin
Using an event data taxonomy to represent the impact of cyber events as geometrical instances. IEEE access, 2018, vol. 6, pp. 8810-8828
[PDF]
abstract
Visualization and simulation models used for the evaluation and selection of security countermeasures need accurate data to compute the impact of cyber events (e.g., malicious and benign actions). The information required to build appropriate impact models depends directly on the nature of the system. The information dealt by water supply systems, for instance, is particularly different from the information obtained by energy, telecommunication, transportation, or finance systems. It is therefore important to properly classify the data of security events according to the nature of the system. This paper proposes an event data taxonomy based on the system's criticality, the geographical location of the target, the time at which the information is obtained by the attacker, and the nature of the data. A use case on the impact assessment of events originated in a critical infrastructure is presented to show the applicability of the proposed taxonomy
HASSINE Kawther, FRIKHA Mounir, CHAHED Tijani
Access point backhaul capacity aggregation as a matching game in the context of wireless local area networks. Computer networks - The international journal of computer and telecommunications networking, july 2018, vol. 139, pp. 92-108
abstract
We propose, in this paper, a novel approach of Access Point (AP) backhaul capacity aggregation in the context of Wireless Local Area Networks (WLAN). Our purpose is to optimize the Available Backhaul Resource (ABR) allocation between APs belonging to different Basic Service Sets (BSSs), so as to relieve pressure of traffic offloaded from non-WiFi networks. In this context, we define two different sets of APs within the same WLAN: the ones with spare backhaul resources (Providers) and those in lack of it (Beneficiaries). Considering the two sided nature of this system, we model our assignment problem using matching games: one-to-one, many-to-one and many-to-many, and solve it using the so-called Deferred Acceptance (DA) algorithm leading to an optimal pairwise stable matching. Our results show that, compared to a legacy WLAN, the overall performance is substantially improved in terms of AP throughput gain, AP satisfaction percentage and load balancing between different APs
LABIDI Wael, CHAHED Tijani, ELAYOUBI Salah-Eddine
Optimal battery management strategies in mobile networks powered by a smart grid. IEEE transactions on green communications and networking, september 2018, vol. 2, n° 3, pp. 859-867
abstract
We focus in this paper on energy management strategies for a mobile network equipped with battery storage capacity as well as local energy production capability, and powered by a smart grid. At each time instant, the mobile network operator has to decide whether to operate its network based on its own energy resources or the smart grid ones, with a possibility to sell energy to the smart grid as well. We formulate our problem using Markov Decision Process (MDP) and derive an optimal, offline policy which minimizes the operator energy bill, using dynamic programming algorithm. We show the optimality of our solution by numerical comparison with the solution obtained through linear programming. Our numerical applications allow to further understand when the operator has an incentive to buy energy, whether it is beneficial for it to act as an energy seller, the size of the battery to deploy, as well as the robustness of our offline deterministic policy to estimation errors
MORCOS Mira, CHAHED Tijani, CHEN Lin, ELIAS Jocelyne, MARTIGNON Fabio
A two-level auction for resource allocation in multi-tenant C-RAN. Computer networks - The international journal of computer and telecommunications networking, april 2018, vol. 135, pp. 240-252
abstract
We consider in this paper a dynamic resource allocation scheme between several Mobile Virtual Network Operators (MVNOs), sharing common radio resources at a Cloud-based Radio Access Network (C-RAN) run by a central operator. We specifically propose a two-level coupled auction so as to enhance resource utilization and maximize the revenues both for the central operator and the MVNOs: at the lower level, end users belonging to a given MVNO bid for resources and, at the higher-level, MVNOs compete for resources at the central operator based on the output of the lower-level auction. We show fundamental economic properties of our proposal: truthfulness and individual rationality, and propose a greedy algorithm to enhance its computational efficiency. We prove the existence of Nash equilibrium for the global auction and its uniqueness in a typical duopoly scenario. Further numerical results illustrate the performance of our proposal in various network settings
NGUYEN Kim Thuat, OUAHLA Nouha, LAURENT Maryline
Securely outsourcing the ciphertext-policy attribute-based encryption. World wide web, january 2018, vol. 21, n° 1, pp. 169-183
abstract
Attribute-based Encryption (ABE) is a new and promising public key encryption that allows fine-grained authorization on data based on user attributes. Such property is favorable for multiple applications that require encrypted storage or access control on data, in particular: eHealth applications. However, ABE schemes are known not to be efficient in the encryption phase because ciphertext size and the time required to encrypt grow with the complexity of the access policy. Such drawback is critical in the context of pervasive computing, for instance, in the Internet of Things, where data producers are usually resource-constrained devices, e.g. smart phones or sensing platforms. In this work, we propose OEABE standing for Outsourcing mechanism for the Encryption of Ciphertext-Policy ABE (CP-ABE). We show how a user can offload expensive operations of CP-ABE encryption to a semi-trusted party in a secure manner. For illustration, we first conducted a performance estimation on an emulated Wismote sensor platform. Then, to demonstrate the performance gains of our mechanism, we implemented our proposal and did comparison to an existing implementation of CP-ABE on a laptop
RUBIO-HERNAN Jose, SAHAY Rishikesh, DE CICCO Luca, GARCIA-ALFARO Joaquin
Cyber‐physical architecture assisted by programmable networking. Internet technology letters, july 2018, vol. 1, n° 4, pp. e44-1-e44-8
URL: https://arxiv.org/pdf/1802.02360v1.pdf
abstract
Cyber‐physical technologies are prone to attacks in addition to faults and failures. The issue of protecting cyber‐physical systems should be tackled by jointly addressing security at both cyber and physical domains in order to promptly detect and mitigate cyber‐physical threats. Toward this end, this letter proposes a new architecture combining control‐theoretic solutions together with programmable networking techniques to jointly handle crucial threats to cyber‐physical systems. The architecture paves the way for new interesting techniques research directions and challenges which we discuss in our work
RUBIO-HERNAN Jose, DE CICCO Luca, GARCIA-ALFARO Joaquin
Adaptive control-theoretic detection of integrity attacks against cyber-physical industrial systems. Transactions on emerging telecommunications technologies, july 2018, vol. 29, n° 7, pp. e3209-1-e3209-17
[PDF]
abstract
The use of control-theoretic solutions to detect attacks against cyber-physical industrial systems is a growing area of research. Traditional literature proposes the use of control strategies to retain, eg, satisfactory close-loop performance, as well as safety properties, when a communication network connects the distributed components of a physical system (eg, sensors, actuators, and controllers). However, the adaptation of these strategies to handle security incidents is an ongoing challenge. In this paper, we survey the advantages of a watermark-based detector against some integrity attacks as well as the weaknesses against other attacks. To cover these weaknesses, we propose a new control and security strategy that complements the watermark-based detector. We validate the detection efficiency of the new strategy via numeric simulation. Experimental results are also presented by using a laboratory testbed based on supervisory control and data acquisition industrial protocols
Communication in a conference - peer reviewed (18)
AKSU Dogukan, USTEBAY Serpil, AYDIN Muhammed Ali, ATMACA Tülin
Intrusion detection with comparative analysis of supervised learning techniques and Fisher Score feature selection algorithm. ISCIS 2018 : 32nd International Symposium on Computer and Information Sciences, Cham : Springer, 20-21 september 2018, Poznan, Poland, 2018, pp. 141-149, ISBN 978-3-030-00839-0
abstract
Rapid development of technologies not only makes life easier, but also reveals a lot of security problems. Developing and changing of attack types affect many people, organizations, companies etc. Therefore, intrusion detection systems have been developed to avoid financial and emotional loses. In this paper, we used CICIDS2017 dataset which consist of benign and the most cutting-edge common attacks. Best features are selected by using Fisher Score algorithm. Real world data extracted from the dataset are classified as DDoS or benign with using Support Vector Machine (SVM), K Nearest Neighbour (KNN) and Decision Tree (DT) algorithms. As a result of the study, 0,9997%, 0,5776%, 0,99% success rates were achieved respectively
ATMACA Tülin, KAMLI Amira, RATAJ Artur
Adaptation of N-GREEN architecture for a bursty traffic. CN 2018: 25th International Conference on Computer Networks , Cham : Springer, 19-22 june 2018, Gliwice, Poland, 2018, pp. 232-244, ISBN 978-3-319-92458-8
abstract
N-GREEN is a cost attractive optical ring network which uses coloured packets. It is normally fit to a predictable traffic with a low burst rate, found e.g. in the metro aggregation. Here we try to adapt the network to other, potentially interesting applications where the traffic is more bursty, by proposing a packet management scheme with adaptive expiration times, determined in response to local and/or global queue sizes. The exact relation is found using a direct optimisation method which uses a simulation. We show that thanks to the regulation of the expiration time, an N-GREEN ring may continuously adapt to a bursty/unpredictable traffic of a varying average load, provided the nodes inform one another about the momentary size of data in their input buffers. The adaptation may considerably decrease the latency of the network
BOUTIGNY François, BETGE-BREZETZ Stephane, DEBAR Hervé, BLANC Gregory, LAVIGNOTTE Antoine, POPESCU Ion
Multi-provider secure virtual network embedding. NTMS 2018 : 9th IFIP International Conference on New Technologies, Mobility and Security, Los Alamitos : IEEE Computer Society, 26-28 february 2018, Paris, France, 2018, pp. 1-5, ISBN 978-1-5386-3662-6
abstract
Network virtualization enables tenants to lease computing and networking resources from one or more infrastructure provider (InP), like in Infrastructure as a Service (IaaS). As such, tenants outsource their networks, fully or partially, to reduce their capital expenditure, while expecting to still provide the same quality of service to their customers. Yet, such services may rely on data considered as sensitive by tenants, tenants' customers or the law, which should be protected appropriately. Besides, personal data protection laws paired with the objective to offer an optimal customer experience may lead tenants to distribute their virtual networks over multiple InPs. Yet, the interconnection between different InPs should respect their security policies. In this paper, we aim to ease the adoption of network virtualization by guaranteeing both tenants and InPs that their security policies are all enforced when creating a virtual network. To this end, we present a Virtual Network Embedding solution in a multi-provider context, and how we leverage it in a use case
CHOUMAN Hussein, LOURDIANE Mounia, TREMBLAY Christine, ADHIKARI Bibechana, WARE Cédric, LEPERS Catherine
10-100 Gbit/s mixed-line-rate experimental demonstration. PN 2018: 20th Phontonics North conference, IEEE Computer Society, 05-07 june 2018, Montreal, Canada, 2018
abstract
In this paper we analyze the feasibility of mixed-line rate transmission of 10 and 100 Gbit/s links for metro and long haul optical network. We compare theoretical models, simulation and experimental results for different transmission scenarios
DHAMAL Swapnil Vilas, BEN-AMEUR Walid, CHAHED Tijani, ALTMAN Eitan
Resource allocation polytope games: uniqueness of equilibrium, price of stability, and price of anarchy. AAAI 2018 : 32nd AAAI conference on Artificial Intelligence, Palo Alto : Association for the Advancement of Artificial Intelligence, 02-07 february 2018, New Orleans, United States, 2018, pp. 997-1006
abstract
We consider a two-player resource allocation polytope game, in which the strategy of a player is restricted by the strategy of the other player, with common coupled constraints. With respect to such a game, we formally introduce the notions of independent optimal strategy profile, which is the profile when players play optimally in the absence of the other player; and common contiguous set, which is the set of top nodes in the preference orderings of both the players that are exhaustively invested on in the independent optimal strategy profile. We show that for the game to have a unique PSNE, it is a necessary and sufficient condition that the independent optimal strategies of the players do not conflict, and either the common contiguous set consists of at most one node or all the nodes in the common contiguous set are invested on by only one player in the independent optimal strategy profile. We further derive a socially optimal strategy profile, and show that the price of anarchy cannot be bound by a common universal constant. We hence present an efficient algorithm to compute the price of anarchy and the price of stability, given an instance of the game. Under reasonable conditions, we show that the price of stability is 1. We encounter a paradox in this game that higher budgets may lead to worse outcomes
DIOP Aida, GHAROUT Said, LAURENT Maryline, LENEUTRE Jean, TRAORÉ Jacques
Questioning the security and efficiency of the ESIoT approach. WISEC 2018: 11th ACM Conference on Security and Privacy in Wireless and Mobile Networks, New York : ACM, 18-20 june 2018, Stockholm, Sweden, 2018, pp. 202-207, ISBN 978-1-4503-5731-9
[PDF]
abstract
ESIoT was introduced at WiSec 2017 as a protocol for providing secure access control and authentication in Internet of Things (IoT) applications. The core primitive of ESIoT is an identity-based broadcast encryption scheme called Secure Identity-Based Broadcast Encryption (SIBBE). SIBBE is designed to provide secure key distribution among a group of devices in IoT networks, and enable devices in each group to perform mutual authentication. The scheme is also designed to hide the structure of the group from nodes outside of the group. We identify multiple efficiency and security issues in the primitive that prove SIBBE unsuitable for IoT applications. First, we show that the size of the ciphertexts generated by the encryption function is linear in the number of devices in the group as opposed to constant as claimed in the description of the scheme. Additionally, we demonstrate how constrained nodes in the network perform a number of decryptions also linear in the set of devices, implying scalability issues and thus inefficiency for IoT applications. In terms of security, we prove that SIBBE does not achieve the desired property of anonymity and allows an attacker to gain information on the structure of any given group. Finally, we demonstrate how SIBBE does not achieve chosen-ciphertext security as claimed. We however prove its security for a weaker security notion (namely selective-ID indistinguishability against chosen-plaintext attacks) under a strong cryptographic assumption
DRAMÉ-MAIGNÉ Sophie, LAURENT Maryline, CASTILLO Laurent, GANEM Hervé
Augmented chain of ownership : configuring IoT devices with the help of the blockchain. SECURECOMM 2018: 14th EAI International Conference on Security and Privacy in Communication Networks, Cham : Springer, 08 september - 10 august 2018, Singapour, Singapore, 2018, pp. 1-16 (document in press)
[PDF]
abstract
The blockchain, distributed and unalterable ledger, has lowered the cost of ownership records. This mechanism that required the involvement of notaries and was once reserved for expensive items can now be used for every type of assets. We propose to use it to keep track of the ownership of IoT devices. By registering devices and their transfer into the blockchain, we build a chain of ownership that can be used to prove ownership before a sale and transfer ownership after purchase, or to track and warn owners of security threats faced by their devices. Two extensions are proposed. The first one facilitates remote configuration and key management when a single owner must configure a great number of devices. The second one offers users information about an IoT device. That information can be used to create a discovery service, inform access decisions or keep track of a device's state
GONZALEZ GRANADILLO Gustavo Daniel, DOYNIKOVA Elena, KOTENKO Igor, GARCIA-ALFARO Joaquin
Attack graph-based countermeasure selection using a stateful return on investment metric. FPS 2017: 10th International Symposium on Foundations and Practice of Security, Cham : Springer, 23-25 october 2017, Nancy, France, 2018, pp. 293-302, ISBN 978-3-319-75649-3
abstract
We propose a mitigation model that evaluates individual and combined countermeasures against multi-step cyber-attack scenarios. The goal is to anticipate the actions of an attacker that wants to disrupt a given system (e.g., an information system). The process is driven by an attack graph formalism, enforced with a stateful return on response investment metric that optimally evaluates, ranks and selects appropriate countermeasures to handle ongoing and potential attacks
GONZALEZ GRANADILLO Gustavo Daniel, RUBIO-HERNAN Jose, GARCIA-ALFARO Joaquin
A pyramidal-based model to compute the impact of cyber security events. ARES 2018 : 13th International Conference on Availability, Reliability and Security, New York : ACM, 27-30 august 2018, Hamburg, Germany, 2018, pp. Article n° 19, ISBN 978-1-4503-6448-5
abstract
This paper presents a geometrical model that projects malicious and benign events (e.g.,attacks, security countermeasures) as pyramidal instances in a multidimensional coordinate system. The approach considers internal event data related to the target system (e.g.,users, physical, and logical resources, IP addresses, port numbers, etc.), and external event data related to the attacker (e.g.,knowledge, motivation, skills, etc.) that can be obtained a priori and a posteriori. Internal data is used to model the base of the pyramid, whereas external data is used to model its heigh. In addition, the approach considers state transitions taken by the attacker to model the steps of a multi-stage attack to reach to its final goal. A a result, for each modeled state, new countermeasures are evaluated and the attacker's knowledge a posteriori changes accordingly, making it possible to evaluate the impact of the attack at time Ti, where i denotes the stage at which the attack is executed. A graphical representation of the impact of each evaluated even is depicted for visualization purposes. A use case of a cyber-physical system is proposed at the end of the paper to illustrate the applicability of the proposed geometrical model
HAMMAMI Seif Eddine, MOUNGLA Hassine, AFIFI Hossam
Proactive anomaly detection model for eHealth-enabled data in next generation cellular networks. ICC 2018 : IEEE International Conference on Communications , Los Alamitos : IEEE Computer Society, 20-24 may 2018, Kansas City, United States, 2018, pp. 1-6, ISBN 978-1-5386-3180-5
abstract
Internet of things (IoT) is an ever-growing technological paradigm that is expected to boost the development of a plethora of services and applications like eHealth services. The massive amount of data generated by eHealth applications will be handled by the cellular architecture. Due to the additional eHealth data, cellular networks may suffer from some anomalies which need intelligent and autonomic mechanisms to be avoided. Network operators must integrate to their architecture pro-active tools able to detect and signal these anomalous patterns and then mitigate the issue of overloaded base-stations. We address in this paper the issue of eHealth services by analyzing at first their impact on cellular networks. We propose also an on-line and efficient anomaly detection technique for eHealth data based on support vector regression (SVR). Moreover, we validate our model with a real dataset of cellular call detail records (CDR) combined with semi-synthetic eHealth dataset. A realistic testbed is provided on the context of a Marathon event where mobile users are running eHealth applications
IBN KHEDHER Mohamed, JMILA Houda, EL YACOUBI Mounim
Fusion of interest point/image based descriptors for efficient person re-identification. IJCNN 2018 : International Joint Conference on Neural Networks, Los Alamitos : IEEE Computer Society, 08-13 july 2018, Rio De Janeiro, Brazil, 2018, pp. 1-7, ISBN 978-1-5090-6014-6
abstract
The paper proposes a novel video-based person re-identification system that consists of describing a person using both Interest Points (IP) and Image-based features. The Image-based descriptor extracts global image representation that includes the silhouette but also possibly extra objects (i.e animal, stroller, etc) while the IP-based descriptor extracts salient points associated each with a local region of one of the objects. Two re-identification systems are proposed: an IP-based system using SURF interest points matched via sparse representation, and Image-based system using a Convolutional Neural Network. To harness both representations, we propose a fusing strategy based on the scores product rule, the scores being vote vectors associated with each descriptor for each person. Our proposal is evaluated on the large public dataset PRID-2011 and the results show its effectiveness compared to the state of the art
KAANICHE Nesrine, LAURENT Maryline
SABE : a Selective Attribute-Based Encryption for an efficient threshold multi-level access control. SECRYPT 2018: 15th International Conference on Security and Cryptography, Setubal : Scitepress, 26-28 july 2018, Porto, Portugal, 2018, vol. 2, pp. 155-167, ISBN 978-989-758-319-3
[PDF]
abstract
With the emergence of decentralized systems and distributed infrastructures, access control to outsourced data becomes more complex, as it should be flexible and distinguishable among users with different access rights. In this paper, we present SABE, a Selective Attribute-based Encryption scheme, as a new threshold multilevel access control mechanism based on an original use of attribute based encryption schemes. Our proposal is multi-fold. First, it ensures fine-grained access control, supporting multi-security levels with respect to different granted access privileges for each outsourced data file. Second, SABE is proven secure against selective non-adaptive chosen ciphertext attacks in the generic group model. Third, our construction is proven to provide efficient processing and communication complexities, compared to most closely related schemes
KAANICHE Nesrine, LAURENT Maryline, LE Christian, VANDER PLAETSE Mathieu
A blockchain-based access control scheme. SECRYPT 2018: 15th International Conference on Security and Cryptography, Setubal : Scitepress, 26-28 july 2018, Porto, Portugal, 2018, vol. 2, pp. 168-176, ISBN 978-989-758-319-3
[PDF]
abstract
Personal data are often collected and processed in a decentralized fashion, within different contexts. For instance, with the emergence of distributed applications, several providers are used to correlate their records, to provide personalized services to their clients. As such, to protect users' privacy, different pseudonyms are generally used for different contexts. These pseudonyms have to be unlinkable to prevent identifying records to be associated to the same user. Although unlinkable, these pseudonyms have to be processed and exchanged according to their owners' consent and in a privacy-preserving fashion. In this paper, we propose BDUA, a new Blockchain-based Data Usage Auditing system, that ensures a controlled yet privacy preserving exchange of distributed data, such that a set of authorized auditing entities are able to conduct an accurate auditing relying on registered blockchains' transactions
KAMLI Amira, ATMACA Tülin, LEPERS Catherine, RATAJ Artur, AMAR Djamel
Performance improvement of colored optical packet switching thanks to time slot sharing. AICT 2018 : 14th Advanced International Conference on Telecommunications , Wilmington : IARIA, 22-26 june 2018, Barcelonna, Spain, 2018, pp. 28-31, ISBN 978-1-61208-650-7
URL: http://www.thinkmind.org/index.php?view=article&articleid=aict_2018_2_40_10051
abstract
N-GREEN is a cost attractive optical network which uses coloured optical packets. Its basic component is a ring of novel overdimensioned switch/router nodes, which promises low latency, making it interesting for applications with strict latency requirementslike5G.Nevertheless,itsuffersfromalowefficiency of resources usage, especially when it is used in the Unicast mode popular in the metro aggregation. Here, we try to ensure a better use of network resources by proposing an alternate packet management and transmission method referred to as Ssh-time which could be used in both the Unicast mode and the Broadcastand-Select (B&S) one. We show by simulation that the proposed method improves not only the resources efficiency in case of a metro-aggregation network, but also decreases the mean access delay
MARILLONNET Paul, ATES Mikaël, LAURENT Maryline
Etat de l'art des technologies de la gestion des données personnelles par l'usager . APVP 2018: Atelier sur la Protection de la Vie Privée, 03-06 juin 2018, Porquerolles, France, 2018
abstract
Plusieurs approches et solutions telles que la certification anonyme, BlindIDM UMA (User-Managed Access)... sont passées en revue et analysées de façon critique
SALEM Fatma Ezzahra, ALTMAN Zwi, GATI Azeddine, CHAHED Tijani, ALTMAN Eitan
Reinforcement learning approach for Advanced Sleep Modes management in 5G networks. VTC-FALL 2018 : 88th Vehicular Technology Conference, Los Alamitos : IEEE Computer Society, 27-30 august 2018, Chicago, United States, 2018 (document in press)
abstract
Advanced Sleep Modes (ASMs) correspond to a gradual deactivation of the Base Station (BS)'s components in order to reduce its Energy Consumption (EC). Different levels of Sleep Modes (SMs) can be considered according to the transition time (deactivation and activation durations) of each component. We propose in this paper a management solution for ASMs based on Q-learning approach. The target is to find the optimal durations for each SM level according to the requirements of the network operator in terms of EC reduction and delay constraints. The proposed solution shows that even with a high constraint on the delay, we can achieve high energy savings (almost 57% of EC reduction) without inducing any impact on the delay. When the delay constraint is relaxed, we can achieve up to almost 90% of energy savings
YORO Wilfried, EL TABACH Mamdouh, EN-NAJJARY Taoufik, GATI Azeddine, CHAHED Tijani
Energy efficiency of a network equipment per service category. ICC 2018 : IEEE International Conference on Communications, Los Alamitos : IEEE Computer Society, 20-24 may 2018, Kansas City, United States, 2018, pp. 1-6, ISBN 978-1-5386-3180-5
abstract
We investigate in this paper the assessment of the energy efficiency of the service categories provided by a network equipment. We consider five service categories, namely, Streaming, Web, Download, other data services and Voice. We consider two scenarios: a case when the network equipment has no sleep mode feature, and another one when it is put into sleep mode during idle periods. We share the responsibility of the service categories in the power consumption of the network equipment, which represents the share of the power consumption imputed to each service category, and then compute the energy efficiency as the ratio of the traffic throughput to the imputed power consumption. The power consumption of a network equipment is composed of two components: a variable component that is consumed proportionally to its load, and a fixed component consumed irrespective of the traffic. We share the former among the service categories proportionally to their traffic proportions. The latter is shared according to the scenario. In the first one, it is shared with our Shapley-based model introduced in a previous work [1]. In the second scenario, we introduce a new sharing model, also based on Shapley value, which takes into account the sleep mode feature. Our results, applied to a real dataset extracted from an operational network in Europe, show that the former sharing model is better than the sleep-mode-oriented model in terms of fairness, although it does not consider the sleep mode feature of the equipment
YORO Wilfried, EL TABACH Mamdouh, EN-NAJJARY Taoufik, GATI Azeddine, CHAHED Tijani
Sharing the network end-to-end energy consumption among service categories. VTC-Spring 2018 : 87th Vehicular Technology Conference, Los Alamitos : IEEE Computer Society, 03-06 june 2018, Porto, Portugal, 2018, pp. 1-7, ISBN 978-1-5386-6355-4
abstract
A network is a common resource typically shared by several services, and so, it is important to determine the share of each service in the total energy consumed by the network. The network energy consumption is composed of a variable component which is consumed to serve traffic, and a fixed component consumed irrespective of traffic. The share of a service in the variable energy consumption equals its traffic proportion as this energy component is load-dependent. In this paper, we focus on the fixed energy consumption and share the responsibility of the services transported by a end-to-end network in its fixed energy consumption. To do so, we use our model based on the cooperative game concept Shapley value introduced in a previous work [1] and apply it first to traffic, then to so-called useful outputs. According to ETSI, the useful output of an equipment is defined to be its maximum capacity and is expressed as the number of Erlangs, packets/s, subscribers, or simultaneously attached users. We consider seven network blocks composing the end-to-end path, namely, the radio access, the fixed access, the aggregation, the mobile core, the registers, the IP core and the service platforms. We consider five service categories: Streaming, Web, Download, other data services and Voice. We apply our model on a real data set extracted from an operational network in Europe, and analyze the end-to-end energy consumption assigned to the service categories
Book chapter (3)
KHATCHATOUROV Armen, LEVALLOIS-BARTH Claire, LAURENT Maryline, WAELBROECK Patrick
Conclusion . Signes de confiance : l’impact des labels sur la gestion des données personnelles, [Paris] : Institut Mines-Télécom, 2018, pp. 199-202, ISBN 978-2-9557308-4-3
abstract
Dans cet ouvrage, nous avons abordé les questions soulevées par un signe de confiance particulier, le label en matière des données personnelles, ainsi que certaines pistes et tendances dans le paysage en cours de construction. Si la problématique des labels n'est pas nouvelle en soi, comme en atteste leur présence dans les domaines de l'énergie ou de l'alimentation, la spécificité des biens numériques et leur essor exponentiel ne semblent pas permettre de recourir à des solutions déjà éprouvées. La circulation croissante des informations amène donc à poser sous une forme nouvelle la question des modes de gouvernance des données personnelles
LAURENT Maryline
La blockchain est-elle une technologie de confiance. Signes de confiance : l’impact des labels sur la gestion des données personnelles , [Paris] : Institut Mines-Télécom, 2018, pp. 179-198, ISBN 978-2-9557308-4-3
[PDF]
abstract
Le chapitre présente le fonctionnement et les limites du trust by design sur l'exemple de la blockchain
LAURENT Maryline, KHATCHATOUROV Armen
La confiance en informatique par la gestion du risque. Signes de confiance : l’impact des labels sur la gestion des données personnelles, [Paris] : Institut Mines-Télécom, 2018, pp. 47-62, ISBN 978-2-9557308-4-3
abstract
La confiance en informatique repose sur l'évaluation des risques engendrés par l'usage d'un outil (logiciel ou matériel)ou, plus largement, toute forme de prestation informatique (service, site web). Cette évaluation et le niveau de fiabilité associé sont d'autant plus critiques que les enjeux sont élevés. Elle prend tout son sens quand la sécurité du système d'information (SSI) d'une organisation est en jeu
Direction d'ouvrage (4)
CUPPENS-BOULAHIA Nora, CUPPENS Frédéric, LANET Jean-Louis, LEGAY Axel , GARCIA-ALFARO Joaquin
Risks and security of internet and systems : 12th international conference, CRiSIS 2017, Dinard, France, September 19-21, 2017, revised selected papers. Cham : Springer, 2018, (Lecture Notes in Computer Science (vol. 10694)), ISBN 978-3-319-76686-7
abstract
This book constitutes the revised selected papers from the 12th International Conference on Risk and Security of Internet and Systems, CRISIS 2017, held in Dinard, France, in September 2017.The 12 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 42 submissions. They cover diverse research themes, ranging from classic topics, such as vulnerability analysis and classification; apps security; access control and filtering; cloud security; cyber-insurance and cyber threat intelligence; human-centric security and trust; and risk analysis
GIUFFRIDA Cristiano, BARDIN Sébastien, BLANC Gregory
Detection of intrusions and malware, and vulnerability assessment : 5th international conference, DIMVA 2018, Saclay, France, June 28-29, 2018, proceedings. Cham : Springer, 2018, (Lecture Notes in Computer Science (vol. 10885); Security and Cryptology (vol. 10885)), ISBN 978-3-319-93410-5
abstract
This book constitutes the refereed proceedings of the 15th International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment, DIMVA 2018, held in Saclay, France, in June 2018. The 17 revised full papers and 1 short paper included in this book were carefully reviewed and selected from 59 submissions. They present topics such as malware analysis; mobile and embedded security; attacks; detection and containment; web and browser security; and reverse engineering
IMINE Abdessamad, FERNANDEZ José M., MARION Jean-Yves, LOGRIPPO Luigi, GARCIA-ALFARO Joaquin
Foundations and Practice of Security : 10th International Symposium, FPS 2017, Nancy, France, October 23-25, 2017, revised selected papers. Cham : Springer, 2018, (Lecture Notes in Computer Science book series (MNCS vol. 10723)), ISBN 978-3-319-75649-3
URL: 10.1007/978-3-319-75650-9
abstract
This book constitutes revised selected papers from the 10th International Symposium on Foundations and Practice of Security, FPS 2017, held in Nancy, France in October 2017. The 20 papers presented in this volume were carefully reviewed and selected from 53 submissions. The papers were organized in topical sections named: access control; formal verification; privacy; physical security; network security, encrypted DBs and blockchain; vulnerability analysis and deception systems; and defence against attacks and anonymity
WANG Leye, GAUTHIER Vincent, CHEN Guanling, MOREIRA‑MATIAS Luis
Special issue on extracting crowd intelligence from pervasive and social big data. Journal of Ambient Intelligence and Humanized Computing ed. Berlin; Heidelberg : Springer, 2018, vol. 9, n°2
URL: 10.1007/s12652-018-0680-z
abstract
With the prevalence of ubiquitous computing devices (smartphones, wearable devices, etc.) and social network services (Facebook, Twitter, etc.), humans are generating massive digital traces continuously in their daily life. Considering the invaluable crowd intelligence residing in these pervasive and social big data, a spectrum of opportunities is emerging to enable promising smart applications for easing individual life, increasing company profit, as well as facilitating city development. However, the nature of big data also poses fundamental challenges on the techniques and applications relying on the pervasive and social big data from multiple perspectives such as algorithm effectiveness, computation speed, energy efficiency, user privacy, server security, data heterogeneity and system scalability. This special issue presents the state-of-the-art research achievements in addressing these challenges
