Efficient and flexible management for industrial Internet of Things: A federated learning approach

Given a (possibly improper) edge-colouring F of a graph G, a vertex-colouring c of G is adapted toF if no colour appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L of G, with |L(v)|>=k for all v, and any edge-colouring F of G, there exists a vertex-colouring c of G adapted to F such that c(v)@?L(v) for all v, then G is said to be adaptablyk-choosable. The smallest k such that G is adaptably k-choosable is called the adaptable choice number and is denoted by ch"a"d(G). This note proves that ch"a"d(G)@[email protected]?Mad(G)/[email protected]?+1, where Mad(G) is the maximum of 2|E(H)|/|V(H)| over all subgraphs H of G. As a consequence, we give bounds for classes of graphs embeddable into surfaces of non-negative Euler characteristics.

/pdf/an-upper-bound-on-adaptable-choosability-of-graphs-2hiy7v25gj.pdf

An upper bound on adaptable choosability of graphs

http://www.cs.toronto.edu/~giovanna/papers/listadapt.pdf

The adaptable choosability number grows with the choosability number

Designing a blockchain-enabled privacy-preserving energy theft detection system for smart grid neighborhood area network

Sharing power data between electrical power grids is vital issue in energy management. The multi-agent approach has been used in many applications that can support the development of complex systems by making them independent and collaborative. The smart grid is one of the most complex system that expected to have higher level of independence and reliability with adequate protection and adaptation to the response of the user’s request. A multi-agent system is used in this paper to share knowledge and overcome challenges in smart grids. The information shared is used to make a decision that helps in managing power distribution within the grid and with other networks. The presented multi-agent mechanism enhances power system reliability by providing the correct information at the critical time. The results show that the multi-agent system was performed in an efficient and timely manner, which makes it very promising to be excellent candidate for smart grid management.

A Novel Multi-agent Mechanism for Managing Electrical Power Smart Grids

Smart grid is a modern electric power grid designed to improve efficiency and reliability of the production and distribution of electric power. In a smart grid, smart meters continuously generate electric power consumption data and send it to the server. These data have two important purposes: (1) The sum of the data generated by each meter in a certain period of time will be used for billing; (2) The sum of the data generated by all meters in a specific area at a given time will be used to predict the electric power required in that area for electric power distribution. These data are considered to be sensitive and should be properly protected. There have been many studies on the confidentiality and privacy protection of these data. Some schemes require trusted servers, some schemes require heavy computation, and some schemes need to send two sets of data, one for billing and the other for electric power distribution. In this article, we propose an efficient and privacy-preserving communication scheme for the transmission of meter data in a smart grid. No trusted authorities are required in the scheme. By sending only one set of data, the new communication scheme can ensure that both sums for billing and sums for electric power distribution can be computed accurately. The scheme uses only simple operations, such as addition and hashes. It is computationally lightweight and suitable for devices with limited computing resources.

/pdf/an-efficient-and-privacy-protection-communication-scheme-for-1wcrqitfgd.pdf

An Efficient and Privacy Protection Communication Scheme for Smart Grid

Adaptable choosability of planar graphs with sparse short cycles

User name and password are one of the most commonly used authentication mechanisms in information systems and social networks. Strong passwords are secure, but not easy to memorize; users may choose passwords that are easy to remember as well as easy to be compromised. Therefore, online password guessing attacks becomes a major security threat in information systems and social networks. It is a challenge to provide a reliable user authentication solution that allows legitimate access and prevents password guessing attacks. Our preliminary study observed the fact that legal users know what passwords they have chosen, while attackers can only guess what they are. The proposed solution applies information theory and compares the entropy discrepancy between the passwords entered by the user and attacker. The password entropy is calculated by accumulating the frequencies of the entered characters, not the password itself. The experimental results show that, even if the user selects a common password, the proposed authentication method can distinguish between legitimate users and attackers effectively and efficiently.

A Novel Verification scheme for Resisting Password Guessing Attacks

A light-weight bit commitment protocol based on unpredictable channel noise

Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks, especially for sensors with limited computing res...

Albert Guan

Papers

An Efficient and Privacy Protection Communication Scheme for Smart Grid

Adaptable choosability of planar graphs with sparse short cycles

A Novel Verification scheme for Resisting Password Guessing Attacks

A light-weight bit commitment protocol based on unpredictable channel noise

An efficient secret key agreement protocol based on random noise without beacons