Combining IOTA and Attribute-Based Encryption for Access Control in the Internet of Things

Unauthorized resource access represents a typical security threat in the Internet of things (IoT), while distributed ledger technologies (e.g., blockchain and IOTA) hold great promise to address this threat. Although blockchain-based IoT access control schemes have been the most popular ones, they suffer from several significant limitations, such as high monetary cost and low throughput of processing access requests. To overcome these limitations, this paper proposes a novel IoT access control scheme by combining the fee-less IOTA technology and the Ciphertext-Policy Attribute-Based Encryption (CP-ABE) technology. To control the access to a resource, a token, which records access permissions to this resource, is encrypted by the CP-ABE technology and uploaded to the IOTA Tangle (i.e., the underlying database of IOTA). Any user can fetch the encrypted token from the Tangle, while only those who can decrypt this token are authorized to access the resource. In this way, the proposed scheme enables not only distributed, fee-less and scalable access control thanks to the IOTA but also fine-grained attribute-based access control thanks to the CP-ABE. We show the feasibility of our scheme by implementing a proof-of-concept prototype system using smart phones (Google Pixel 3XL) and a commercial IoT gateway (NEC EGW001). We also evaluate the performance of the proposed scheme in terms of access request processing throughput. The experimental results show that our scheme enables object owners to authorize access rights to a large number of subjects in a much (about 5 times) shorter time than the existing access control scheme called Decentralized Capability-based Access Control framework using IOTA (DCACI), significantly improving the access request processing throughput.

DyPS: Dynamic, Private and Secure GWAS

Genome-Wide Association Studies (GWAS) identify the genomic variations that are statistically associated with a particular phenotype (e.g., a disease). The confidence in GWAS results increases with the number of genomes analyzed, which encourages federated computations where biocenters would periodically share the genomes they have sequenced. However, for economical and legal reasons, this collaboration will only happen if biocenters cannot learn each others’ data. In addition, GWAS releases should not jeopardize the privacy of the individuals whose genomes are used. We introduce DyPS, a novel framework to conduct dynamic privacy-preserving federated GWAS. DyPS leverages a Trusted Execution Environment to secure dynamic GWAS computations. Moreover, DyPS uses a scaling mechanism to speed up the releases of GWAS results according to the evolving number of genomes used in the study, even if individuals retract their participation consent. Lastly, DyPS also tolerates up to all-but-one colluding biocenters without privacy leaks. We implemented and extensively evaluated DyPS through several scenarios involving more than 6 million simulated genomes and up to 35,000 real genomes. Our evaluation shows that DyPS updates test statistics with a reasonable additional request processing delay (11% longer) compared to an approach that would update them with minimal delay but would lead to 8% of the genomes not being protected. In addition, DyPS can result in the same amount of aggregate statistics as a static release (i.e., at the end of the study), but can produce up to 2.6 times more statistics information during earlier dynamic releases. Besides, we show that DyPS can support a larger number of genomes and SNP positions without any significant performance penalty.

USE OF METAPHORIC ASSOCIATIVE CARDS FOR WORKING WITH OWNERSHIP RELATIONS

The paper deals with the understanding of property relations, a sense of ownership, and the need for property. Ownership relations are presented as a wide range of interactions with or around property, which is based on three interrelated elements: the owner, the target of ownership, and others (potential owners or those who must recognize the legitimacy of psychological possession). Ownership relations, as well as a very sense of ownership, on the one hand is often unconscious, background, and on the other - an ambiguous attitude on the part of society, which encourages people to hide their feelings about a target of ownership. Therefore, to work with such queries, it is best to use, especially in the initial stages, projective methods, including metaphorical associative cards. The aim of the article is to substantiate the practical techniques and means of the psychologists’ work with property relations, attitude towards property and feeling a sense of ownership with metaphorical associative cards as a tool for diagnosing and correcting client behavior and feelings about property relations. Methods. To achieve the goal of the study, the methods of analysis, synthesis and comparison are used to understand the general algorithm of work with the topic of psychological ownership and in general the principles and techniques of working with MAC, as well as the descriptive method. The main demands that can be caused by ownership relations are jealousy, envy, pathological accumulation, waste, excessive frugality, greed, feelings of loss of property, inability to own, irresponsibility, and so on. The possibility of using metaphorical associative cards as a projective method for diagnostic and correctional-therapeutic work of a psychologist with property relations is substantiated. The advantages of metaphorical associative cards for working with such type of queries are shown. The basic algorithms of request processing are described, as well as the techniques "Relationship with the target of ownership", "Ownership and parental guidelines" are presented. It has been shown that projective methods are an effective tool in the work of a psychologist and psychotherapist with such often unconscious issues as ownership and the desire for possession.

FUNCTIONS OF DISTRIBUTIONS OF AMOUNTS OF UNIFORALLY DISTRIBUTED RANDOM VALUES OF TIMES OF PROCESSING THE REQUEST OF THE INFOCOMMUNICATION SYSTEM

The normal distribution of a random variable is usually used in studies of the probabilistic properties of information systems. Using the normal distribution to approximate the distributions determined over a bounded distorts the physical meaning of the model and the numerical results obtained can only be used as an initial approximation. The purpose of the work is to improve methods for calculating the probability properties of infocommunication systems. The object of study is an analytical method for calculating the request processing time in the system, the subject is the formula for calculating the duration of sequential processing of a request by elements of the system with uniformly distributed independent random processing times. For positive random variables, it is proposed to use finite-interval distribution laws, for example, beta distribution. Density formulas and probability functions for the sums of two, three, and four independent randomly distributed variables are given.

Trusted and Efficient Request Processing using Packet List on Cloud

Distributed computing information is put away over the dispersed servers, which can be gotten to with the assistance of client questions. In distributed computing, a large number of client inquiries are handled by circulated server with less dormancy, high accessibility and high dependability. Be that as it may, giving privacy client inquiries is as yet a testing undertaking because of the high defenselessness exist in the cloud condition. The current components experience the ill effects of high computational and correspondence overhead, notwithstanding vulnerabilities still exists in their security instruments. In our proposed methodology, any client sends the spatial inquiries to the specialist co-op, at that point the specialist co-op utilize these spatial questions to keep an eye on the spatial scrambled information. Client utilizes the RC5 key to decode the reaction messages. In this whole procedure, clients can shield the information from the information spillage, diminishes the correspondence overhead when contrasted and other existing systems

Overload Control with Hybrid SIP Signaling - Using Smart Reliability and Priority Queuing Strategies

Session Initiation Protocol is an IP based application level signaling protocol. SIP employs request retransmission for enabling reliability over UDP transport. This research work proposes a Hybrid SIP System that integrates the congestion control techniques from the proposed Smart Reliable SIP and Overload control using Advanced Smart Priority (ASP) Queuing Strategy. The proposed system reduces retransmissions and queuing delays in SIP servers. Smart Reliable SIP (SRSIP) implements the modified Selective Repeat ARQ protocol for enabling reliability of SIP requests without violating the SIP core functionality. SRSIP reduces the number of retransmissions. ASP Queuing Strategy prioritizes the SIP requests based on the retransmissions. The proposed system reduces the queuing delays for request processing at the downstream server and the retransmissions over the network. The Hybrid models integrates the features of both Smart Reliable SIP and ASP queuing strategy resulting in a system with almost zero retransmissions and reduced queuing delay for request processing.