Search

Industrial Internet of Things (IIoT) is a pivotal driving force behind the intelligent transformation of the global industrial system, bringing about a gradual shift in production methods. However, due to users completing remote access and data transmission through open channels, ensuring user legitimacy and data security has become an important factor in IIoT. In addition, resource limited users or devices need to collect and publish corresponding messages while also timely processing instant messages obtained from the network. Leveraging edge computing technology effectively mitigates the transmission time of messages, addressing the challenges of high computing pressure and prolonged response time associated with cloud server computing. Therefore, investigating authentication key agreement based on edge computing in the IIoT environment holds substantial theoretical significance and practical importance. This article introduces an IIoT authentication that ensures both security and efficiency by integrating elliptic curve cryptography and three-factor authentication. Within this scheme, the user and the edge server accomplish security authentication. Through security analysis, the proposed scheme is proven to meet the essential security requirements. Performance analysis shows that it achieves higher security, supports more functions, and achieves lower computational and communication costs compared to related schemes. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for measuring multi-shapes degrees of similarities. A new shape transformation concept is suggested through mapping the closed boundary of the shape using unfolded process into one-to-one equivalent graph (or signal) where ample number of approaches for similarity testing can be applied. The degree of similarity is then measured by calculating the discrepancies between each of the two transformed unfolded-graphs autocorrelation functions. The proposed method is also effective in applying clustering technique for clustering groups of shapes into three hierarchical similarity levels depending on their mutual degree of similarity. The suggested similarity method handles two categories of shapes: geometric and non-geometric. Unlike other well-known techniques in the subject of machine learning and deep learning, the presented method represents a powerful analytical-based technique for similarity analysis of both regular and irregular shapes regardless of size or orientation, and in effectively handling compound or multi-shapes degrees of similarities. The results of testing the approach on selected datasets have successfully demonstrated the great effectiveness of the developed technique in yielding output multi-shape degrees of similarities in new graphical and comprehensive forms. Finally, it is pointed out that the new approach will have many potential real-life applications such as in industry, medicine, biology, security, and authentications. [ABSTRACT FROM AUTHOR]

An important reason to protect provider and medical care patient information and data is digital terrorism. Patient health records and healthcare provider information are sensitive issues that can affect patients' health or even national security. Many frequent attacks have carried out breaches on health databases/data sets continuously and on remote servers and local servers with wireless sensor networks (WSNs) in different places. Various modern approaches addressed this issue and were designed to prevent these attacks with the aim of providing the security of patient information and data transmitted and collected by WSNs. However, there are still several signs of weakness in these approaches, which are described in the literature review. This research proposes a new trustworthy approach that supports the provision of data security and information collected by WSN and stored on basestation databases. This approach takes advantage of the integration of several security mechanisms including symmetric cryptography for encryption, asymmetric cryptography for signature and access control, as well as the implementation of the Lesamnta-LW function in the signature mechanism. Solid methodology and careful use of these mechanisms protect and hide users' information from being exposed to attackers. Security analyses, investigative comparisons and rigorous findings indicate that the proposed approach is superior to previous approaches. [ABSTRACT FROM AUTHOR]

With the fast development of quantum computer technology, one has to focus on the security of information running in real networks. Topological coding is a technology of basic topological structure, number theory and algebra has potential application value in asymmetric encryption system. The public key and private key of topological graph encryption system designed by topological coding may be able to resist attacks equipped with artificial intelligence technology and quantum computer. In order to further investigate topology encoding, we propose new techniques for designing public and private keys using graph coloring and labeling. [ABSTRACT FROM AUTHOR]

Graph Neural Networks (GNNs) are powerful in learning rich network representations that aid the performance of downstream tasks. However, recent studies showed that GNNs are vulnerable to adversarial attacks involving node injection and network perturbation. Among these, node injection attacks are more practical as they do not require manipulation in the existing network and can be performed more realistically. In this paper, we propose a novel problem statement — a class-specific poison attack on graphs in which the attacker aims to misclassify specific nodes in the target class into a different class using node injection. Additionally, nodes are injected in such a way that they camouflage as benign nodes. We propose NICKI, a novel attacking strategy that utilizes an optimization-based approach to sabotage the performance of GNN-based node classifiers. NICKI works in two phases — it first learns the node representation and then generates the features and edges of the injected nodes. Extensive experiments and ablation studies on four benchmark networks show that NICKI is consistently better than four baseline attacking strategies for misclassifying nodes in the target class. We also show that the injected nodes are properly camouflaged as benign, thus making the poisoned graph indistinguishable from its clean version w.r.t various topological properties. [ABSTRACT FROM AUTHOR]

• The irreversible order-based encoding used in cancelable biometric templates is reversible using IPSA-M. • IPSA-M can exploit the vulnerability of cancelable systems built on different modalities. • Countermeasures using non-uniform quantization can alleviate the effect of the IPSA-M. • Attack efficacy comparison shows that IPSA-M is efficient and practical compared to other methods. Researchers have been proposing different matching frameworks for cancelable template design to improve the matching performance and security of biometric authentication systems. Despite the advantages provided by these systems, they are often vulnerable to different attacks due to their templates' invertible nature. This study utilized an iterative perturbation stochastic approximation procedure to analyze the irreversible order-based encoding approach used in cancelable biometric template transformation. The strategy begins by exploiting the scores corresponding to the encoded words, then a mixed variable-based iterative perturbation is used to generate independent random elements and consequently the corresponding template from the scores. The strategy exploits the vulnerability of three different cancelable systems it has tested, demonstrating that other techniques of similar nature fall short of the security standard for attack mitigation that cancelable biometric systems require. After analyzing the reasons that exploit the system's vulnerability, we use a parameterized thresholding non-uniform quantization as a countermeasure to boost the system's robustness while maintaining a balanced performance-security trade-off. As a result, the system can evade attacks without significantly hindering its matching performance. Finally, generality and computational complexity evaluations on different modalities and strategies validate the attack's efficacy and realism, respectively. [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

In healthcare systems, users require keys and certificates to communicate and share electronic health records (EHRs). The traditional EHR sharing system typically involves a single centralized trusted third-party (STTP) for authentication, auditing, key generation, and storing and managing patients' EHRs. To securely collect and share EHRs from multiple hospitals, users perform cryptographic operations. The cryptographic operations require keys that are generated by STTP. However, compromised or malicious STTP can disclose the users' information that is vulnerable to users' privacy and data sovereignty. Therefore, to enhance the trustworthiness and reliability of the STTP, we need to provide a solution that eliminates the dependency on the STTP. In this article, we propose a decentralized and multi-authority based public key infrastructure for summarized EHR sharing using Interplanetary File System (IPFS). The proposed system generates cryptographic key pairs for users using a binary tree-based multi-authority structure instead of relying on STTP. The proposed system prevents a single point of failure (SPOF) and is resilient to key-escrow problem. In addition, the proposed system contributes to the construction of privacy preserved summarized EHRs by securely collecting EHRs from multiple hospitals. Thus, summarized EHRs help in patients' well-being and enhance the quality of treatments. Furthermore, the performance analysis demonstrates that the proposed system is lightweight and efficient in aspects of execution time and storage overhead compared to existing solutions. [ABSTRACT FROM AUTHOR]

The post-quantum cryptography (PQC) standardization process of the National Institute of Standards and Technology (NIST) has entered the final round. Kyber is one of the four key encapsulation mechanism (KEM) finalists. The coefficient multiplication is vulnerable to side-channel attacks. In this paper, we analyzed the multiplication part of Kyber and proposed the methods for constructing ciphertext. By using the chosen ciphertext, more functions can be attacked in the reference implementation of Kyber512. The attacks succeed on the pqm4 implementation with chosen ciphertext while failing with random ciphertext in our experiment environment. For all the attacks, the full secret key recovery can be achieved in a few minutes. • We used chosen ciphertext to attack more position in the decryption of Kyber. • The number of traces used for some functions was reduced by using chosen ciphertext. • In all the experiments, the proposed attack taked only several minutes. [ABSTRACT FROM AUTHOR]

Opportunistic networks are self-organizing dynamic networks that use the communication opportunities presented by node movement to enable data delivery. Due to the indirect nature of inter-node connections and dynamic topology, opportunistic networks are vulnerable to malicious attacks, which poses a great challenge to their security. In this paper, we first propose a trust-based model for the secure routing of opportunistic networks (TBMOR), which incorporates forwarding positive degree (FP) and node activity degree (NA) into the calculation of trust value, evaluates nodes in the network by a dynamic combination of direct trust and indirect trust, and then optimizes the next node list using trust values and pruning strategies. Secondly, this paper extends the network life cycle by dynamically setting up energy thresholds to reduce network redundancy by dynamically partitioning the number of replicas using trust values.Simulation results show that compared to other routers, TBMOR can effectively resist malicious attacks, has a higher message delivery rate and lower transmission latency than other routers. [ABSTRACT FROM AUTHOR]

Technological developments continue to increase, causing many crimes to occur on social media. There are various types of encryption that can be used. So we need a system to protect and prevent misuse of data by unauthorized parties. One of the techniques used in this study is the encryption method. Encryption is applied to user passwords on web login systems. Simulation results can be tested by measuring resistance to attacks or data theft. In this study, the Vigenere cipher was combined with the One-Time Pad cipher, which then produced encryption in the XOR results. Furthermore, the hash value that can be obtained by implementing the MD5 algorithm on encrypted files is used as a means of verifying encrypted files, further strengthening data security while confirming its integrity. Furthermore, the results show that the proper implementation of the algorithm affects data security positively. The test results were obtained with a value of 71%, which means that the encoding results are good enough for data security. [ABSTRACT FROM AUTHOR]

• The effect of synchronisation on the master-slave NNs with time delay is examined. • The NN's chaotic attractor is reconstructed using the fractal interpolation. • Reconstructed chaotic sequence is applied in image encryption. • Image encryption is carried out using RSA algorithm. • Various statistical measures are used to verify the efficacy. This paper examines synchronization of delayed chaotic neural networks with impulsive control, event-triggered impulsive control, and event-triggered delayed impulsive control. Lyapunov-based event-triggered mechanism is constructed to derive few sufficient conditions in terms of Linear Matrix Inequalities (LMIs). The feedback and event-triggered gain matrices are evaluated with the help of numerical packages. The fractal interpolation functions are employed to reconstruct the chaotic sequence of the neural networks since the chaotic attractor has self-similar properties and coincides with the fractal functions. In this study, a linear fractal interpolation is used to reconstruct both the master-slave chaotic attractor and the encrypted chaotic attractor, with optimized scaling factors. Finally, an application of the image encryption algorithm is given in terms of RSA public-key cryptosystems, permutation, and finite field diffusion for the chaotic sequence generated by fractal interpolation functions. [ABSTRACT FROM AUTHOR]

• A visual mapping on the SPD manifold of a handwritten signature is proposed for the first time in OSV literature. • Handwritten signature modelling utilize concepts and algorithms of differential-curved geometry. • The notorious limited training data curse of pattern recognition is addressed with two SPD based methods. • Performance evaluation on three datasets highlights the potential efficiency. The human handwritten signature is considered to be a significant biometric trait. In the case of offline signatures, the problem is addressed as an image recognition task. On the other hand, the visual representation of symmetric positive definitive matrices, usually by means of the covariance descriptor of the image feature maps, forms a specific Riemannian manifold with a widespread usage and a favorable performance in a plethora of applications. Surprisingly, no records of offline-signature-verification-oriented research in the space of symmetric positive definitive matrix have been found up to now. In this work, we propose, for the first time in offline signature-verification literature, mapping of handwritten signature images in points of the tangent space of a connected symmetric positive definitive manifold for verification purposes. Furthermore, based on the principles of differential geometry, we address the notorious limited training problem of offline signature verification in this manifold by proposing two different feature augmentation methods. The efficiency of the proposed method is evaluated using three popular datasets of Western and Asian origin. Error rates against skilled and random forgery in both baselines as well augmentation scenarios are strong indicators of the informative and highly discriminative nature of symmetric positive definitive manifold oriented representation. [ABSTRACT FROM AUTHOR]

Mobile Crowd Sensing (MCS) is an effective way to tackle day-to-day life problems nowadays, from Google Maps to Uber cabs. It is an effective and efficient way of data collection, processing and delivery of results to the users, from the users and for the users. All the entities that make up a Mobile crowd sensing system be it a worker, requester or miner can be represented as a node. All the nodes interact together to make a trustworthy system where there is a limited or no scope of deception. The traditional approach to crowd sensing gives little importance to communication between the nodes and in most cases, it assumes the communication happens through a secure channel and ignores the potential hazards. We propose a novel blockchain-based decentralized and collaborative approach to communicate between the nodes which would help workers/users to interact in real-time and solve conflicts should there be any. To decentralize we use the blockchain technology to overcome single point of failure which is a major issue, as mentioned peer-to-peer link between nodes is more expensive only but it improvise the security and privacy concerns by using the consensus mechanism. With the aim of improving the traditional communication technology between the nodes, we propose a mechanism based on Kafka, blockchain and RSA encryption for continuous exchange of data between the nodes which would help to enhance the security and efficiency of the system. [ABSTRACT FROM AUTHOR]

Taking advantage of the high performance and powerful data processing capabilities of cloud computing technology, externalizing data to the cloud platform is considered as an inevitable trend in the digital field today. However, ensuring the security and privacy of data remains a major challenge. To overcome this drawback, a multi-cloud platform is proposed to improve privacy and high availability of data. A multi-cloud platform that integrates public, private, and managed clouds with a single user interface. Cloud-hosted data is distributed among different data centers in a multi-cloud environment based on cloud reliability and data sensitivity. In terms of security, current encryption algorithms are considered to be very efficient, but it requires a lot of resources to handle this, which is expensive and time consuming. In addition, they also make the data impossible to process without first decoding. To be specific, traditional public key encryption requires data to be decrypted before it can be analyzed or manipulated. In contrast, homomorphic encryption is an encryption method that allows data to be encrypted while it is being processed and manipulated. It allows user or a third party, which can be cloud provider, to apply functions on encrypted data without revealing the data's values. In this paper, we explore existing multi-cloud-based security solutions using homomorphic encryption to identify open issues and opportunities for further enhancement. [ABSTRACT FROM AUTHOR]

In this paper, we preliminarily propose the dissipative sliding mode control (SMC) scheme for polyhedral singular semi-Markov jump linear parameter varying (SS-MJLPV) systems considering deception attacks between the sensor and controller. The main feature of this scheme is that a novel developed parameter dependent integral-type SMC law follows the changes of the system. Note that the mode of the sliding mode controller is not synchronized with the system mode, and the transition rates (TRs) of the system are assumed to be unknown. Moreover, we extend the previous work concerning the static event-triggered transmission protocol (ETP) to the dynamic one, in which the triggering threshold is dynamically updated via the internal-dynamic-variable. Finally, a DC-motor model is presented to illustrate the correctness of the developed results. • A more practical mode-dependent and parameter-dependent AISMC scheme is proposed. • The MJLPV systems are modeled as polyhedron for the first time. • A novel dynamic ETP with an internal-dynamic-variable, parameter-dependent weighting matrices and communication delays is presented. [ABSTRACT FROM AUTHOR]

We constructed a cryptographic interaction method museum art exchange protocol (MAXP) for museum digital collections on the basis of blockchain technology. Using our method, we build a digital collection exchange system on Ethereum to realize the digital collection's online exchange between two museums. Compared with the traditional centralized collection digital resource database method, MAXP can avoid the security risks caused by subjective factors and force majeure factors in the exchange process of digital collections, such as hackers and network viruses. In our exchange system we have built, the expression of content covered by digital collections is more convenient, and copyright disputes can be quickly resolved. Concurrently, given the decentralization and anonymity of the blockchain, a regulatory mechanism has been added to MAXP to avoid fraud, illegal fundraising, money laundering and smuggling. The regulatory mechanism we constructed is a dual receiver public key encryption scheme based on the Diffie-Hellman algorithm and the SM2 elliptic curve public key encryption algorithm. The sender encrypts the collection data, and both receivers can decrypt the messages using their respective private keys. One of the receivers is the museum that obtained the collection information, and the other receiver is the regulator. These two receivers can decrypt simultaneously, and the regulator can regulate the information exchange on the blockchain. The Beijing Planetarium and the Beijing Museum of Natural History have completed the exchange of collections through the system we have built. The analysis results show that the regulatory scheme based on the exchange blockchain system of the museum's digital collections proves to be feasible, with security and expansibility. Our new encrypted exchange management method of digital collections in museums can effectively promote the exchange of collections between museums, and is of great significance to the promotion of cultural heritage and the dissemination of scientific knowledge. [ABSTRACT FROM AUTHOR]

Blockchain is current demanding technology in the field of data and information security. In this paper, we present a model of the data integrity assurance by the use of blockchain. Our proposed method, the message authentication code is stored under the block of blockchain with hash value, timestamp, and nonce. The existing message authentication code, SHA-256 is used to generate the hash value to store into the blockchain after encrypting by asymmetric key cryptography with recipient public key. We also compared the strength of our blockchain based data integrity assurance method with others existing method of integrity assurance and management. We have applied penetration testing by using five different tools to test the strength and robustness of proposed method of integrity assurance. It is found that blockchain based integrity assurance method is more robust than other methods of integrity assurance. [ABSTRACT FROM AUTHOR]

One of the critical goals of advanced cryptography is to protect data privacy. Although protecting sensitive data has always been essential, it has become much more due to the widespread use of cloud services. Conventional encryption schemes have one drawback: data must be decrypted before processing. Best practices have long recommended that data must be secured at rest and in motion when using public cloud services, i.e., we need encryption at the storage as well as at processing levels. Homomorphic encryption is an advanced cryptographic approach in which the processing of encrypted data is possible. In this paper, we have presented the insights required for understanding homomorphic encryption approaches. We examined and compared two partial homomorphic techniques, RSA and Pallier algorithm based on efficiency, base method, and homomorphic property. [ABSTRACT FROM AUTHOR]

The smart grid is an emerging power system that can realize the information exchange between users and power companies in two-way communication and adjust power companies' power supply according to the real-time power requests from smart meters on the users' side. However, since malicious attackers can eavesdrop on two-way communication to collect and transmit information, they may leak users' information. Therefore, this paper proposes a new certificateless blind signature (CLBS) scheme with batch verification function and improves a power request system model for the smart grid to protect users' privacy. In addition, the proposed CLBS scheme simplifies the certificate management process in the traditional public key cryptosystem and eliminates the hidden key escrow in the identity-based public key cryptosystem. The unforgeability of the scheme is proved through the random oracle model, and the scheme's security can be reduced to the intractability of the elliptic curve discrete logarithm problem (ECDLP). The analysis results show that our scheme does not use the time-consuming bilinear pairing operation, and has obvious advantages in computing performance compared with the existing signature schemes. [ABSTRACT FROM AUTHOR]

Image encryption is an effective method to protect private images by converting them into meaningless ones, but many current image encryption algorithms still have security and efficiency problems. This paper combines compressed sensing (CS) and secret image sharing (SIS) to propose a certifiable visually secure image selection encryption. Firstly, a selective encryption based on multi-task convolutional neural network (SE-MTCNN) is presented to distinguish and encrypt the sensitive and non-sensitive information of plain images. Subsequently, the SIS algorithm is used to decompose the resulting plain image into multiple shadow images to disperse the risk of cryptographic image loss and resist hacking attacks. Herein, a pseudo-convolutional sliding scrambling based on chaotic sequences driven by plaintext (PCSS-CSDP) is proposed to eliminate the correlation between adjacent image pixels. Finally, the IWT-M-embedding algorithm is used to embed shadow images into carrier images to get multiple visually meaningful cipher images. Additionally, a new authentication scheme based on bit-level cyclic shifts and dynamic combination (AS-BCSDC) is introduced, and the obtained authentication information is fused into cipher images to prevent the deception of illegal users and malicious tampering of cloud platform. Experiments demonstrate the effectiveness of our algorithm, and it may be applied for image secure communication. [ABSTRACT FROM AUTHOR]

A group signature allows a group member who signs the message on behalf of the other group members. Any recipient also verifies the signature without knowing the signer. However, it is possible to reveal the signer's identity since the group signatures have the tracing mechanism. In general, the group signature size increases the number of group members. However, the schemes are also proposed with the constant signature size. On the other hand, the security of some schemes are based on the discrete logarithm and factorization problems while some schemes which are secure against quantum attacks are proposed. To the best of our knowledge, the signature scheme in the group concept has not been proposed on lattices in quantum oracles. In this paper, we propose a new constant-size and partially-dynamic group signature scheme on lattice assumptions. We combine the Dilithium signature scheme, a Stern-like zero-knowledge scheme and Regev's encryption scheme. We give a zero-knowledge argument system for our proposed scheme and security analysis in the quantum random oracle model. According to the comparison results, the proposed scheme has better size complexity in asymptotic concept. [ABSTRACT FROM AUTHOR]

In the cloud storage environment, scholars have proposed data integrity auditing schemes to ensure the integrity of data in the cloud. In some scenarios, users may need to designate an auditor to perform auditing tasks, however, most existing cloud auditing schemes are not applicable. A small number of cloud auditing schemes with designated verifiers use PKI cryptography and identity-based cryptography, which has complex certificate management and key escrow problems. Therefore, based on the certificateless signature algorithm of the specified verifier, we construct an efficient certificateless provable data possession mechanism in the cloud with a designated verifier called CL-DV-PDP. Based on of meeting the above user's requirement, our scheme can also perform a batch audit of multi-user data at the same time. We use a dynamic hash table to dynamically update the cloud data and the scheme also supports privacy protection. We define the security model of the scheme in detail, and the security of the scheme is proved based on the CDH assumption under the random oracle model. In the efficiency analysis section, we compare the functions and computational costs of our scheme with the relevant references, the result shows that the functions of the scheme are comprehensive and our scheme is efficient. [ABSTRACT FROM AUTHOR]

Multi-signature is an important technology to compress multiple signatures on the common message into a compact one, thereby reducing the consumption of storage space and transmission bandwidth. Such a cryptographic primitive is widely used in financial applications such as blockchain which requires multiple keys to authorize a transaction. With the advent of quantum computers, traditional multi-signature schemes may no longer be secure as their underlying security assumptions (e.g. RSA or discrete logarithm problems) may not hold anymore. In this paper, we propose a novel identity-based multi-signature (IBMS) scheme over NTRU lattices, which is secure against the attacks of quantum computers. To the best of our knowledge, it is the first lattice-based IBMS scheme. We show that our scheme is provably secure in the random oracle model based on the ring version of the short integer solution assumption (Ring-SIS). Compared with the closely related works in the literature, our scheme enables the signer to select its system identity (such as email address, physical IP address, and etc.) as the public key, which effectively alleviates the certificate management problem in the PKI setting, and takes the advantage of discrete Gaussian distribution instead of uniform distribution to generate secret signing keys and multi-signatures. Besides, our scheme does not require all the system users to setup a trusted common string, which further simplifies the deployment of our scheme in practice. [ABSTRACT FROM AUTHOR]

Video prediction is extremely challenging in a traffic flow forecasting problem due to dynamic spatiotemporal dependence. Eidetic 3D convolutional long short-term memory (E3D-LSTM) network, a state-of-the-art video prediction model, proposes a gate-controlled self-attention module called recall gate in the LSTM mechanism to make the present memory state interact with its historical records for long-term relations. Instead of using the gate-controlled self-attention mechanism, we introduce a query-key-value self-attention mechanism into E3D-LSTM for long-term relations from the perspectives of algorithm (internal) and network architecture (external). As for the algorithm (internal) perspective, we replace the original recall gate inside the E3D-LSTM cell with a query-key-value self-attention (SA) module. While for the network architecture (external) perspective, we propose an independent residual query-key-value self-attention (RSA) block outside E3D-LSTM networks in conjunction with the original recall gate. In a traffic flow forecasting problem, we find that both the models from the internal perspective and the external one, named SAE3D-LSTM and RSA-E3D-LSTM, outperform E3D-LSTM and seven other baseline models on three traffic datasets. This validates the effectiveness of the query-key-value self-attention mechanism for long-term relations. Furthermore, we find that SAE3D-LSTM performs better than RSA-E3D-LSTM. This indicates that the query-key-value self-attention mechanism alone can capture long-term relations, dispensing with the gate-controlled self-attention mechanism. [ABSTRACT FROM AUTHOR]

Telehealth is an emerging model of delivering quality health to remote communities and stay-at-home users. This is motivated by the rising health care costs and by the benefits of many patients staying at home as opposed to extended hospital stays. Telehealth relies on IoT technology, but IoT devices present the weakest security link to the system. The challenge is to implement strong security capabilities in resource-limited IoT devices. This justifies the use of elliptic curve cryptography (ECC) over the other traditional and resource-consumed approaches such as RSA. Efficient modular multiplication is a basic operation needed for ECC systems. Therefore, the compact and efficient implementation of this operation will significantly affect the performance of ECC in resource-limited applications. This work presents a compact serial-in/serial-out word-based systolic implementation of modular multiplication. The proposed structure is derived using a formal and systematic technique for mapping regular iterative algorithms (RIA) onto processor arrays. The proposed methodology enables control of the processor array workload as well as the workload of each processing element. Controlling the processor word size allows control of system speed, latency, and area. The proposed processor structure saves area and energy consumption by a factor up to 96.3% and 98.5%, respectively. [ABSTRACT FROM AUTHOR]

The concept of Hierarchical Deterministic Wallet (HDW) was introduced by Wuille in Bitcoin Improvement Proposal 32 (BIP32). HDW enables an individual/organization to generate cryptographic keys and subsequently ease the key management problems (e.g., backup and recovery). Since the first HDW algorithm in 2012, HDW has gradually shown its fit for many promising use cases, such as Bitcoin-like cryptocurrencies, global key revocation in FIDO2 standard. In order to achieve all the features (i.e., deterministic derivation, master public key and hierarchy) and the security (i.e., safety of cryptocurrencies and privacy protection of users) requirements for HDW, Yin et al. (ESORICS 2022) conceptualized Hierarchical Deterministic Wallet supporting Stealth Address (HDWSA), and gave a provably secure construction from the standard Computational Diffie-Hellman Assumption. Unfortunately, the construction is not quantum-resistant. In this work, we propose the first HDWSA construction from lattices to fill this gap, we provide the security proof for the construction in the random oracle model (ROM) based on hard problems over lattices. Compared with existing works, to the best of our knowledge, our construction not only captures all the HDW features and security properties, but also provides the potential quantum resistance. [ABSTRACT FROM AUTHOR]

• A novel method for high-dimensional image encoding is proposed that uses two spatially separated polarization components of C-point vector beams. • The proposed approach harnesses the unique characteristics of light carrying spatially concatenated orthogonal states of optical vortices for image encoding. • The utilization of optical vortices associated with orbital angular momentum offers flexibility in terms of allowing for the selection of infinite integer values of topological charge. • Manipulation within two degrees of freedom of light is demonstrated through a non-interferometric experimental set-up employing dual-pass modulation approach. Considering the concern of efficient data handling in information security applications, we propose a novel method for high-dimensional image encoding onto two spatially separated polarization components of C-point vector beams. These beams, known for their spatially varying polarization distribution are generated by the superposition of different magnitude of optical vortex modes modulated into orthogonal polarization basis. Our approach harnesses the unique characteristics of light carrying spatially concatenated orthogonal states of optical vortices for image encoding unlike traditional optical cryptosystems that rely on the spatial distribution of amplitude, phase, and polarization of light. Through the superposition of phase holograms corresponding to images encoded within both the polarization components, each exhibits distinct magnitudes of optical vortex modes at each pixel. The proposed approach allows for secure image encryption into C-point vector beams. The utilization of optical vortices associated with orbital angular momentum offers flexibility in terms of allowing for the selection of infinite integer values of topological charge. This versatility inspires us to encode image using an array of vortices, thereby ensuring stable encoding and minimize quality degradation in practical implementations. Furthermore, exploiting the two orthogonal polarization components of light enhances high-dimensional encoding, offering a solution to the 'capacity crunch' issue in secure optical communication systems. Manipulation within two degrees of freedom of light is demonstrated through a non-interferometric experimental set-up employing dual-pass modulation approach which simplifies vector beam generation. [ABSTRACT FROM AUTHOR]

Recently, Sahoo et al. introduced a three-factor authentication scheme for Wireless Sensor Networks (WSNs) based on an elliptic curve cryptosystem. Nonetheless, upon closer examination, we have identified critical vulnerabilities in their scheme, including susceptibility to user impersonation, gateway impersonation, sensor node impersonation attacks, and a breach in the three-factor security aspect. Further, the scheme fails to withstand offline sensor node identity guessing attacks, man-in-the-middle attacks, and known session-specific temporary information attacks. Intending to elevate both security and efficiency, we propose a novel three-factor authentication scheme that capitalizes on the strengths of a fuzzy extractor and a cryptographic one-way hash function. The proposed scheme's security has been rigorously assessed using the SCYTHER tool, confirming its validity under the real-or-random (ROR) model. Moreover, a heuristic analysis exemplifies that the scheme effectively withstands various known cryptographic attacks. Consequently, the performance comparisons establish the superiority of our scheme over related approaches in terms of security and efficiency. Additionally, its suitability for WSNs is evident due to the minimal overhead on the sensor nodes, making it a highly promising solution for real-world implementation. [ABSTRACT FROM AUTHOR]

Preserving the confidentiality and integrity of data transmission is paramount in the Internet of Things (IoT)-based healthcare systems. Current encryption techniques that allow plaintext checks primarily serve a specific cryptosystem, lacking the adaptability to work with a diverse system incorporating various cryptographic methods. To address this, we present a unique online/offline heterogeneous signcryption scheme with plaintext checkable encryption (HOOSC-PCE). This approach enables the transition of signcrypted messages from an identity-based cryptosystem (IBC) to a public key infrastructure (PKI) system, improving information interoperability. A key aspect of our scheme is its capacity to allow cloud servers to perform plaintext queries, facilitating efficient data searches using plaintext keywords over encrypted data. Furthermore, the signcryption process is divided into online and offline phases. The online phase handles tasks that require fewer resources, while the offline phase carries out more resource-intensive preparatory tasks. We rigorously tested the HOOSC-PCE scheme's security by proving it secure under the Random Oracle Model (ROM). Meanwhile, compared to similar work, it effectively reduces computation costs by 46.39%, 19.45%, 18.73%, and 13.25% across offline encryption, online encryption, decryption, and search algorithms. The results indicate that the HOOSC-PCE is secure and efficient, confirming its feasibility for IoT-based healthcare systems. [ABSTRACT FROM AUTHOR]

With the popularity of cloud computing, a large number of personal and corporate data are outsourced to the cloud. This centralized storage and processing mode not only improves the efficiency of data processing, but also brings challenges to data security and privacy. In view of the development of quantum computing, the traditional public key encryption may no longer be secure in the future. Therefore, it is particularly important to study the public key authenticated keyword searchable encryption (PEAKS) scheme which can resist quantum. This scheme can provide double guarantee for the data in cloud storage: one is to ensure the confidentiality of the data, so that the original content cannot be decrypted even within the cloud service provider; the other is to allow users to perform keyword searches on encrypted data without decrypting the data. This provides a balance of security and efficiency for data search and analysis in cloud computing environment. Recently, Genise et al. designed a Gadget-based iNTRU trapdoor, which has the advantages of small size and high efficiency. Therefore, we design an efficient and secure public key authentication keyword searchable encryption scheme based on iNTRU lattice. The overall running time of this scheme is only more than 300ms. • A secure and efficient public key authentication keyword searchable encryption. • The scheme is based on the inhomogeneous NTRU problem. • The scheme is implemented quickly based on palisade library. • The design again verifies that there is some similarity between NTRU and R-LWE. [ABSTRACT FROM AUTHOR]

Key-Aggregate Searchable (KASE) can enable a data owner to delegate search rights over a set of data files to multiple users through a single aggregated authorization key in multi-user data sharing environments. Despite the elegance of the KASE concept, designing a KASE scheme that simultaneously prevents authorization from being abused and resists offline keyword guessing attacks is a formidable challenge. To respond the challenge, we propose a secure Key Aggregation Keyword Searchable Encryption against Keyword Guessing Attack and Authorization Abuse (KASE-AKA) scheme. Compared with existing KASE schemes, our KASE-AKA scheme has the following merits: (1) supporting dynamic update of user data search right through a user data search right list maintained by the semi-trust cloud server. (2) preventing the authorization from being abused since the authorization key (aggregate key) associates the user's public key, a subset of access rights, and a common secret value that only the cloud and data owner can collaboratively generate. (3) providing resistance against offline keyword guessing attacks. Correctness proof, security analysis and performance evaluation demonstrate that the proposed KASE-AKA scheme is provably secure, highly efficient and more feasible in practical application scenarios. • Designing a new KASE security model that captures three types of security attacks. • Supporting dynamic updates of user data search right. • Preventing the authorization from being abused. • Providing formal security analysis and the prototype implementation. [ABSTRACT FROM AUTHOR]

Oblivious polynomial evaluation (OPE) constitutes a crucial element in various two-party computation protocols, including private set intersection, data mining, and oblivious keyword search. Consequently, the development of an efficient OPE protocol is of paramount significance. Leveraging the homomorphic properties of encryption algorithms offers an effective avenue for constructing such a protocol. In this paper, we propose an elliptic code-based symmetric homomorphic encryption scheme that incorporates concepts introduced by Armknecht et al. We also provide parameter selection tailored to various security levels. This encryption scheme accommodates arbitrary additions and a finite number of multiplication operations. Expanding on our encryption scheme, we introduce three practical and straightforward OPE protocols that are fully compatible with our encryption framework. We complement these protocols with a comprehensive security analysis. Our protocols not only achieve a high level of security but also exhibit efficiency, requiring only two message transmissions for the entire OPE process. Furthermore, our protocols can concurrently compute function values at multiple evaluation points, whether for distinct functions or the same function. • We construct a symmetric homomorphic encryption scheme using elliptic codes. • Our scheme supports any number of additions and a finite number of multiplications. • We construct several efficient OPE protocols. [ABSTRACT FROM AUTHOR]

Load fluctuation in the gas system typically causes the change of node pressures and pipeline flow rates, which may further lead to energy shortages or even security incidents. In order to accurately evaluate the gas supply security, a Gas Dynamic Security Region (GDSR) concept along with its construction method is proposed in this study. Firstly, the definition of GDSR is given considering both the dynamic characteristics and security constraints of the gas system. Then, a critical point sampling method based on the load increase direction is designed, where the uniform distribution of critical points on the Gas Dynamic Security Region Boundary (GDSRB) is ensured by deploying the multi-dimensional sphere sampling technique. Next, a piecewise fitting method based on the neighborhood least square technique is employed to precisely fit the GDSRB. In order to provide a rigorous mathematical foundation for its practical application, the existence of the GDSR is strictly proved based on the critical point existence theorem and the boundary closure theorem. The following experimental results conducted on a typical gas system verify the effectiveness of the proposed GDSR construction method and illustrate that GDSR can ensure the energy supply security of the single or integrated system in the load response. In addition, the practicability of the GDSR is demonstrated by its implementation in an iron and steel plant in China which also indicates that the shape and position of the GDSR are closely related to the initial working conditions. • The definition and construction method of GDSR are proposed considering the dynamic characteristics and security constraints. • A critical point sampling method based on load increase direction is designed to explore critical points. • A piecewise fitting method based on neighborhood least square is developed to describe the GDSRB. • The existence of GDSR is rigorously proved by mathematical theorems to guarantee GDSR's practical application. [ABSTRACT FROM AUTHOR]

In cloud computing, the current challenge lies in managing massive data, which is a computationally overburdened environment for data users. Outsourced computation can effectively ease the memory and computation pressure on overburdened data storage. We propose an outsourced unbounded decryption scheme in the standard assumption and standard model for large data settings based on inner product computation. Security analysis shows that it can achieve adaptive security. The scheme involves the data owner transmitting encrypted data to a third-party cloud server, which is responsible for computing a significant amount of data. Then the ripe data is handed over to the data user for decryption computation. In addition, there is no need to give the prior bounds of the length of the plaintext vector in advance. This allows for the encryption algorithm to run without determining the length of the input data before the setup phase, that is, our scheme is on the unbounded setting. Through theoretical analysis, the storage overhead and communication cost of the data users remain independent of the ciphertext size. The experimental results indicate that the efficiency and performance are greatly enhanced, about 0.03S for data users at the expense of increased computing time on the cloud server. [ABSTRACT FROM AUTHOR]

The security of Personal Health Records (PHRs) within the Internet of Medical Things (IoMT) infrastructure is a pressing issue in the healthcare sector. Edge-based IoMT devices like smart wearables and implantables often acquire PHRs. Cloud computing plays a vital role in handling computing and storage tasks for edge-based IoMT devices. However, concerns about trust with cloud servers require the use of encryption, which may complicate the retrieval of encrypted PHRs from the cloud. This paper presents certificateless public key encryption with plaintext-checkable encryption (CL-PKE-PCE). CL-PKE-PCE enables searching for encrypted data using plaintext keywords while eliminating key escrow and certificate management issues. The CL-PKE-PCE scheme facilitates the verification of ciphertexts against plaintexts without the need for decryption, thereby maintaining data privacy. Furthermore, the security of the proposed CL-PKE-PCE scheme has been substantiated under the bilinear Diffie–Hellman assumption. Compared to similar work, it efficiently lowers calculation costs for encryption, decryption, and search algorithms by 63.66%, 51.17%, and 61.62%, respectively. The findings demonstrate that the CL-PKE-PCE is simultaneously secure and efficient, affirming its suitability for edge-based IoMT scenarios. [ABSTRACT FROM AUTHOR]

We present an adaptively secure identity-based encryption (IBE) scheme with constant sized parameters and constant security loss in multi-instance multi-ciphertext (MIMC) setting in prime-order groups, in the random oracle model. We then further construct an adaptively secure hierarchical identity-based encryption (HIBE) scheme with shorter sized parameters and constant security loss in the MIMC setting in prime-order groups, in the random oracle model. At the core of our technique, we observe that the pseudorandomness property of the random oracle matches the conditions of Left Subgroup Indistinguishability (LS) and Right Subgroup Indistinguishability (RS) in dual system groups (DSG) well, so that we can transform the queried secret keys and the challenge ciphertexts for once. We construct our IBE scheme from Agrawal and Chase's work (CCS 2017) and construct our HIBE scheme from Boneh et al.'s work (Eurocrypt 2005). As a byproduct of our IBE scheme, we construct a new DSG instantiation from Chen et al.'s work (Eurocrypt 2015) under bi-MDDH assumption. [ABSTRACT FROM AUTHOR]

Today's Internet of Vehicles (IoV) faces many security risks in the data transmission process, and image data is more vulnerable to security threats in the transmission process due to its special characteristics such as large amounts of information and high visibility. Therefore, to guarantee the dependability of data transmission in the IoV environment, this paper designs a blind signature scheme for IoV based on two-dimensional sine cosine cross-chaotic mapping (2D-SCML) image encryption and lattice cipher (BSS-IoV). The innovation of this scheme is that it aims at blind signature of image information, blinds it before sending the information, and combines the lattice public key encryption algorithm to better ensure the safe and reliable transmission of information and reduce the risk of information disclosure. To further ensure the security of the scheme, an image encryption algorithm based on 2D-SCML and pixel splitting (2PS-IEA) is proposed, which is used to blind the information and thus reduce the risk of information leakage on the one hand, on the other hand, it is used in the signature process to ensure the security of the signed information. The 2D-SCML is derived from the cross-model structure proposed in this paper. Through simulation results and experimental analysis, the values of NPCR and UACI, respectively, 99.6094% and 33.4635%, are close to ideal values. And 50% of the cut image can also recover the rough information, which indicates that the signature scheme has the security against differential attacks, cut attacks and noise attacks. Moreover, the security analysis shows that the scheme has the anti-tamper, anti-repudiation and traceability. • Designed blind signature scheme for IoV using image encryption and lattice cipher. • Proposed a crossover model structure is proposed. • Designed a 2D-SCML mapping with superior performance based on this model. • Devised an image encryption algorithm based on 2D-SCML and pixel splitting. • The signature scheme and encryption scheme are analyzed experimentally. [ABSTRACT FROM AUTHOR]

This paper focuses on the RSA-polynomial problem, a cryptographic hard problem that has been recently proposed and studied in, along with its various applications. We revisit this problem and conduct a refined analysis to address an ambiguous condition that was previously introduced in the context of RSA-polynomial based semiprime factorization. By deriving an accurate attack condition, we are able to identify weak cases of the RSA-polynomial problem and expand the vulnerable bound. To facilitate this, we propose two optimized factoring attacks that leverage improved lattice-based theorems for solving bivariate integer polynomials of a specific form. The validity and effectiveness of our proposed factoring attacks are verified through both theoretical analysis and experimental results. Additionally, we examine the RSA-polynomial based commitment scheme and identify deficiencies that compromise its reliability. To address the limitations, we propose enhancements to the commitment phase of the scheme. [ABSTRACT FROM AUTHOR]

This paper proposes the concept of drive–response asymptotic shape synchronization for two-dimensional chaotic systems and its application in image encryption. It overcomes the limitations of traditional shape synchronization, eliminates the restrictions on the drive system's continuous differentiability, and the response system's specific format, while simplifying the controller design, thereby demonstrating enhanced applicability and ease of implementation. Moreover, based on the characteristics of asymptotic shape synchronization, we propose a novel image encryption scheme. In this scheme, the drive and response systems, initialized with distinct values, achieve identical chaotic attractors through rotation and translation parameters in rigid transformation, which are utilized for encryption and decryption processes, respectively. Our encryption algorithm employs DNA coding to construct a DNA plane and incorporates the concept of Rubik's cube rotations for scrambling and diffusion. Experimental simulations and performance analysis verify the effectiveness of the proposed encryption scheme in withstanding various attacks, ensuring a high level of security. • Proposing the concept of chaotic asymptotic shape synchronization. • Proposing rigid transformations for achieved synchronization control. • Enhanced image encryption using DNA encoding and the above methods. • Streamlined controller structure compared to the author's previous work. [ABSTRACT FROM AUTHOR]

The advent of cloud computing has made cloud server outsourcing increasingly popular among data owners. However, the storage of sensitive data on cloud servers engenders serious challenges for the security and privacy of data. Public Key Authenticated Encryption with Keyword Search (PAEKS) is an effective method that protects information confidentiality and supports keyword searches. Identity-Based Authenticated Encryption with Keyword Search (IBAEKS) is a PAEKS variant in identity-based settings, designed for solving the intractable certificate management problem. To the best of our knowledge, only two IBAEKS schemes exist in the literature, both presented with weak security models that make them vulnerable against what is known as Fully Chosen Keyword attacks. Moreover, the existing IBAEKS schemes are based on the time-consuming bilinear pairing operation, leading to a significant increase in computational cost. To overcome these issues, in this paper, we first propose an enhanced security model for IBAEKS and compare it with existing models. We then prove that the existing IBAEKS schemes are not secure in our enhanced model. We also propose an efficient pairing-free dIBAEKS scheme and prove that it is secure under the enhanced security model. Finally, we compare our proposed scheme with related constructions to indicate its overall superiority. [ABSTRACT FROM AUTHOR]

Recently, Gong et al. proposed a Certificateless Aggregate Signature (CLAS) scheme (shorted by PCAS) with conditional privacy-preserving without bilinear pairing for Vehicular Ad-hoc Networks (VANETs). Unfortunately, after analyzing security, the PCAS scheme fails to satisfy the necessary unlinkability in VANETs and is vulnerable to the public key replacement forgery attack of the Type-I adversary. Subsequently, this article analyzes the causes of these two security issues in detail and proposes an improved CLAS scheme for VANETs (called IPCAS). Through security analysis, this article proves that the IPCAS is existentially unforgeable under the adaptive chosen message attacks against Type-I and Type-II adversaries in the random oracle model, and satisfies the necessary security and privacy requirements in VANETs, including unlinkability. Finally, the performance analysis results show that compared to PCAS for single message and n aggregate messages (n = 1000) , the computational overhead of IPCAS is reduced by 20.01% and 49.08% respectively, and the communication overhead is reduced by 18.75% and 28.14% respectively. Therefore, IPCAS not only makes up for the security vulnerabilities of PCAS but also has better performance. [ABSTRACT FROM AUTHOR]

The Internet of Vehicles (IoV) provides various services to vehicles through information sharing to ensure road safety and improve traffic efficiency. However, malicious attackers can challenge the privacy and security systems of the IoV by conducting security attacks. Currently, many schemes use bilinear pairing or elliptic curves to construct authentication systems, ensuring anonymity of vehicle identities and message security. However, these schemes suffer drawbacks such as low computational efficiency and high communication overhead in highly dynamic IoV. Therefore, we propose a new efficient certificateless message authentication scheme. The proposed scheme constructs a lightweight security authentication protocol by improving the RSA dynamic accumulator and combining it with non-interactive discrete logarithm zero-knowledge proofs. In addition, our scheme eliminates the need for bilinear pairing operations, thereby reducing computational overhead. Simultaneously, it enables real-time tracking and revocation of malicious vehicle identities. Security analysis shows that our scheme can be reduced to a secure S-RSA assumption under the random oracle model, meeting various security requirements of the IoV. Performance analysis shows that our scheme diminishes not only the computational overhead but also the communication overhead. [ABSTRACT FROM AUTHOR]

With the advancement of remote sensing technology, the amount of remote sensing image (RSI) has increased sharply. The explosion in data volume requires higher standards of image compression and encryption technology. This paper proposes a lossless and lossy encryption-compression method for RSI. Because RSIs contain important and unimportant information, using a normal algorithm could ignore their important information or reduce the computational efficiency, so we use the trained model by DeepLabv3+ to segment the region of interest (ROI) and the region of non-interest (RONI), and implement lossless and lossy algorithms respectively. The whole algorithm is based on the newly proposed hyperchaotic system 2D Tent coupled Infinite collapse map (2D TICM). According to the 2D TICM, the dynamic 3D Latin cube is generated. This cube is then used for dynamic scrambling algorithms between multiple planes (3D LMBS), within planes (3D LMIS), and for the multiple dynamic S boxes substitution algorithm. Due to the large size of RSI, the image is divided into blocks, and MATLAB parallel mechanism is used to encrypt each block at the same time. First, the lossy part is scrambled by 3D LMIS, then compressed with 2D compressive sensing (2D CS). Finally, each block is substituted with a different S box. A CS reconstruction algorithm combining decryption and reconstruction, 2D projection gradient chaotic decryption algorithm (2D PG-CD), is proposed. The lossless part embeds the encryption into JPEG-LS, encrypts while compressing, and then encrypts according to 3D LMBS and S boxes. The algorithm in this paper considers the characteristics of RSI, experiments show that it has good security and compression performance. • A hyperchaotic system 2D Tent coupled infinite collapse map (2D-TICM) is proposed. • Lossy compression 2D CS and 2D PG-CD improves the computational efficiency. • Encryption step is integrated into JPEG-LS and compression to retain important information. • Dynamic 3D Latin cube is designed with chaos and multiple S boxes substitution are proposed. [ABSTRACT FROM AUTHOR]

As cloud computing has developed rapidly, outsourcing data to cloud servers for remote storage has become an attractive trend. However, when cloud clients store their data in the cloud, the security and privacy of cloud data would be threatened due to accidental corruptions or purposive attacks caused by a semi-trusted cloud server. The widely used method of addressing the security and privacy of cloud data is to store encrypted data instead of plain data. As the resulting system is unusable, since the cloud can no longer search throughout the data, new cryptographic primitive such as public-key encryption with equality test (PKEET) has been introduced. PKEET has many interesting applications such as keyword search on encrypted data, encrypted data partitioning for efficient encrypted data management, personal health record systems, spam filtering in encrypted email systems and so forth. PKEET allows checking whether two ciphertexts encrypted under different public keys contain the same message or not. However, unrestricted access to equality tests can reveal information about the underlying data. This is not acceptable in respect of users' privacy. In 2015, Ma et al. introduce the notion of PKEET with flexible authorization (PKEET-FA) which strengthens privacy protection. Since 2015, there are several follow-up works on PKEET-FA. However, all are secure in the random oracle model and vulnerable to quantum attacks. In this paper, we provide two constructions of quantum-safe PKEET-FA secure in the standard model based on the hardness assumptions of integer lattices and ideal lattices. Finally, we implement the PKEET-FA scheme over ideal lattices. [ABSTRACT FROM AUTHOR]

The concept of puncturable encryption (PE) was introduced by Green and Miers at IEEE S&P, 2015. PE allows recipients to update their decryption keys to revoke decryption capability for selected messages without communicating with senders. From the first instantiation, PE shows its essence for many interesting applications, such as asynchronous messaging systems, group messaging systems, public-key watermarking schemes, secure cloud emails, and many more. To eliminate the necessity of having a costly certificate verification process, Wei et al. introduced puncturable identity-based encryption (PIBE) at ESORICS, 2019. Unfortunately, till today, there is no PIBE , which can withstand quantum attack. In this paper, we aim to fill this gap in the literature by presenting the first constructions of PIBE , for both selective and adaptive identity, which are secure in the standard model based on the hardness of learning with errors problem. Finally, we extend the design idea of selectively secure PIBE to provide the first construction of lattice-based puncturable key-policy attribute-based encryption (KP - PABE), which can facilitate fine-grained access mechanism with decryption revocation. Design ideas of proposed constructions can, also, be useful to construct other lattice-based expressive PE. [ABSTRACT FROM AUTHOR]

Encrypted control has been introduced to protect controller data by encryption at the stage of computation and communication, by performing the computation directly on encrypted data. In this article, we first review and categorize recent relevant studies on encrypted control. Approaches based on homomorphic encryption, multi-party computation, and secret sharing are introduced, compared, and then discussed with respect to computational complexity, communication load, enabled operations, security, and research directions. We proceed to discuss a current challenge in the application of homomorphic encryption to dynamic systems, where arithmetic operations other than integer addition and multiplication are limited. We also introduce a Learning With Errors based homomorphic cryptosystem called "Gentry-Sahai-Waters" scheme and discuss its benefits that allow for recursive multiplication of encrypted dynamic systems, without use of computationally expensive bootstrapping techniques. [ABSTRACT FROM AUTHOR]

The smart home usually has poor security and is vulnerable to attack since it adopts embedded processors that are limited by volume and power consumption. To improve the communication security of the smart home system, identity-based signature schemes are widely used in wireless network communications. However, the user's signature private key is generally stored in a single device, it is easy to be stolen by attackers to control the smart home devices. To reduce the risk of leakage of the signature private key, a two-party collaborative signature scheme based on the SM9 algorithm is proposed in this paper. The user's signature private key is generated through the collaboration of the two-party key generation center (KGC), and the integer secrets related to the signature private key are stored in two devices respectively. During the signing process, the two devices sign collaboratively to prevent the complete private key from being leaked. The security of the scheme is proved in the random oracle model. Theoretical analysis and experimental results show that our proposed scheme can achieve higher security with lower computation cost and communication cost when compared with the existing two-party SM9 signature schemes. [ABSTRACT FROM AUTHOR]

Blockchain stores a series of transactions in form of a sequence of linked blocks. Hence, the concept of a single decentralized ledger is easily maintained. Transactions and interactions that take place among the participants accessing the distributed and decentralized but cooperative blockchain network are held through a single ledger. A student information system (SIS) can make use of a decentralized, reliable, and highly trusted ledger that stores vital information. Traditional education systems encounter problems such as centralized record keeping where fault tolerance depends on a single cloud provider; not to mention locally hosted databases. The implementation of blockchain in the education sector provides a new horizon for set of non-functional requirements including but not limited to: security, immutability, independence from the institution, immutability of official records and certificates. In addition, total trust in the accuracy and infallibility are all gathered in the decentralized ledgers of blockchain. The proposed models emphasize on the data availability; represented in students' ability to access all of their data at any time. This paper proposes three models for using blockchains to implement fully functional SIS that maintains transactions such as students' and faculty members' records, course registration records and student marks. In addition, avoiding the role of a super administrator or a centralized exposed store where data integrity is vulnerable. Using the proposed models pushes towards an electronic community where genuine certificates can be easily issued and published to the interested parties without the need for involving a centralized administration. [ABSTRACT FROM AUTHOR]