Search

In today's interconnected world, safeguarding digital data's confidentiality and security is crucial. Cryptography and steganography are two primary methods used for information security. While these methods have diverse applications, there is ongoing exploration into the potential benefits of merging them. This review focuses on journal articles from 2010 onwards and conference papers from 2018 onwards that integrate steganography and cryptography in practical applications. The results are gathered through different databases like Scopus, IEEE, and Web of Science. Our approach involves gaining insights into real-world applications explored in the existing literature and categorizing them based on domains and technological areas. Furthermore, we comprehensively analyze the advantages and limitations associated with these implementations, examining them from three evaluation perspectives: security, performance, and user experience. This categorization offers guidance for future research in unexplored areas, while the evaluation perspectives provide essential considerations for analyzing real-world implementations. [ABSTRACT FROM AUTHOR]

Recently, a robust steganographic algorithm that achieves errorless robustness against JPEG recompression has been proposed. The method employs a lattice embedding scheme and utilizes the syndrome-trellis code (STC) for practical embedding. However, we have noticed that errorless robust embedding with STC may encounter failures due to modifications on wet coefficients, especially when a high quality factor is used by the compression channel. To solve this problem, we have discovered that using steganographic polar code (SPC) for embedding has better performance in avoiding modifications on wet coefficients. In this paper, we conduct theoretical analysis to prove the better performance of SPC in wet paper embedding. We establish the condition of avoiding modifications on wet coefficients, followed by presenting a recursive calculation method for determining the distribution of columns in the generator matrix of SPC. The findings reveal that SPC can avoid modifications on wet coefficients under a larger number of wet coefficients compared with STC, and therefore we propose a better errorless robust embedding method employing SPC. The experimental results demonstrate that under close security performance, the proposed method achieves a higher success rate compared with embedding with STC. Specifically, when the quality factor of the compressor is 95 and the payload size is 0.4 bpnzac, our method achieves a success rate of 99.85%, surpassing the 91.95% success rate of the embedding with STC. [ABSTRACT FROM AUTHOR]

In this article, a new and improvised image watermarking (IW) technique on colored images is proposed to mitigate robustness and imperceptibility issues found often in the past presented schemes. Most schemes exhibit low robustness due to LSB's (Least Significant Bit) and MSB's (Most Significant Bit) based information hiding in the cover image. However, most of these IW schemes have low imperceptibility as the cover image distortion reveals to the attacker due to information hiding in MSB's. Such IW schemes used to hide the secret message via MSBs and LSBs are susceptible to malicious intruder attacks which results in low robustness, whereas, the attacks on MSB's have an impact of reduced imperceptibility. Therefore, this paper propounds a digital IW method named as 2D Otsu algorithm, which allows embedding of a grayscale image into a colored host in the wavelet domain. According to this algorithm, the host image is disintegrated into three color bands of blue, red, and green. Each band is divided into small patches leading to the calculation of entropy followed by finding of the threshold that is estimated by taking the average of entropies of all the patches. Wavelet representation of each patch with entropy less than the threshold is given by applying DWT (Discrete Wavelet Transform). Later, by decomposing gray-scale image into binary bits, secret information embedded by quantization technique into optimal wavelet coefficient blocks either encoding wavelet coefficient differences to 0-bits or 1-bits called MultiBit Encoding (MBE). The results obtained show that the imperceptibility and robustness of this proposed model are superior to other proposed watermarking models and this model gives better results than other models at the same payload. [ABSTRACT FROM AUTHOR]

As communication capabilities of mobile devices continue to advance, ensuring reliability and security has become increasingly crucial. The aerial tracking system presented in this paper provides a useful solution for tracking and tracing objects in various scenarios. To ensure reliability and security, the system incorporates appropriate mechanisms, including Lightweight Cryptography, to prioritize confidentiality and integrity. The Android component of the system has two modes of operation: Tracker Mode, running on a smartphone mounted on a drone (RPA), and Client Mode, running on mobile devices on the ground. In Client Mode, users transmit their positioning and trajectory information via Bluetooth Low Energy beacon mode, which is then relayed to the server backend via the 4G/5G network once the RPA enters an area with coverage. The system provides a reliable and secure solution for situations where tracking and tracing are essential, such as the supervision and control of public areas with capacity control or tracking and localizing people in isolated environments. [ABSTRACT FROM AUTHOR]

Recently, many image encryption algorithms have been proposed. Part of them failed to pass the cryptanalysis test and were found to be unsecure. Some others were more secure and could resist the known cryptanalysis methods. Many of those recent schemes followed a well-known model that consists of encrypting the image's pixels using a variety of techniques and methods. Many algorithms were claimed to be secure and performant to be used in real applications. This paper investigates this claim by performing a comparative analysis between a chaotic algorithm recently proposed and the standard general purpose AES cryptosystem in a web application context. The experimental tests conducted on both algorithms in this paper proved that the pixel-wise algorithms are not suitable for this kind of applications. [ABSTRACT FROM AUTHOR]

We study the application of Hamming codes to wet paper steganography. To that end, we propose the use of decoding algorithms that do not verify the minimum distance property and present one of these algorithms. We study its properties and show results of some numerical experiments. [ABSTRACT FROM AUTHOR]

This review paper explores the use of optimization techniques in steganography, the art of hiding secret information within other data. Steganography is a field that has gained significant attention in recent years due to the increasing need for secure communication and data protection. Optimization techniques have been shown to be effective in improving the performance of steganography systems, particularly in terms of maximizing the amount of secret data that can be hidden while minimizing the impact on the cover data. This paper provides a comprehensive overview of the state-of-the-art optimization techniques in steganography, including genetic algorithms, particle swarm optimization, ant colony optimization and fruit fly optimization algorithm. This paper also discusses the advantages and limitations of these techniques and their potential for further development in the future. Also the state-of-the-art methods were compared in terms of PSNR (Peak Signal to Noise Ratio), payload capacity, SSIM (Structured Similarity Index) etc. The review concludes by highlighting the importance of optimization techniques in steganography and their potential impact on the development of more efficient and secure steganography systems. [ABSTRACT FROM AUTHOR]

This paper intends to contribute to the emerging literature on the ethical problems posed by quantum computing and quantum technologies in general. The key ethical questions are as follows: Does quantum computing pose new ethical problems, or are those raised by quantum computing just a different version of the same ethical problems raised by other technologies, such as nanotechnologies, nuclear plants, or cloud computing? In other words, what is new in quantum computing from an ethical point of view? The paper aims to answer these two questions by (a) developing an analysis of the existing literature on the ethical and social aspects of quantum computing and (b) identifying and analyzing the main ethical problems posed by quantum computing. The conclusion is that quantum computing poses completely new ethical issues that require new conceptual tools and methods. [ABSTRACT FROM AUTHOR]

Around the world, the educational system is evolving. The new trend can be found in traditional classroom systems as well as digitalization systems. Cloud-based Learning Management Systems (LMS) will accelerate the educational industry forward in the next years because they can provide end—user with a versatile, convenient, secure, and cost-effective learning process. The cloud-based LMS approach is the most effective and proper learning model in the worldwide educational sector, particularly if the organization is in a state of depression owing to a global pandemic. It can be utilized over the internet with several users on the same platform. As a result, the initial requirement is important to enable to the LMS model. Despite its many advantages, LMS confronts challenges such as confidentiality, user acceptance, and traffic. In a pandemic like Covid 19, the entire planet depends on a safe LMS platform to establish student and instructor trust. Therefore, with this work, the attempt has been made to explain one LMS model that may provide its users with optimal security, a user-friendly environment, and quick access. This paper discusses the use of the cloud attack, and also cryptographic and steganographic security models and techniques to address these issues. There's also information on what kinds of security vulnerabilities or operations on cloud data are feasible, and also how to deal with them using various algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of communication technology, the optimization of communication protocol, as a new generation of intelligent traffic system technology, has attracted more and more attention, in particular, the communication technology in traffic. In the authentication protocol of this paper, the symmetric cipher algorithm ZUC and the asymmetric cryptographic algorithm RSA are used as the cryptographic algorithms of the protocol. RSA is used to decrypt digital signatures for messages. In the current communication scheme, node communication does not have scalability and communication requirements in different scenarios, and a population key negotiation communication protocol was proposed in this paper. Employing the kana and random key parameters of the nodes in the roadside cell group, 3 communication protocols for group broadcasting, group to vehicle communication, and RSU communication between groups were designed. The results show that the protocol can meet the security requirements of network communication. The results show that the communication protocol in this paper is safe and reliable. At last, the communication efficiency of communication protocol is analyzed using communication overhead and average delay. The proposed protocol is an efficient communication protocol and the scheme is superior to other schemes in terms of communication overhead and average delay. [ABSTRACT FROM AUTHOR]

Graph representation learning has made significant strides in various fields, including sociology and biology, in recent years. However, the majority of research has focused on static graphs, neglecting the temporality and continuity of edges in dynamic graphs. Furthermore, dynamic data are vulnerable to various security threats, such as data privacy breaches and confidentiality attacks. To tackle this issue, the present paper proposes a data security detection method based on a continuous-time graph embedding framework (CTDGE). The framework models temporal dependencies and embeds data using a graph representation learning method. A machine learning algorithm is then employed to classify and predict the embedded data to detect if it is secure or not. Experimental results show that this method performs well in data security detection, surpassing several dynamic graph embedding methods by 5% in terms of AUC metrics. Furthermore, the proposed framework outperforms other dynamic baseline methods in the node classification task of large-scale graphs containing 4321477 temporal information edges, resulting in a 10% improvement in the F1 score metric. The framework is also robust and scalable for application in various data security domains. This work is important for promoting the use of continuous-time graph embedding framework in the field of data security. [ABSTRACT FROM AUTHOR]

Since the advent of Bitcoin, cryptocurrencies have gained substantial popularity, and crypto wallets have evolved into the predominant tool for safeguarding and managing cryptographic keys to access cryptocurrency funds. Deterministic wallets are proposed as an advanced wallet mechanism to provide benefits such as low-maintenance, easy backup and recovery, and support for functionalities required by cryptocurrencies. Alkeilani Alkadri et al. (ACM CCS'20) presented the first post-quantum secure deterministic wallet scheme, but it exhibits a gap to bridge before achieving practical applicability, as reflected in both their concrete parameters size and computational efficiency. In this paper, we propose an efficient post-quantum secure deterministic wallet scheme. In particular, we present a new construction method for deterministic wallets, prove the security in the quantum random oracle model, and provide an efficient instantiation. The comparison result, with the work of Alkeilani Alkadri et al. (ACM CCS'20), shows our work has a comprehensive improvement on efficiency, e.g., the pk size is ≈ 40.7 times shorter, sk is ≈ 9.2 times shorter, and the signing time is ≈ 3.1 times faster. [ABSTRACT FROM AUTHOR]

Recommender systems have been widely used for implementing personalised content on many mobile online services to reduce computational overload and preserve wireless data for users. The underlying mechanisms used for building recommender systems analyse data collected from users to make recommendations. This poses concerns over the privacy of data from users as both service providers and the cloud will have access. Privacy-preserving recommender systems protect user information by incorporating various cryptographic mechanisms to prevent accessing the data. However, existing works are not practical due to the use of heavy cryptography. In this paper, we propose an efficient privacy-preserving recommender system that takes advantage of clustering to improve efficiency. Using a secure clustering mechanism, user data are assigned to multiple clusters before being fed into the recommendation. Our proposed protocols are privacy-preserving and do not leak information that could be used to identify a data subject. The experiments show that our system is efficient and accurate. [ABSTRACT FROM AUTHOR]

The Boolean map χ n : F 2 n → F 2 n , x ↦ y defined by y i = x i + (x i + 1 + 1) x i + 2 (where i ∈ Z / n Z ) is used in various permutations that are part of cryptographic schemes, e.g., Keccak-f (the SHA-3-permutation), ASCON (the winner of the NIST Lightweight competition), Xoodoo, Rasta and Subterranean (2.0). In this paper, we study various algebraic properties of this map. We consider χ n (through vectorial isomorphism) as a univariate polynomial. We show that it is a power function if and only if n = 1 , 3 . We furthermore compute bounds on the sparsity and degree of these univariate polynomials, and the number of different univariate representations. Secondly, we compute the number of monomials of given degree in the inverse of χ n (if it exists). This number coincides with binomial coefficients. Lastly, we consider χ n as a polynomial map, to study whether the same rule ( y i = x i + (x i + 1 + 1) x i + 2 ) gives a bijection on field extensions of F 2 . We show that this is not the case for extensions whose degree is divisible by two or three. Based on these results, we conjecture that this rule does not give a bijection on any extension field of F 2 . [ABSTRACT FROM AUTHOR]

Ascon, a family of algorithms that supports authenticated encryption and hashing, has been selected as the new standard for lightweight cryptography in the NIST Lightweight Cryptography Project. Ascon's permutation and authenticated encryption have been actively analyzed, but there are relatively few analyses on the hashing. In this paper, we concentrate on preimage attacks on Ascon-Xof. We focus on linearizing the polynomials leaked by the hash value to find its inverse. In an attack on 2-round Ascon-Xof, we carefully construct the set of guess bits using a greedy algorithm in the context of guess-and-determine. This allows us to attack Ascon-Xof more efficiently than the method in Dobraunig et al., and we fully implement our attack to demonstrate its effectiveness. We also provide the number of guess bits required to linearize one output bit after 3- and 4-round Ascon's permutation, respectively. In particular, for the first time, we connect the result for 3-round Ascon to a preimage attack on Ascon-Xof with a 64-bit output. Our attacks primarily focus on analyzing weakened versions of Ascon-Xof, where the weakening involves setting all the IV values to 0 and omitting the round constants. Although our attacks do not compromise the security of the full Ascon-Xof, they provide new insights into their security. [ABSTRACT FROM AUTHOR]

The three party authenticated key agreement protocol assists two parties in affirming one another and agreeing on a shared session key with the assistance of a trusted server. Chaos-based cryptography has seen considerable progress due to the sound characteristics of chaotic systems. Nowadays, many researchers are actively working in this direction and have proposed various three party authenticated key agreement protocols based on chaotic maps. In this paper, we analysed the Zheng et al. 's scheme (IEEE Access 8:66150–66162, 2020, https://doi.org/10.1109/ACCESS.2020.2979251) and found that it is vulnerable to various attacks like verification table theft attack, impersonation attacks and also it does not provide anonymity to users. Zheng et al.'s scheme also has flaw in registration phase and uses timestamps for key freshness. In this article, we proposed a three party chaotic based authenticated key agreement protocol which is secured against aforementioned attacks. Authors are also compared the proposed scheme with other comparable and existing schemes in terms of security features, computation cost, and communication cost. The comparison analysis shows that the proposed scheme has more security features at a lower cost in computing and communication. We have also demonstrated the security of the proposed protocol within the framework of the random oracle model. [ABSTRACT FROM AUTHOR]

A large number of interconnected smart devices or objects interact with the physical environment known as the Internet of Things (IoT). These networks efficiently perform complex tasks with a high level of intelligence without human intervention and require run-time processing and computation. Edge computing is introduced where devices are placed at the edge between the data source and the cloud. These devices can provide more powerful computational and storage capabilities to IoT users. With various benefits, one of the significant requirements is secure and trustworthy data communication. Various trust management schemes are introduced to guarantee the trustworthiness and isolation of the malicious nodes and give preference to the most trustworthy ones. The existing schemes selected trustworthy nodes again and again from the path without considering the load factor which leads them to be more vulnerable for the Denial of Services (DoS) attacks. In this paper, we propose a Link-based Penalized Trust Management scheme to provide trust management and consider load factors for the selection of most trustworthy nodes and provide a preemptive measure to secure the network from DoS attacks based on its link's association. Simulation results indicate the better performance of the proposed scheme as compared with existing schemes. [ABSTRACT FROM AUTHOR]

Cryptography plays a key role in information systems of financial industry. With the rapid development of financial industry, the scale of the financial cryptographic services continues to expand, and the volume of terminal devices increased significantly, causing problems such as system complexity and extreme workload. The centralized data processing model enabled by cloud computing can ease these problems to some extent, but when the data produced by various kinds of devices (e.g. IoT devices) continues to increase rapidly, cloud computing-based services subsequentially cannot meet the demand of real-time and efficient data processing. The edge computing is an emerging computing model, which is capable of hierarchically managing the resource, and supporting the deployment of cryptographic services at the edge. The edge computing-based cryptographic service separates data encryption/ decryption processing and provides low-level interfaces for financial business systems. It could simplify the way financial business systems obtain cryptographic services. In this paper, we propose an edge oriented cryptographic key management service, which consists of system monitor module, key management module and security management module. The proposed service enables the management of the whole life cycle of cryptographic keys, and reconstructs the process of cryptographic key. In a 1-year continuous testing, the proposed system achieved a total of 36 million cryptographic key distributions, and each cryptographic key has a lifecycle of 1.5 days on average. The TPS reached 15,000, and the system availability reached 99.99% throughout the year. The proposed system now is officially available as a commercial cryptographic service platform. [ABSTRACT FROM AUTHOR]

Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption. The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella (in: Cryptography and coding—14th IMA international conference, IMACC 2013. Lecture notes in computer science, vol 8308. Springer, Heidelberg, pp 28–44, 2013. https://doi.org/10.1007/978-3-642-45239-0%5f3.) based on the BGV scheme. Unfortunately, their implementation faced significant limitations due to the exceedingly high multiplicative depth, rendering it impractical. Recently, a homomorphic implementation of SHA-256 based on the TFHE scheme (Homomorphic evaluation of SHA-256. https://github.com/zama-ai/tfhe-rs/tree/main/tfhe/examples/sha256%5fbool) brings it from theory to reality, however, its current efficiency remains insufficient. In this paper, we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE, further reducing the reliance on gate bootstrapping and enhancing evaluation latency. Specifically, we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo 2 32 in iterative compression. Furthermore, we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3. Finally, we give specific comparative implementations based on the TFHE-rs library. Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35–50% compared with the state-of-the-art result under different cores. [ABSTRACT FROM AUTHOR]

The Mixed Integer Linear Programming (MILP) technique has been widely applied in the realm of symmetric-key cryptanalysis. In this paper, we propose a new bitwise breakdown MILP modeling strategy for describing the linear propagation rules of modular addition-based operations. We apply such new techniques to cryptanalysis of the SNOW stream cipher family and find new linear masks: we use the MILP model to find many linear mask candidates among which the best ones are identified with particular algebraic bias evaluation techniques. For SNOW 3G, the correlation of the linear mask we found is the highest on record: such results are highly likely to be optimal according to our analysis. For SNOW 2.0, we find new masks matching the correlation record and many new sub-optimal masks applicable to improving correlation attacks. For SNOW-V/Vi, by investigating both bitwise and truncated linear masks, we find all linear masks having the highest correlation and prove the optimum of the corresponding truncated patterns under the "fewest active S-box preferred" strategy. By using the newly found linear masks, we give correlation attacks on the SNOW family with improved complexities. We emphasize that the newly proposed uniform MILP-aided framework can be potentially applied to analyze LFSR-FSM structures composed of modular addition and S-box as non-linear components. [ABSTRACT FROM AUTHOR]

Abstract  The first practical identity based encryption (IBE) scheme was published by Boneh and Franklin at Crypto 2001, based on the elliptic curve pairing. Since that time, many other IBE schemes have been published. In this paper, we describe a variant of Boneh-Franklin with a tight reduction in the random oracle model. Our new scheme is quite efficient compared to existing schemes; moreover, upgrading from Boneh-Franklin to our new scheme is straightforward. [ABSTRACT FROM AUTHOR]

Steganography is used at a large scale in various security systems. It is the science and art of hiding secret information into data. Various steganography schemes have been proposed over the years, but most of them are not promising enough to provide a large capacity of embedding and visually prevent the image's degradation. Histograms can reveal the existence of secret information, and it is also an essential issue in the security of the data. In this Paper, the main objective is to reduce the bit-flip cost count and maximize the PSNR value to reduce the image distortion and keep the data secure by using secret keys while embedding. In this proposed paper, the genetic algorithm (GA) is employed to select the best chromosome that has the minimum bit-flip cost count and maximum PSNR. Data security is achieved by the secret key generated from Hamiltonian path for embedding and retrieving of data. The proposed technique is robust against steganographic attacks and even if presence of data is observed it not possible to guess the embedding pattern. The result section demonstrates that the proposed technique outperform the existing techniques by increasing the PSNR significantly by approx 7 percent that lead to the increase in PSNR value up to 41.8dB for three bit per pixel embedding. [ABSTRACT FROM AUTHOR]

Generating a secret key from the physical layer is one of the most challenging topics in cryptography. Secret key generation rate (SKGR) and secrecy rate (SR) are two important concepts for any secure communication scheme. In this paper, we first propose a new power allocation strategy to minimize the power consumption under a given SKGR constraint for orthogonal frequency division (OFDM) based communication systems. Due to the non-convex nature of the SKGR expression, we convert the optimization problem into a convex problem. In the continuation of this paper, we investigate the effects of the proposed power allocation strategy on the SR performance. Simulation results demonstrate that using the obtained optimum power vector, which was calculated in the key generation phase, we achieve a better level of SR in the data communication phase. The simulation results also verify that the average SR performance obtained by the proposed method is superior to the geometric programing (GP)-based method. [ABSTRACT FROM AUTHOR]

Blockchain is one of the promising technologies nowadays due to its unique characteristics like security, privacy, data integrity, decentralization, immutability, and traceability. Originally used to implement cryptocurrencies, recently numerous applications have employed blockchain in their architectures including applications targeted for the internet of things (IoT) environments. It is expected that by 2025 more than 21 billion IoT devices will be used especially with use of cloud, fog and edge computing architectures. Integrating blockchain in the IoT architecture provides many advantages such as enhancing security and privacy, better speed and costs, traceability and reliability, and elimination of single point of failure. On the other hand, many issues and challenges have arisen and should be addressed. Typically, IoT system consists of lightweight devices with limited hardware resources and constraints. Hence, the energy efficiency is a fundamental challenge in such devices. The main motivation of this paper is to survey designing a secure and energy efficient blockchain-based IoT implementation using a suitable hardware design. The paper classifies, presents and analyzes existing solutions to better implement IoT environment combined with blockchain technology. Our investigation demonstrations that most of lightweight solutions handle either the energy or security issue separately. Moreover, many works are theoretical-based analysis and solutions without considering the real blockchain-based IoT validation design. Energy evaluation for IoT hardware devices is not given the adequate research bandwidth. Additionally, limited works evaluated their techniques from hardware constrained device perspective. It is recommended that the performance of any proposed solution should be validated using real designs. The hardware perspective evaluation should be in mind for efficient blockchain-based IoT hardware implementation. The proposed lightweight solutions should focus more on efficient energy implementation while considering the lightweight security mechanisms. [ABSTRACT FROM AUTHOR]

I am very pleased to present this special issue of New Generation Computing for Card-Based Cryptography. This special issue consists of six research papers that contain advanced and cutting-edge new results on the emerging research area, card-based cryptography. In the paper, I Card-based Cryptography with Dihedral Symmetry i , Kazumasa Shinagawa proposes a novel kind of cards, called the dihedral cards, by which he designs several important protocols suitable especially for multi-valued computations; he also constructs a framework capturing a wide range of types of physical cards. [Extracted from the article]

Mission-critical applications refer to the real-time applications, which require fast and secure service provisioning, such as defense sector and disaster management. This paper proposes a delay-aware and secure service provisioning model for such types of applications. As a use-case, we have considered the defense sector, which is a vital sector for a country's all-round well-being including security, safety, society, and economy. In the conventional sensor-cloud model, the sensor data is stored and processed in the cloud. However, the sensor nodes have small coverage and the use of the long distant cloud servers increases the delay. Therefore, the conventional sensor-cloud model may not be efficient for defense application. Moreover, data hiding for security purposes is another important aspect of this field. To address these challenges, this paper proposes a mobility-aware sensor-fog paradigm for mission-critical applications based on network coding and steganography, referred to as Mobi-Sense. In Mobi-Sense, steganography is used for hiding the data during transmission. The theoretical results demonstrate that Mobi-Sense outperforms the existing frameworks with respect to delay and power consumption by ∼ (40 - 80) %. The simulation results present that Mobi-Sense reduces the delay by ∼ (18 - 40) % than the conventional sensor-cloud framework for mission-critical applications. An optimal path finding algorithm based on deep learning has been deployed in the context of disaster scenario. The experimental analysis shows that the proposed optimal path finding method achieves precision and accuracy above 90%. This is observed that our proposed modules have outperformed existing baselines in terms of accuracy, delay, and power consumption. [ABSTRACT FROM AUTHOR]

With the rapid evolvement of cryptanalysis, attacks with multiple distinguishers have emerged gradually. Many new cryptanalytic methods such as multiple differential cryptanalysis, multiple linear cryptanalysis, multiple impossible differential cryptanalysis, multidimensional zero correlation linear cryptanalysis have been proposed, which have greatly enhanced the efficiency of corresponding attacks. During these attacks, discovering more distinguishers has always been a trivial and manual work. Many cryptographers use their expertise and experience to achieve this goal. However, in most cases, either the length of the attack or the number of distinguishers is underestimated. This paper proposes a generic method to discover more different distinguishers based on a new property called "weak rotational property". Block ciphers with this property can easily discover more distinguishers such as truncated differential distinguishers, impossible differential distinguishers and zero correlation linear distinguishers in a theoretical approach. Then the number of equivalent distinguishers is proved in a mathematical form. As an application, this paper focuses on SIMON family ciphers to illustrate how this property improves cryptanalysis. For the section of application, first of all, SIMON family ciphers are proved to have weak rotational property. Thus the number of corresponding discovered distinguishers can be increased for SIMON. Then, some earlier observations on SIMON are extended accordingly to this new property. Finally, based on the idea of weak rotational property and equivalent-subkey technique, an improved impossible differential cryptanalysis on SIMON is proposed. For SIMON32(64)/SIMON128(128)/SIMON128(192), the rounds attacked are all extended by one round. For other variants of SIMON, current best non full codebook impossible differential attacks are derived. The successful application of weak rotational property indicates its potential in cryptanalysis. [ABSTRACT FROM AUTHOR]

This paper presents two modifications for Loidreau's cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break this cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank to mix with the secret matrix. Our analysis shows that these two modifications can both resist the existing structural attacks. Furthermore, these modifications have a much more compact representation of public keys compared to Classic McEliece, which has been selected into the fourth round of the NIST-PQC project. [ABSTRACT FROM AUTHOR]

In meet-in-the-middle (MITM) attacks, the sizes of the precomputation tables determine the effectiveness. In this paper, value constraints are presented to reduce the size of the precomputation table in MITM attacks on AES. Based on a differential property of linear combinations of multiple S-boxes, value constraints related to input or output in four and five rounds of AES are explored. Meanwhile, with these value constraints, a method of setting up non-linear equations is proposed to reduce the sizes of the precomputation tables by decreasing the number of byte parameters. Compared with the existing results, their sizes can be reduced by 2 8 , 2 16 , or 2 24 . Finally, some attacks are improved with lower time and memory complexities. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses articles in the issue on topics including reversible data hiding, cryptography and steganography.

The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). Quantum cryptography is a challenging topic in network security for future networks. Quantum cryptography is an outgrowth of two broad topics—cryptology and cryptanalysis. In this paper, SHA1 and MD5 algorithms are designed and implemented for quantum computers. The main aim is to study and investigate the time requirement to build a hash and the bit rate at which a hash value is sent through. In this paper, a comprehensive analysis of these two algorithms is performed. Experiments have been done to compare and contrast the performances of the classical and proposed algorithms. In the experiment, it was found that the total time of execution of quantum SHA1 and quantum MD5 is much higher than the classical SHA1 and MD5. During quantum MD5 execution, it is observed that the time doubles when the number of chunks is increased from 1 to 2. Another experimental observation is that the execution time of the implemented algorithms depends upon the processor's speed. [ABSTRACT FROM AUTHOR]

In symmetric cryptography, block ciphers, stream ciphers and permutations often make use of a round function and many round functions consist of a linear and a non-linear layer. One that is often used is based on the cellular automaton that is denoted by χ as a Boolean map on bi-infinite sequences, F 2 Z . It is defined by σ ↦ ν where each ν i = σ i + (σ i + 1 + 1) σ i + 2 . A map χ n is a map that operates on n-bit arrays with periodic boundary conditions. This corresponds with χ restricted to periodic infinite sequences with period that divides n. This map χ n is used in various permutations, e.g., Keccak-f (the permutation in SHA-3), ASCON (the NIST standard for lightweight cryptography), Xoodoo, Rasta and Subterranean (2.0). In this paper, we characterize the graph of χ on periodic sequences. It turns out that χ is surjective on the set of all periodic sequences. We will show what sequences will give collisions after one application of χ . We prove that, for odd n, the order of χ n (in the group of bijective maps on F 2 n ) is 2 ⌈ lg (n + 1 2) ⌉ . A given periodic sequence lies on a cycle in the graph of χ , or it can be represented as a polynomial. By regarding the divisors of such a polynomial one can see whether it lies in a cycle, or after how many iterations of χ it will. Furthermore, we can see, for a given σ , the length of the cycle in its component in the state diagram. Finally, we extend the surjectivity of χ to F 2 Z , thus to include non-periodic sequences. [ABSTRACT FROM AUTHOR]

The exponential growth and wide-area applications of the Internet of Things have garnered a lot of interest from academics and industries, thus becoming one of the most actively studied research paradigms in recent years. Internet of Things is a concept that builds an inter-connected environment where physical devices collect data from the surroundings and customize it to our requirements. It is known for its fast processing and quick response. Edge computing is a platform that performs the computations on the data supplied by the Internet of Thing devices at the network edge that leads to real-time processing. Despite its advantages, privacy protection and security challenges remain a critical concern that must be addressed. This paper aims to give a comprehensive review on cryptographic schemes used for securing edge computing. In particular, we first present a concept of edge computing in the context of IoT including architecture and advantages over cloud computing. We have explored various encryption techniques like identity-based encryption, attribute-based encryption, searchable encryption, and homomorphic encryption that secure the sensitive data before processing it at the network edge. Various parameters of each encryption technique, such as the length of the public key, private key, and ciphetext, are compared. Computational complexity of encryption and decryption is also included in our comparative study. Although many review papers focused on authentication and authorization challenges, this review on encryption techniques in context of edge security was highly needed. We have also looked at some of the other review papers and compared them to our survey to show how important it is. [ABSTRACT FROM AUTHOR]

Thus far, several papers reported concrete resource estimates of Shor's quantum algorithm for solving the elliptic curve discrete logarithm problem. In this paper, we study quantum FLT-based inversion algorithms over binary elliptic curves. There are two major algorithms proposed by Banegas et al. and Putranto et al., where the former and latter algorithms achieve fewer numbers of qubits and smaller depths of circuits, respectively. We propose two quantum FLT-based inversion algorithms that essentially outperform previous FLT-based algorithms and compare the performance for NIST curves of the degree n. Specifically, for all n, our first algorithm achieves fewer qubits than Putranto et al.'s one without sacrificing the number of Toffoli gates and the depth of circuits, while our second algorithm achieves smaller depths of circuits without sacrificing the number of qubits and Toffoli gates. For example, when n = 571 , the number of qubits of our first algorithm is 74 % of that of Putranto et al.'s one, while the depth of our second algorithm is 83 % of that of Banegas et al.'s one. The improvements stem from the fact that FLT-based inversions can be performed with arbitrary sequences of addition chains for n - 1 although both Banegas et al. and Putranto et al. follow fixed sequences that were introduced by Itoh and Tsujii's classical FLT-based inversion. In particular, we analyze how several properties of addition chains, which do not affect the computational resources of classical FLT-based inversions, affect the computational resources of quantum FLT-based inversions and find appropriate sequences. [ABSTRACT FROM AUTHOR]

In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party (n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice's secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to 1 8 , which is higher than that in Hillery et al.'s protocol (Phys. Rev. A 59:1829, 1999). [ABSTRACT FROM AUTHOR]

The proliferation of social networks, the Internet of Things, and economic mobility has led to an exponential increase in data. New data having high volume, high velocity, high variety, and high value are called big data. Big data present additional requirements in terms of storage and computation resources. Various enterprises aim to outsource their big data services to the cloud because of its cost efficiency, less management, resource pooling, and resilient computing. However, outsourcing the storage of sensitive data can expose them to potential security risks. Encryption presents a straightforward solution for data privacy preserving. In traditional encryption mechanisms, such as advanced encryption standard, the data owner and users must share an exact key for both data encryption and decryption. Currently, these mechanisms do not provide a scalable and secure solution for big data storage and analysis. Furthermore, they need to be more efficient to support big data velocity. Unfortunately, securing outsourced big data storage to a public cloud environment to later maintain efficient and secure processing over encrypted data by cloud servers cannot be ensured using traditional encryption mechanisms. In this paper, we propose a security approach for this issue by which honest but curious users or cloud service providers cannot reach complete information from the stored data. From the analysis, the proposed approach can provide secure cloud-assisted big data. Meanwhile, the performance evaluation shows the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

Lightweight cryptography (LWC) is critical for securing data between devices with limited resources. In this paper, we consider hardware-based block ciphers (BC). The BCs are thoroughly described using the substitution permutation network (SPN) and Feistel network (FN) structures. A detailed summary of each SPN and FN-based BC is provided. Furthermore, the paper compares and thoroughly analyses the performance analysis of modern SPN and FN-based BCs. For each block cipher, performance measures such as chip area (slices), frequency, latency, throughput, and hardware efficiency are reviewed. The paper also recommends appropriate ciphers for the greatest and lowest performance indicators. Among BCs, the PRINCE cipher has minimal latency and great throughput. The research also reveals that the LED and PRESENT ciphers are more compact than other ciphers. The open research challenges are also presented with a forward-looking perspective. [ABSTRACT FROM AUTHOR]

Aaronson defined Forrelation (2010) as a measure of correlation between a Boolean function f and the Walsh–Hadamard transform of another function g . In a recent work, we have studied different cryptographically important spectra of Boolean functions through the lens of Forrelation. In this paper, we explore a similar kind of correlation in terms of nega-Hadamard transform. We call it nega-Forrelation and obtain a more efficient sampling strategy for nega-Hadamard transform compared to the existing results. Moreover, we present an efficient sampling strategy for nega-crosscorrelation (and consequently nega-autocorrelation) spectra too, by tweaking the nega-Forrelation technique. Finally, we connect the hidden shift finding algorithm for bent functions (Rötteler, 2010) with the Forrelation algorithm and extend it for the negabent functions. [ABSTRACT FROM AUTHOR]

ROLLO, for Rank-Ouroboros, LAKE and LOCKER, was a candidate to the second round of the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) standardization process. In the lastest update in April 2020, there was a key-encapsulation mechanism (ROLLO-I) and a public-key encryption scheme (ROLLO-II). In this paper, we propose a side-channel attack to recover the syndrome during the decapsulation process of ROLLO-I. From this syndrome, we explain how to recover the private key. We target two constant-time implementations: the C reference implementation and a C implementation available on GitHub. By capturing power measurements during the execution of the Gaussian elimination function, we are able to extract from a single trace each element of the syndrome. This attack can also be applied to the decryption process of ROLLO-II. Finally, we give countermeasures based on masking and randomization to protect future implementations. We also provide their impact regarding the execution time. [ABSTRACT FROM AUTHOR]

In recent years, deep learning has been used in steganography scheme, and the implemented solution had a large hidden capacity. In order to further study the effect of basic deep learning network on image steganography, a deep learning image steganography scheme based on ResNet was proposed in this paper, which applied the idea of residual blocks in ResNet to the field of image steganography. Image hiding and image extraction were realized by encoder network and decoder network. In the proposed scheme, by setting the balance parameter during training, different hiding and extraction qualities could be obtained for different scenarios. At the same time, a new performance analysis method was proposed for the field of deep steganography: the scatter plots of PSNR and SSIM. For a test set with a large amount of data, it could clearly reflect the performance of the solution, and it had a certain degree of application value in the field of deep steganography. The experimental results showed that the scheme had better invisibility when hiding, high data accuracy when extracting, and had certain advantages compared with the existing scheme. And it performed better when detected by steganalysis tools. [ABSTRACT FROM AUTHOR]

This paper presents a novel encryption method based on individual block ciphering using Catalan random walks. This paper aims to offer some new possibilities of multimedia data protection to realize the rights of participants in the multimedia distribution chain (image, text, video, sound). Also, the emphasis is on advanced analysis of Catalan numbers and their combinatorial representations in multimedia security. The proposed method consists of five phases: conversion, division, selection, encryption, and generation. We presented the application of our method in ensuring the security of multimedia content. The proposed method was implemented in Java. In the experimental testing, we provide the time and space complexity of Catalan keys generation and Maurer's universal statistical test for the proposed method. Also, we state security analysis using machine learning methods and comparative analysis with existing methods of encrypting data into a blockchain. [ABSTRACT FROM AUTHOR]

Directional Modulation (DM) techniques provide wireless communication security against passive eavesdropping by means of specific physical layer characteristics. The original symbol constellations are transmitted along pre-specified spatial direction of legitimate users, while phase-amplitude distorted symbols are transmitted along the undesired directions of eavesdropper. In this paper, a comprehensive review of DM techniques and the most recent developments in this area are discussed. An analysis from three independent Physical Layer Security (PLS) viewpoints; communications, information-theoretic and cryptographic perspective is presented. Different performance metrics in literature are compared and the need for unified PLS approach is emphasized. As DM techniques constitute a relatively new class of PLS, there is no systematic organization of these techniques so far. This paper presents a classification framework for DM comprising of two main categories; angular (1D) and range-angular (2D) techniques. The former secures data along angular direction of physical space, while the latter provides security within certain range (distance) from the transmitter along desired angular direction. Further sub-categorization is based on the under-lying physical layer parameters exploited to achieve security, i.e. space, time, frequency, phase and polarization. The proposed framework is generic, flexible and extend-able to future research. In the end, limitations of existing techniques are pointed out and research directions are suggested. [ABSTRACT FROM AUTHOR]

This paper is devoted to selecting rules for one-dimensional (1D) totalistic cellular automaton (TCA). These rules are used for the generation of pseudorandom sequences, which could be useful in cryptography. The power of pseudorandom number generator (PRNG) based on nonuniform TCA can be improved using not only one rule but a large set of rules. For this purpose, each subset of rules should be analyzed with its assignation to cellular automaton (CA) cells should be analyzed. We examine each of the subsets of totalistic rules, consisting of rules with neighborhood radius equal to 1 and 2. The entropy of bitstreams generated by the nonuniform TCA points out the best set of rules appropriate for the TCA-based generator. The paper also presents the method of simple selection of CA rules based on a cryptographic criterion known as a balance. The proposed method selects a maximal size of the set of available CA rules for a given neighborhood radius and suitable for PRNG. The method guarantees to avoid conflicting assignments of rules resulting in the creation of unwanted stable bit sequences, and provides high-quality pseudorandom sequences. This technique is used to verify the subsets of rules selected experimentally. Verified rules are proposed for 1D TCA-based PRNG as a new subset of best nonuniform TCA rules. New picked, examined, and verified subset of rules could be used in TCA-based PRNG and provide cryptographically strong bit sequences and huge keyspace. [ABSTRACT FROM AUTHOR]

Steganalysis, as the opposite technique to steganography, has been applied to determine whether secret information is embedded in an image. The existing adaptive steganography methods embed secret information in different regions of an image with different probabilities. However, it is difficult for most steganalysis models to make a targeted attention of steganography regions of images, which reduces the detection accuracy of the steganalysis models when detecting the adaptive steganography methods. Aiming to detect the JPEG-based adaptive steganography, this paper proposes a model called Steganalysis Attention Augmented Network (SAANet). The proposed model uses attention augmented convolution instead of traditional convolution, so that the network assigns more learning weights to the steganographic area, and guides the network to better learn features that are beneficial to steganalysis. Thereby improving the learning ability and training effect of the model. As far as we know, we are the first to directly apply attention to the backbone structure of the network model to assist in image steganalysis. And our work improves the accuracy and operating efficiency of the steganalysis model. Experiments show that compared with the current steganalysis models, the model proposed in this paper obtains a competitive detection performance. The current adaptive steganography algorithm achieves a detection accuracy of up to 96.68%, while 95.22% under mismatch conditions, and the testing time is 28 s, indicating that the proposed model has a certain generalization performance and practicability. [ABSTRACT FROM AUTHOR]

Multi-image steganography, a technique for concealing information within multiple carrier mediums, finds remote sensing images to be particularly apt carriers due to their complex structures and abundant texture data. These characteristics bolster the resilience against steganalysis and enhance steganographic capacity. The efficacy of multi-image steganography hinges on the diplomatic strategy of cover selection and the meticulous allocation of the payload. Nevertheless, the majority of current methods, which are empirically formulated, predominantly focus on the texture complexity of individual images, thereby potentially undermining overall security. This paper introduces a security-oriented approach to steganographic payload allocation for multiple remote sensing images aimed at fortifying the security of multi-image steganography. Our primary contributions include employing a steganalysis pre-trained network to quantify texture complexity in remote sensing cover images, directly correlating it with security. Additionally, we have developed an adaptive payload allocation strategy for multiple images, which embeds a payload proximate to each image's maximal steganographic capacity while concurrently ensuring the security of the embedding process. Experimental results corroborate that our methodology excels in cover selection and payload allocation and achieves better undetectability against modern steganalysis tools. [ABSTRACT FROM AUTHOR]

The existing encryption schemes of visually secure image have drawbacks, such as excessive concentration of image data and insufficient resistance to various attacks in the transmission channel. Based on the combination of compressed sensing and secret image sharing, this paper presents a visually secure multi-secret image encryption-sharing scheme, which effectively solves the above shortcomings. First, the plain image is perceived as sparse and encrypted by semi-tensor compressed sensing for security. Secondly, the encrypted image is divided into n shadows by secret image sharing. This solves the problem of image data being too centralized and meets the requirements of risk dispersion and intrusion tolerance. Finally, the n shadows are embedded into n carriers by steganography technology to form a visually secure image. On the basis of guaranteeing the quality of image reconstruction, this paper has high compression and security. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is an important virtual network that allows remote users to access linked multimedia devices. The development of IoT and its ubiquitous application across various domains of everyday life has led to continuous research efforts. Security is a perceptual concern for researchers involved in IoT as it is a key factor in the acceptance of any innovative technology. Numerous research studies have been conducted concentrating on the level of IoT security on a particular mechanism, on specific applications, or on categorizing vulnerabilities, in order to address a defined situation of securing an IoT network. This present paper aims to comprehensively review potential solutions for securing IoT, between emerging and traditional mechanisms, such as blockchain, machine learning, cryptography, and quantum computing. This study provides a comparative analysis of related papers with their characteristics, pros and cons. Accordingly, it taxonomizes relevant solutions based on their achieved security requirements. Furthermore, the potential benefits and challenges of each of the four mechanisms are discussed. [ABSTRACT FROM AUTHOR]

The emergence of new complex technologies, such as cloud and quantum computing, has a complicated computational structure, which can compromise the security of traditional cryptographic protocols. It has been noted that traditional security systems utilize non-quantum resistance factorization and Diffie–Hellman (DH) hard problems for their protection. Lattice-based cryptography appears to be a potential post-quantum substitute for the presently employed public-key cryptography. As a result, we have been motivated to focus on increasingly sophisticated and challenging lattice hard assumptions capable of withstanding new modern technologies with quantum resistance properties. In this paper, we devise a new lattice-based public-key encryption and signature schemes with smaller key sizes. The proposed scheme also resists the quantum attack because of the lattice small integer solution problem and its variant. The security claim has also been proved in a well-suited model for quantum attacks. The performance analysis shows that the presented schemes outperform the DH-type schemes and compete with similar lattice-based schemes in terms of storage, communication, key sizes, and computational overheads. [ABSTRACT FROM AUTHOR]