Increasing user controllability on device specific privacy in the Internet of Things

With recent advancements in information technology more and more devices are integrated in the Internet of Things. These devices gather significant amount of private information pertinent to a user and while, in some cases it helps in improving the life style of an individual, in others it raises major privacy concerns. This trade-off between utility and privacy is highly dependent upon the devices in consideration and as the utility of the generated data increases, the privacy of an individual decreases. In this paper, we formulate a utility-privacy trade-off that enables a user to make appliance specific decisions as to how much data can be shared. This is achieved by parametrizing the degree of privacy allowed for each device and enabling the user to configure the parameter of each device. We use the smart metering application as the test case scenario for the proposed approach. We evaluate its performance using simulations conducted on the ECO data set. Our results indicate that, the proposed approach is successful in identifying appliances with an accuracy of 81.8% and a precision of 70.1%. In addition, it is demonstrated that device specific changes of the configuration parameters allow the degree of privacy achieved for the particular device and the utility to be well controlled, thus demonstrating the effectiveness of the proposed approach. Moreover, it is shown that, as expected, devices with higher power consumption contribute more to the overall privacy and utility achieved. A comparative study is also conducted and the proposed approach is shown to outperform the existing ElecPrivacy approach by producing a trace that is harder to identify, as reported after testing the Weiss’ and Baranski’s algorithm, both of which are well known Non-Intrusive Load Monitoring algorithms. Finally, it is demonstrated that the addition of noise, which is an integral part of the propose approach, can greatly improve performance

R-PEKS: RBAC Enabled PEKS for Secure Access of Cloud Data

In the recent past, few works have been done by combining attribute-based access control with multi-user PEKS, i.e., public key encryption with keyword search. Such attribute enabled searchable encryption is most suitable for applications where the changing of privileges is done once in a while. However, to date, no efficient and secure scheme is available in the literature that is suitable for these applications where changing privileges are done frequently. In this paper our contributions are twofold. Firstly, we propose a new PEKS scheme for string search, which, unlike the previous constructions, is free from bi-linear mapping and is efficient by 97% compared to PEKS for string search proposed by Ray et.al in TrustCom 2017. Secondly, we introduce role based access control (RBAC) to multi-user PEKS, where an arbitrary group of users can search and access the encrypted files depending upon roles. We termed this integrated scheme as R-PEKS. The efficiency of R-PEKS over the PEKS scheme is up to 90%. We provide formal security proofs for the different components of R-PEKS and validate these schemes using a commercial dataset

CBDI: Combined Banzhaf & Diversity Index for Finding Critical Nodes

Critical node discovery plays a vital role in assessing the vulnerability of a network to an abrupt change, such as an adversarial attack or human intervention. In this paper, we propose a new metric to characterize the criticality of a node in an arbitrary network which we refer to as the Combined Banzhaf & Diversity Index (CBDI). The metric utilizes a diversity index which is based on the variability of a node’s attributes relative to its neighbors and the Banzhaf Power Index which characterizes the degree of participation of a node in forming shortest paths. The Banzhaf power index is inspired from the theory of voting games in game theory. We evaluate the performance of the new metric using simulations. Our results indicate that in a number of network topologies, the proposed metric outperforms other proposals which have appeared in the literature. The proposed CBDI index chooses more critical nodes which, when removed, degrade network performance to a greater extent than if critical nodes based on other criticality metrics were removed

On the Complexity of Average Path length for Biological Networks and Patterns

Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate average path length for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time consuming compared to standard method. In this paper, a mathematical formulation is provided that calculates Average Path Length for graphs commonly present in biological networks, at the cost of uniform time complexity, for different size of networks

Spectral Partitioning for Node Criticality

Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated with the implementation of a maximization consensus algorithm. In this work, we use spectral partitioning concepts introduced by Fiedler, to propose a new suboptimal solution which significantly reduces the implementation complexity. Our approach, combined with recently proposed distributed Fiedler vector calculation algorithms enable each node to decide by itself whether it is a critical node. If a single node is required then the maximization algorithm is applied on a restricted set of nodes within the network. We derive a lower bound for the achievable algebraic connectivity when nodes are removed from the network and we show through simulations that our approach leads to algebraic connectivity values close to this lower bound. Similar behaviour is exhibited by other approaches at the expense, however, of a higher implementation complexity

Combined Banzhaf & Diversity Index (CBDI) for critical node detection

Critical node discovery plays a vital role in assessing the vulnerability of a computer network to malicious attacks and failures and provides a useful tool with which one can greatly improve network security and reliability. In this paper, we propose a new metric to characterize the criticality of a node in an arbitrary computer network which we refer to as the Combined Banzhaf & Diversity Index (CBDI). The metric utilizes a diversity index which is based on the variability of a node׳s attributes relative to its neighbours and the Banzhaf power index which characterizes the degree of participation of a node in forming shortest paths. The Banzhaf power index is inspired from the theory of voting games in game theory. The proposed metric is evaluated using analysis and simulations. The criticality of nodes in a network is assessed based on the degradation in network performance achieved when these nodes are removed. We use several performance metrics to evaluate network performance including the algebraic connectivity which is a spectral metric characterizing the connectivity robustness of the network. Extensive simulations in a number of network topologies indicate that the proposed CBDI index chooses more critical nodes which, when removed, degrade network performance to a greater extent than if critical nodes based on other criticality metrics were removed

A PLS-SEM Neural Network Approach for Understanding Cryptocurrency Adoption

© 2013 IEEE. The majority of previous research on new technology acceptance has been conducted with single-step Structural Equation Modeling (SEM) based methods. The primary purpose of the study is to enhance the new technology acceptance based research with the Artificial Neural Network (ANN) method to enable more precise and in-depth research results as compared to the single-step SEM method. This study measures the relation between technology readiness dimension (optimism, innovativeness, discomfort, insecurity) and the technology acceptance (perceived ease of use and perceived usefulness) - and the intention to use cryptocurrency, such as bitcoin. The contribution of this study include the use of a multi-analytical approach by combining Partial Least Squares- Structural Equation Modeling (PLS-SEM) and Artificial Neural Network (ANN) analysis. First, PLS-SEM was applied to assess which factor has significant influence toward intention to use cryptocurrency. Second, an ANN was employed to rank the relative influence of the significant predictor variables attained from the PLS-SEM. The findings of the two-step PLS-SEM and ANN approach confirm that the use of ANN further verifies the results obtained by the PLS-SEM analysis. Also, ANN is capable of modelling complex linear and non-linear relationships with high predictive accuracy compared to SEM methods. Also, an Importance-Performance Map Analysis (IPMA) of the PLS-SEM results provides a more specific understanding of each factor's importance-performance

Towards Transparency of IoT Message Brokers

In this paper we propose an ontological model for documenting provenance of MQTT message brokers to enhance the transparency of interactions between IoT agents

Enhanced Version of Multi-algorithm Genetically Adaptive for Multiobjective optimization

Abstract: Multi-objective EAs (MOEAs) are well established population-based techniques for solving various search and optimization problems. MOEAs employ different evolutionary operators to evolve populations of solutions for approximating the set of optimal solutions of the problem at hand in a single simulation run. Different evolutionary operators suite different problems. The use of multiple operators with a self-adaptive capability can further improve the performance of existing MOEAs. This paper suggests an enhanced version of a genetically adaptive multi-algorithm for multi-objective (AMAL-GAM) optimisation which includes differential evolution (DE), particle swarm optimization (PSO), simulated binary crossover (SBX), Pareto archive evolution strategy (PAES) and simplex crossover (SPX) for population evolution during the course of optimization. We examine the performance of this enhanced version of AMALGAM experimentally over two different test suites, the ZDT test problems and the test instances designed recently for the special session on MOEA?s competition at the Congress of Evolutionary Computing of 2009 (CEC?09). The suggested algorithm has found better approximate solutions on most test problems in terms of inverted generational distance (IGD) as the metric indicator. - See more at: http://thesai.org/Publications/ViewPaper?Volume=6&Issue=12&Code=ijacsa&SerialNo=37#sthash.lxkuyzEf.dpu

DNA amplified fingerprinting, a useful tool for determination of genetic origin and diversity analysis in Citrus

We used three short repetitive nucleotide sequences [(GTG)5, (TAC)5, and (GACA)4] either as radiolabeled probes for hybridization with restricted Citrus DNA or as single primers in polymerase chain reaction amplification experiments with total genomic DNA. We tested the ability of the sequences to discriminate between seedlings of zygotic or nuclear origin in the progeny of a Volkamer lemon #Citrus volkameriana# Ten. & Pasq.) tree. The genetic variability within two species [#Citrus sinensis# (L.) Osbeck (sweet oranges) and #Citrus reticulata# Blanco and relatives (mandarins)] was evaluated. DNA amplified figerprinting with single primers was the more successful technique for discriminating between nucellular and zygotic seedlings. Although we were not able to distinguish among 10 cultivars of #C. sinensis#, all 10 #C. reticulata# cultivars tested were distinguishable. However, it still is difficult to identify the putative parents of a hybrid plant when the two parental genomes are closely related. (Résumé d'auteur