Search

In the context of the digital evolution of the logistics industry, the interconnection of logistics information systems and associated data have become an obstacle of business collaboration among various stakeholders. A critical challenge in this domain is ensuring controllable access to logistics business data, given the industry's current state characterized by independence, autonomy, disconnection, and heterogeneity, alongside the non-negotiable requirement for data privacy. We propose a novel model of trusted data access control based on of logistics business collaboration semantics. This approach incorporates semantic inference technologies into attribute-based access control mechanisms, thereby enabling the streamlined formulation of access control policies and facilitating unified authorization and control. Moreover, the method addresses the issue of access control policy management and maintenance at the semantic level. The proposed solution can pave the way for enhanced business collaboration between business entities, and further enable the building of a data exchange service platform within the logistics industry. [ABSTRACT FROM AUTHOR]

Heterogeneity, volume and real-time velocity of manufacturing data affect the business efficiency within the process for analyzing data in Robotic Process Automation (RPA). A novel parallel frequent itemset mining algorithm based on MapReduce (PMRARIM-IEG) is designed to improve the business efficiency. The algorithm is designed to address issues such as the CanTree's excessive space usage, the inability to dynamically set the support threshold, and the time-consuming data transmission during the Map and Reduce phases. Experiments show that the proposed algorithm has lower memory usage and higher parallel efficiency than the traditional parallel frequent itemset mining algorithm. [ABSTRACT FROM AUTHOR]

The extensive application of the Internet of Things (IoT) and artificial intelligence technology has greatly promoted the construction and development of smart cities. Smart home as the foundation of smart cities can optimize home lifestyles. However, users access the smart home system through public channels, and the transmitted information is vulnerable to attack by attackers, and the privacy and data security of the home user will be difficult to be guaranteed. Therefore, how to protect users' data and privacy security becomes critical. In this paper, we design a provably secure authentication scheme for the smart home environment, which ensures that only legitimate users can use smart devices. We use the informal model to verify the security of the scheme and formally analyze the security and correctness of the scheme through the Real or Random model. Finally, through the comparison of security and performance analysis, it is proven that our scheme has higher security under similar performance. [ABSTRACT FROM AUTHOR]

The smart home is a crucial embodiment of the internet of things (IoT), which can facilitate users to access smart home services anytime and anywhere. Due to the limited resources of cloud computing, it cannot meet users' real-time needs. Therefore, edge computing emerges as the times require, providing users with better real-time access and storage. The application of edge computing in the smart home environment can enable users to enjoy smart home services. However, users and smart devices communicate through public channels, and malicious attackers may intercept information transmitted through public channels, resulting in user privacy disclosure. Therefore, it is a critical issue to protect the secure communication between users and smart devices in the smart home environment. Furthermore, authentication protocols in smart home environments also have some security challenges. In this paper, we propose an anonymous authentication protocol that applies edge computing to the smart home environment to protect communication security between entities. To protect the security of smart devices, we embed physical unclonable functions (PUF) into each smart device. Real-or-random model, informal security analysis, and ProVerif are adopted to verify the security of our protocol. Finally, we compare our protocol with existing protocols regarding security and performance. The comparison results demonstrate that our protocol has higher security and slightly better performance. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet, Internet of Things (IoT) technology is widely used in people's daily lives. As the number of IoT devices increases, the amount of data to be processed also increases. The emergence of cloud computing can process the data of IoT devices in a timely manner, and it provides robust storage and computing capabilities to facilitate data resource sharing. Since wireless communication networks are unstable and open, it is easy for attackers to eavesdrop, intercept, and tamper with the messages sent. In addition, authentication protocols designed for IoT-enabled cloud computing environments still face many security challenges. Therefore, to address these security issues, we propose an Intel software-guard-extensions (SGX)-based authentication key agreement protocol in an IoT-enabled cloud computing environment. The goal is to ensure data privacy and sustainable communication between the entities. Moreover, SGX can resist several well-known attacks. Finally, we show the security using the real-or-random model, ProVerif, and informal analysis. We also compare the security and performance of the proposed protocol with existing protocols. The comparison results show that our proposed protocol reduces the communication cost by 7.07 % compared to the best one among the current protocols and ensures sufficient security. [ABSTRACT FROM AUTHOR]

With the maturity and popularization of the Internet of Things, we saw the emergence of the Internet of Vehicles. This collects and processes real-time traffic information, alleviates traffic congestion, and realizes intelligent transportation. However, sensitive information, such as real-time driving data of vehicles, are transmitted on public channels, which are easily to steal and manipulate for attackers. In addition, vehicle communications are vulnerable to malicious attacks. Therefore, it is essential to design secure and efficient protocols. Many studies have adopted asymmetric cryptosystems and fog computing to in this environment, but most of them do not reflect the advantages of fog nodes, which share the computational burden of cloud servers. Therefore, it is challenging to design a protocol that effectively uses fog nodes. In this paper, we design an authentication protocol based on a symmetric encryption algorithm and fog computing in the Internet of Vehicles. In this protocol, we first propose a four-layer architecture that significantly reduces the computational burden of cloud servers. To resist several well-known attacks, we also apply Intel software guard extensions to our protocol. This is because it can resist privileged insider attacks. We prove the security of the proposed protocol through the Real-Or-Random model and informal analysis. We also compare the performance of the proposed protocol with recent protocols. The results show better security and a lower computational cost. [ABSTRACT FROM AUTHOR]

In this paper, ant colony optimization algorithm is used, and then the records in the supply and demand documents in the material requirement planning (MRP) are used to simulate the city points that the salesperson moves, so that the artificial ants can move between cities. To find the shortest path through all cities, that is, to find the shortest path of MRP in the main file of supply and demand, to reduce the system execution time, improve the efficiency of related personnel. Experimental results show that compared with other algorithms, ACO algorithm can effectively shorten the deployment time of MRP and greatly improve the implementation efficiency. [ABSTRACT FROM AUTHOR]

Hierarchical key assignment scheme is an efficient cryptographic method for hierarchical access control, in which the encryption keys of lower classes can be derived by the higher classes. Such a property is an effective way to ensure the access control security of Internet of Things data markets. However, many researchers on this field cannot avoid potential single point of failure in key distribution, and some key assignment schemes are insecure against collusive attack or sibling attack or collaborative attack. In this paper, we propose a hierarchical key assignment scheme based on multilinear map to solve the multigroup access control in Internet of Things data markets. Compared with previous hierarchical key assignment schemes, our scheme can avoid potential single point of failure in key distribution. Also the central authority of our scheme (corresponding to the data owner in IoT data markets) does not need to assign the corresponding encryption keys to each user directly, and users in each class can obtain the encryption key via only a one-round key agreement protocol. We then show that our scheme satisfies the security of key indistinguishability under decisional multilinear Diffie-Hellman assumption. Finally, comparisons show the efficiency of our scheme and indicates that our proposed scheme can not only resist the potential attacks, but also guarantee the forward and backward security. [ABSTRACT FROM AUTHOR]

The increasing demand for real-time data transmission in wireless mobile communication networks has promoted the maturity of mobile communication technology. Fifth-generation (5G) mobile communication technology is combined with cloud computing, high-frequency signal transmission, and other technologies and perfectly fits with the client-server architecture. 5G has been applied in many fields, such as the interconnection of smart devices, virtual reality, and cloud-based life. To provide the security and availability of the required services, we proposed a key management scheme based on the multiserver architecture of the client-server mode in 5G networks, which uses bilinear pairings and elliptic curve cryptography. Through informal security analysis and formal analysis (under the random oracle model and ProVerif tool), we demonstrated that the proposed scheme can complete mutual authentication and resist common network attacks. Furthermore, after the performance analysis of our scheme and other related schemes, it was found that this scheme has relatively low communication and computation costs and better security performance. [ABSTRACT FROM AUTHOR]

The interaction between children and books is an essential part of the reading experience. Publishers all over the world are working to cultivate reading habits in children and attract attention to traditional books. Considering the invaluable nature of these early reading experiences. This paper investigated the effects of book interaction design on 5–6 years old children, taking into account reading preferences, measuring reading time, and emotional response to improve their reading experience and potentially design books according to these interactions. The results showed that preschool children (5–6 years old) prefer sensory interaction, and that book interaction design has a significant influence on reading time, affective experience, and subjective ratings. Girls around 5–6 years preferred folding interaction and pop-up interaction in reading. This study summarizes these results in order to provide practical guidelines for book publishers, enabling them to design better books for children. [ABSTRACT FROM AUTHOR]

Global routing is an important link in very large scale integration (VLSI) design. As the best model of global routing, X-architecture Steiner minimal tree (XSMT) has a good performance in wire length optimization. XSMT belongs to non-Manhattan structural model, and its construction process cannot be completed in polynomial time, so the generation of XSMT is an NP hard problem. In this paper, an X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution (XSMT-MoDDE) is proposed. Firstly, an effective encoding strategy, a fitness function of XSMT, and an initialization strategy of population are proposed to record the structure of XSMT, evaluate the cost of XSMT and obtain better initial particles, respectively. Secondly, elite selection and cloning strategy, multiple mutation strategies, and adaptive learning factor strategy are presented to improve the search process of discrete differential evolution algorithm. Thirdly, an effective refining strategy is proposed to further improve the quality of the final Steiner tree. Finally, the results of the comparative experiments prove that XSMT-MoDDE can get the shortest wire length so far, and achieve a better optimization degree in the larger-scale problem., Competing Interests: Chi-Hua Chen is an Academic Editor for PeerJ Computer Science., (© 2021 Liu et al.)