Remote English Teaching Resource Sharing Based on Internet O2O Model

Aiming at the problems of low success rate, delay, and high communication cost in distance English teaching resource sharing, this paper puts forward a method of distance English teaching resource sharing based on Internet O2O mode. Based on the model of distance English teaching resource sharing, this paper designs four processes: query, reply, resource substitution, and resource sharing optimization. Experimental results show that the proposed method can achieve high success rate of resource sharing, low latency, communication cost, and high transmission efficiency. Therefore, it is an effective method.

Public Auditing Scheme for Integrity Verification in Distributed Cloud Storage System

Cloud storage provides a potential solution replacing physical disk drives in terms of prominent outsourcing services. A threaten from an untrusted server affects the security and integrity of the data. However, the major problem between the data integrity and cost of communication and computation is directly proportional to each other. It is hence necessary to develop a model that provides the trade-off between the data integrity and cost metrics in cloud environment. In this paper, we develop an integrity verification mechanism that enables the utilisation of cryptographic solution with algebraic signature. The model utilises elliptic curve digital signature algorithm (ECDSA) to verify the data outsources. The study further resists the malicious attacks including forgery attacks, replacing attacks and replay attacks. The symmetric encryption guarantees the privacy of the data. The simulation is conducted to test the efficacy of the algorithm in maintaining the data integrity with reduced cost. The performance of the entire model is tested against the existing methods in terms of their communication cost, computation cost, and overhead cost. The results of simulation show that the proposed method obtains reduced computational of 0.25% and communication cost of 0.21% than other public auditing schemes.

A lightweight and secure online/offline cross-domain authentication scheme for VANET systems in Industrial IoT

In heterogeneous wireless networks, the industrial Internet of Things (IIoT) is an essential contributor to increasing productivity and effectiveness. However, in various domains, such as industrial wireless scenarios, small cell domains, and vehicular ad hoc networks, an efficient and stable authentication algorithm is required (VANET). Specifically, IoT vehicles deal with vast amounts of data transmitted between VANET entities in different domains in such a large-scale environment. Also, crossing from one territory to another may have the connectivity services down for a while, leading to service interruption because it is pervasive in remote areas and places with multipath obstructions. Hence, it is vulnerable to specific attacks (e.g., replay attacks, modification attacks, man-in-the-middle attacks, and insider attacks), making the system inefficient. Also, high processing data increases the computation and communication cost, leading to an increased workload in the system. Thus, to solve the above issues, we propose an online/offline lightweight authentication scheme for the VANET cross-domain system in IIoT to improve the security and efficiency of the VANET. The proposed scheme utilizes an efficient AES-RSA algorithm to achieve integrity and confidentiality of the message. The offline joining is added to avoid remote network intrusions and the risk of network service interruptions. The proposed work includes two different significant goals to achieve first, then secure message on which the data is transmitted and efficiency in a cryptographic manner. The Burrows Abdi Needham (BAN logic) logic is used to prove that this scheme is mutually authenticated. The system’s security has been tested using the well-known AVISPA tool to evaluate and verify its security formally. The results show that the proposed scheme outperforms the ID-CPPA, AAAS, and HCDA schemes by 53%, 55%, and 47% respectively in terms of computation cost, and 65%, 83%, and 40% respectively in terms of communication cost.

A novel state space reduction algorithm for team formation in social networks

Team formation (TF) in social networks exploits graphs (i.e., vertices = experts and edges = skills) to represent a possible collaboration between the experts. These networks lead us towards building cost-effective research teams irrespective of the geolocation of the experts and the size of the dataset. Previously, large datasets were not closely inspected for the large-scale distributions & relationships among the researchers, resulting in the algorithms failing to scale well on the data. Therefore, this paper presents a novel TF algorithm for expert team formation called SSR-TF based on two metrics; communication cost and graph reduction, that will become a basis for future TF’s. In SSR-TF, communication cost finds the possibility of collaboration between researchers. The graph reduction scales the large data to only appropriate skills and the experts, resulting in real-time extraction of experts for collaboration. This approach is tested on five organic and benchmark datasets, i.e., UMP, DBLP, ACM, IMDB, and Bibsonomy. The SSR-TF algorithm is able to build cost-effective teams with the most appropriate experts–resulting in the formation of more communicative teams with high expertise levels.

A Chemistry-Oriented Cost-Effective Expert Team Formation in Social Networks

<p>The growth of social networks in modern information systems has enabled the collaboration of experts at an unprecedented scale. Given a social network and a task consisting of a set of required skills, Team Formation (TF) aims at finding a team of experts who can cover the required skills and can communicate in an effective manner. However, this definition has been interpreted as the problem of finding teams with minimum communication cost which neglects two aspect of team formation in real life. The first is that in reality experts are multi-skilled, hence communication cost cannot be a fixed value and should vary according to the channels employed. The second ignored aspect is disregarding teams with high expertise level who can still satisfy the required communication level. To tackle above mentioned issues, I introduce a dynamic formof communication for multi-facet relationships and use it to devise a novel approach called Chemistry Oriented Team Formation (ChemoTF) based on two new metrics; Chemistry Level and Expertise Level. Chemistry Level measures scale of communication required by the task andExpertise Level measures the overall expertise among potential teams filtered by Chemistry Level. Moreover, I adopt a personnel cost metric to filter costly teams. The experimental results on the corpus compiled for this purpose suggests that ChemoTF returns communicative and cost-effective teams with the highest expertise level compared to state-of-the-art algorithms. The corpus itself is a valuable output which contains comprehensive scholarly information in the field of computer science.</p>

A Chemistry-Oriented Cost-Effective Expert Team Formation in Social Networks

<p>The growth of social networks in modern information systems has enabled the collaboration of experts at an unprecedented scale. Given a social network and a task consisting of a set of required skills, Team Formation (TF) aims at finding a team of experts who can cover the required skills and can communicate in an effective manner. However, this definition has been interpreted as the problem of finding teams with minimum communication cost which neglects two aspect of team formation in real life. The first is that in reality experts are multi-skilled, hence communication cost cannot be a fixed value and should vary according to the channels employed. The second ignored aspect is disregarding teams with high expertise level who can still satisfy the required communication level. To tackle above mentioned issues, I introduce a dynamic formof communication for multi-facet relationships and use it to devise a novel approach called Chemistry Oriented Team Formation (ChemoTF) based on two new metrics; Chemistry Level and Expertise Level. Chemistry Level measures scale of communication required by the task andExpertise Level measures the overall expertise among potential teams filtered by Chemistry Level. Moreover, I adopt a personnel cost metric to filter costly teams. The experimental results on the corpus compiled for this purpose suggests that ChemoTF returns communicative and cost-effective teams with the highest expertise level compared to state-of-the-art algorithms. The corpus itself is a valuable output which contains comprehensive scholarly information in the field of computer science.</p>

Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF

In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P 0 and P 1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PSTY, Eurocrypt 2019) showed how to construct a concretely efficient Circuit-PSI protocol with linear communication complexity. However, their protocol requires super-linear computation. In this work, we construct concretely efficient Circuit-PSI protocols with linear computational and communication cost. Further, our protocols are more performant than the state-of-the-art, PSTY – we are ≈ 2.3× more communication efficient and are up to 2.8× faster. We obtain our improvements through a new primitive called Relaxed Batch Oblivious Programmable Pseudorandom Functions (RB-OPPRF) that can be seen as a strict generalization of Batch OPPRFs that were used in PSTY. This primitive could be of independent interest.

Indexing structures for the PLS blockchain

This paper studies known indexing structures from a new point of view: minimisation of data exchange between an IoT device acting as a blockchain client and the blockchain server running a protocol suite that includes two Guy Fawkes protocols, PLS and SLVP. The PLS blockchain is not a cryptocurrency instrument; it is an immutable ledger offering guaranteed non-repudiation to low-power clients without use of public key crypto. The novelty of the situation is in the fact that every PLS client has to obtain a proof of absence in all blocks of the chain to which its counterparty does not contribute, and we show that it is possible without traversing the block’s Merkle tree. We obtain weight statistics of a leaf path on a sparse Merkle tree theoretically, as our ground case. Using the theory we quantify the communication cost of a client interacting with the blockchain. We show that large savings can be achieved by providing a bitmap index of the tree compressed using Tunstall’s method. We further show that even in the case of correlated access, as in two IoT devices posting messages for each other in consecutive blocks, it is possible to prevent compression degradation by re-randomising the IDs using a pseudorandom bijective function. We propose a low-cost function of this kind and evaluate its quality by simulation, using the avalanche criterion.

Mobile Edge Computing Enabled Efficient Communication Based on Federated Learning in Internet of Medical Things

The rapid growth of the Internet of Medical Things (IoMT) has led to the ubiquitous home health diagnostic network. Excessive demand from patients leads to high cost, low latency, and communication overload. However, in the process of parameter updating, the communication cost of the system or network becomes very large due to iteration and many participants. Although edge computing can reduce latency to some extent, there are significant challenges in further reducing system latency. Federated learning is an emerging paradigm that has recently attracted great interest in academia and industry. The basic idea is to train a globally optimal machine learning model among all participating collaborators. In this paper, a gradient reduction algorithm based on federated random variance is proposed to reduce the number of iterations between the participant and the server from the perspective of the system while ensuring the accuracy, and the corresponding convergence analysis is given. Finally, the method is verified by linear regression and logistic regression. Experimental results show that the proposed method can significantly reduce the communication cost compared with the general stochastic gradient descent federated learning.