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]

Security inks based on photoluminescent materials are mostly investigated for security applications, such as information encryption and decryption, anti‐counterfeiting, and data storage. Although they are invisible to the naked eye under ambient light, they can be detected under ultraviolet or near‐infrared light. Herein, a new kind of secret paper made from network‐structured ultralong hydroxyapatite nanowires and cellulose fibers has been developed. White vinegar, a common cooking ingredient, is used as an invisible security ink. Covert information on the secret paper written with white vinegar is totally invisible under natural light, but it can be decrypted and clearly read after exposure to fire; the response time to fire is short (<10 s). The ways of writing on the secret paper are diverse by using various pens loaded with white vinegar. [ABSTRACT FROM AUTHOR]

Increasing threat intrusions to enterprise computing systems have led to a formulation of guarded enterprise systems. The approach was to put in place steel gates and prevent hostile entities from entering the enterprise domain. The current complexity level has made the fortress approach to security implemented throughout the defense, banking, and other high trust industries unworkable. The alternative security approach presented in this paper is the result of a concentrated fourteen year program of pilots and research. Its distributed approach has no need for passwords or accounts and derives from a set of tenets that form the basic security model requirements. At each step in the process it determines identities and claims for access and privileges. These techniques are resilient, secure, extensible, and scalable. They are currently being implemented for a major enterprise, and are a candidate for other enterprise security approaches. This paper discusses the Enterprise Level Security architecture, a web-based security architecture designed to select and incorporate technology into a cohesive set of policies and rules for an enterprise information system. The paper discusses the history, theoretical underpinnings, implementation decisions, current status, and future plans for expansion of capabilities and scale.

This research paper explores the evolution of voting systems, assessing vulnerabilities in traditional methods and investigating blockchain technology as a solution. Traditional voting systems encounter challenges concerning security, transparency, and accessibility, prompting a transition towards blockchain-based online voting. Blockchain, originating from cryptocurrencies, decentralizes control, thereby enhancing transparency, integrity, and security in elections. Real-world case studies from Estonia and West Virginia offer insights into implementation and successes. Ethical considerations, including privacy and consent, alongside societal impacts like inclusivity and democratization, are scrutinized. The proposed blockchain-based voting system prioritizes decentralization, tamper resistance, and interoperability. Security measures incorporate cryptographic techniques and multi-factor authentication. Transparency is assured through a publicly accessible blockchain ledger, facilitating an auditable voting process. The paper addresses challenges like voter accessibility and election anonymity, proposing mitigation strategies. Future directions entail integrating blockchain with AI and machine learning for interoperability and standardization. Collaboration among policymakers, technologists, and researchers is pivotal for advocating secure, transparent, and accessible blockchain-based voting systems, with the goal of fostering globally participatory elections. [ABSTRACT FROM AUTHOR]

Network compression coding technology is a research hotspot in the field of digital steganography and image synthesis. How to improve image quality while achieving short compression time is a problem currently faced. Based on the improved wavelet neural network theory, this paper constructs a digital steganography and image synthesis model. The model first tracks the contour of the digit to be recognized, then equalizes and resamples the contour to make it translation-invariant and scaling-invariant, and then uses multi-wavelet neural network clusters to stretch the contour shell to obtain orders of magnitude multi-resolution and its average, and finally, these shell coefficients are fed into a feedforward neural network cluster to identify this handwritten digit, solving the problem of multi-resolution decomposition of contour shells while having a high sampling rate. In the simulation process, the classification model that a single pixel is a text/non-text pixel is trained on the original gray value of the gray pixel and its neighboring pixels, and the classified text pixels are connected to a text area through an adaptive MeanShift method. The experimental results show that it is feasible to use multi-wavelet features for handwritten digit recognition. The model combines the neural network and the genetic algorithm, making full use of the advantages of both, so that the new algorithm has the learning ability and robustness of the neural network. The compression ratio after compression by ordinary wavelet coding, PSNR, MSE, and compression time are 8.4, 25 dB, 210, and 7 s, respectively. The values are 11.7, 24 dB, 207, and 11 s, respectively. At the same time, the peak signal-to-noise ratio is higher and the mean square error is lower, that is, the compression quality is better, and the accuracy of digital steganography and image synthesis is effectively improved. [ABSTRACT FROM AUTHOR]

This is our first IET Information Security special issue from the Internation Conference on Information Security and Cryptology, which was held from December 1 to December 3, Seoul, South Korea, 2021. TOPIC B Paper 3 by K. Yamamura, Y. Wang, and E. Fujisaki investigates an enumeration algorithm that is used as a subroutine for the BKZ algorithm, which is one of the most practical reduction algorithms. [Extracted from the article]

Recently, there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as “secret writing on dirty paper”) to within half a bit. [ABSTRACT FROM PUBLISHER]

Nowadays, it is difficult to imagine a powerful algorithm of cryptography that can continue cryptanalyzing and attacking without the use of unconventional techniques. Although some of the substitution algorithms are old, such as Vigenere, Alberti, and Trithemius ciphers, they are considered powerful and cannot be broken. In this paper we produce the novelty algorithm, by using of biological computation as an unconventional search tool combined with an uninhibited analysis method is the vertical probabilistic model, that makes attacking and analyzing these ciphers possible and very easy to transform the problem from a complex to a linear one, which is a novelty achievement. The letters of the encoded message are processed in the form of segments of equal length, to report the available hardware components. Each letter codon represents a region of the memory strand, and the letters calculated for it are symbolized within the probabilistic model so that each pair has a triple encoding: the first is given as a memory strand encoding and the others are its complement in the sticker encoding; These encodings differ from one region to another. The solution space is calculated and then the parallel search process begins. Some memory complexities are excluded even though they are within the solution paths formed, because the natural language does not contain its sequences. The precision of the solution and the time consuming of access to it depend on the length of the processed text, and the precision of the solution is often inversely proportional to the speed of access to it. As an average of the time spent to reach the solution, a text with a length of 200 cipher characters needs approximately 15 minutes to give 98% of the correct components of the specific hardware. The aim of the paper is to transform OTP substitution analysis from a NP problem to a O(nm) problem, which makes it easier to find solutions to it easily with the available capabilities and to develop methods that are harnessed to attack difficult and powerful ciphers that differ in class and type from the OTP polyalphabetic substitution ciphers. [ABSTRACT FROM AUTHOR]

This article argues that papermaking supported cryptanalysis's invention; that cryptology—meaning both cryptography and cryptanalysis—could not be practiced before the sustained production of paper; and that Medieval Arabic cryptology originated in tandem with algebra. Furthermore, this article posits that the regional Islamicate postal service, or thebarīd, was used to relay Medieval Arabic cryptograms and thereby shaped the substance of cryptology. These conclusions stem from examining ninth century to fourteenth century Arabic cryptology as a technology and relating Arabic cryptology to three other technological devices: papermaking in the Middle East, algebra, and thebarīd. Extant documents suggest that cryptology originated in ninth century Baghdad. This is because no cryptanalytical writings are known to exist before this period, and cryptology requires both cryptography and cryptanalysis. However, evidence of Medieval Arabic cryptology exists almost exclusively in practitioners' treatises, not in cryptograms or the working papers of cryptanalysts. To redress this barrier to historical research, I move from text to context, or from the ideas in the treatises to thinking about the technologies these ideas called for. Placing cryptological technology within the wider technological context that inspired, shaped, and confined its development suggests why cryptology originated in the Islamicate world, how Arabic cryptology may have been implemented in practice, and what enabled cryptology's start. I hope that this technological exercise encourages the study of the context in which Medieval Arabic cryptology developed, until further primary sources surface. Furthermore, I intend to demonstrate Medieval Arabic cryptology's relevance to cryptological history and Middle Eastern studies. [ABSTRACT FROM PUBLISHER]

Wet paper codes are used to design steganographic schemes, in which the sender can embed messages into a cover with arbitrarily selected changeable bits that are not shared by the recipient. In this letter, we propose a novel approach to wet paper codes by folding the cover into several layers and applying basic wet paper coding methods with low computational complexity to each layer. This method uses the changes introduced in the first layer to embed messages into every layer and therefore achieves high embedding efficiency (average number of bits embedded by per change). [ABSTRACT FROM AUTHOR]

The development of the medical field had led to the transformation of communication from paper information into the digital form. Medical information security had become a great concern as the medical field is moving towards the digital world and hence patient information, disease diagnosis and so on are all being stored in the digital image. Therefore, to improve the medical information security, securing of patient information and the increasing requirements for communication to be transferred between patients, client, medical practitioners, and sponsors is essential to be secured. The core aim of this research is to make available a complete knowledge about the research trends on LSB Steganography Technique, which are applied to securing medical information such as text, image, audio, video and graphics and also discuss the efficiency of the LSB technique. The survey findings show that LSB steganography technique is efficient in securing medical information from intruder. [ABSTRACT FROM AUTHOR]

In this paper, we show that the communication channel known as writing in memory with defective cells is a relevant information-theoretical model for a specific case of passive warden steganography when the sender embeds a secret message into a subset C of the cover object X without sharing C with the recipient. The set C, which is also called the selection channel, could be arbitrary, determined by the sender from the cover object using a deterministic, pseudo-random, or a truly random process. We call this steganography "writing on wet paper" and realize it using a simple variable-rate random linear code that gives the sender a convenient flexibility and control over the embedding process and is thus suitable for practical implementation. The importance of the wet paper scenario for covert communication is discussed within the context of adaptive steganography and perturbed quantization steganography. Heuristic arguments supported by tests using blind steganalysis indicate that the wet paper steganography provides improved steganographic security and is less vulnerable to steganalytic attacks compared with existing methods with shared selection channels. [ABSTRACT FROM PUBLISHER]

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper, we elaborate on the implication of these parameters and devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes, our bound is often tight. Furthermore, for these codes, the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights. [ABSTRACT FROM AUTHOR]

Audio cryptography is the practice of encrypting audio data to prevent illegal access to and listening to it. This paper presents an innovative technique of audio cryptography based on the Python computer language. To ensure secrecy and integrity, the suggested system encrypts and decrypts audio signals using advanced cryptographic techniques. A crucial component of AES, the cryptographic key is dynamically created to improve security. Python's broad library support and ease of use make it an ideal platform for implementing the AES algorithm, which ensures dependable and effective audio data encryption. The system utilizes Python's cryptography library for seamless integration and ease of implementation. Simulation results demonstrate the efficacy of the AES algorithm in securely encrypting and decrypting audio data with reduced noise compared to traditional methods. [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]

We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata. [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]

In this paper, several research topics are presented that provide productive avenues of exploration for students in an undergraduate cryptography course. The topics are intended for a variety of skill levels and interests. In some cases, a student might be inspired to try to solve the proposed problem or write computer code. Other topics might motivate them to learn new mathematics or algorithms, or research a historical event or person. In all cases, a short description of the topic is given along with several references that can be used as a starting point for student research. The author also describes some challenges and recommendations when teaching a course where a project is a main component. [ABSTRACT FROM AUTHOR]

A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the problem of finding a set of vectors in a given lattice such that the collection of all integer linear combinations of this subset is still the entire original lattice and so that the Euclidean norms of the subset are reduced. The present paper proposes simple, efficient iterations for lattice reduction which are guaranteed to reduce the Euclidean norms of the basis vectors (the vectors in the subset) monotonically during every iteration. Each iteration selects the basis vector for which projecting off (with integer coefficients) the components of the other basis vectors along the selected vector minimizes the Euclidean norms of the reduced basis vectors. Each iteration projects off the components along the selected basis vector and efficiently updates all information required for the next iteration to select its best basis vector and perform the associated projections. [ABSTRACT FROM AUTHOR]

Priced oblivious transfer (POT) is a cryptographic protocol designed for privacy-preserving e-commerce of digital content. It involves two parties: the merchant, who provides a set of priced items as input, and a customer, who acquires one of them. After the protocol has run, the customer obtains the item they chose, while the merchant cannot determine which one. Moreover, the protocol guarantees that the customer gets the content only if they have paid the price established by the merchant. In a recent paper, the authors proposed a POT system where the payments employed e-coin transactions. The strong point of the proposal was the absence of zero-knowledge proofs required in preceding systems to guarantee the correctness of payments. In this paper, we propose a novel e-coin-based POT system with a fast item retrieval procedure whose running time does not depend on the number of items for sale. This is an improvement over the aforementioned existing proposal whose execution time becomes prohibitively long when the catalog is extensive. The use of zero-knowledge proofs is neither required. [ABSTRACT FROM AUTHOR]

Steganography is an approach used to provide security to the confidential data in such a manner that only sender and receiver are able to use the data. In image steganography, image is used as a cover envelope to embed secret information. Today Barcodes system is very popular for protecting sensitive information. This paper introduces the concept of hiding data in 3D Barcode image using pattern generation approach. 3D Barcodes do not use any labels. They are embossed or engraved directly on the product during the manufacturing process.3D Barcodes use the same basic principal as 1D or 2D barcodes use. The performance evaluation is done by using statistical parameters. [ABSTRACT FROM AUTHOR]

Secret writing is the art of covered or hidden writing. The art of secret writing is meant to create a message unreadable by a third party however doesn’t hide the existence of the secret communication. This paper is meant as a technical introduction to secret writing for those unacquainted with the field. Invisible inks are generally used for secret writing. These are fluids used to write hidden messages that do not appear unless exposed by a revealing process. Invisible inks can be classified into three main categories: those that are revealed by heat, those revealed by chemical reactions and those that are visible under ultraviolet light. Some common household invisible inks are diluted fruit juices, vinegar and laundry detergent, all which can be applied by a paintbrush, special invisible ink pen or even a toothpick, Historically, used in times of war by governments and insurgents alike. The chemical processes of invisible inks are well known, so a variety of detection methods exist. The simplest invisible ink experiment consists of dipping a brush in vegetable juice, biological fluids and different chemicals and writing on a piece of blank varieties of paper. When the “ink” dries, it will be invisible to the naked eye, but if the paper is held up to a moderate heat source such as a light bulb, a radiator or an iron using UV lamp to deciphering invisible writing. Many other mild chemicals also used for restoration of secret writing. [ABSTRACT FROM AUTHOR]

The security of public key cryptography relies on the complexity of certain mathematical hard problems. It is vital to comprehend the intricacy of these problems to develop secure cryptographic schemes and security protocols. This paper provides an overview of some widely recognized hard problems associated with the discrete logarithm problem, including the reductions among them. Furthermore, we introduce a novel hard problem that is equivalent to the discrete logarithm problem, which also has a decisional version. Additionally, a set of new problems is presented, which can be instrumental in the design of secure encryption schemes. This paper is intended to provide crucial insights into the realm of hard problems in cryptography, facilitating a better understanding of security measures. [ABSTRACT FROM AUTHOR]

In the paper entitled "Spam Detection Approach for Secure Mobile Message Communication Using Machine Learning Algorithms", L. G. Jun et al. proposed the applications of the machine learning-based spam detection method for accurate detection. The data extraction process of the review showed that (1) latent Dirichlet allocation topic modeling is among the widely used machine learning algorithms in the selected studies and (2) precision and recall are amongst the most utilized evaluation methods for measuring the performance of these machine learning algorithms. Machine learning (ML) and cryptography have many things in common, for instance, the amount of data to be handled and large search spaces. [Extracted from the article]

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]

With the rapid development of wireless communication technology, positioning technology, and modern smart devices, Internet of Vehicles (IoVs) smart vehicles have brought great convenience to human production and life. Meanwhile, privacy and security issues are becoming extremely serious, with serious consequences if sensitive data such as vehicle location and trip patterns are leaked. This paper focuses on the demands for vehicular network security, especially privacy protection and existing privacy-protection techniques, including common cryptography methods and cryptography-based advanced technologies. At the same time, this paper also analyzes the advantages and challenges of these technologies in protecting privacy and network security in the Internet of Vehicles, such as the challenges of computational resource requirements and security efficiency in the implementation process, as well as the complexity of realizing effective privacy protection in the interactions among different entities. Finally, this paper envisions the development of privacy-preserving application scenarios and the prospects for crypotography-based privacy-preserving technologies. [ABSTRACT FROM AUTHOR]

In this paper, we study the permutation properties of the class of trinomials of the form f(x) = x4q+1 + λ1xq+4 + λ2x2q+3 ∈ Fq²[x] where λ1, λ2 ∈ Fq and they are not simultaneously zero. We find all necessary and sufficient conditions on λ1 and λ2 such that f(x) permutes Fq², where q is odd and q = 22k+1, k ∈ N. [ABSTRACT FROM AUTHOR]

This paper introduces a novel approach to enhancing multi-level security using steganography, a method of concealing information within non-secret data. This paper introduces an innovative approach to multi-level security enhancement using steganography, the art of concealing information within non-obvious data. Our proposed method uniquely combines Dynamic Least Significant Bit (DLSB) steganography with Wavelet Obtained Weights (WOW) steganographic algorithms, forging a sophisticated and adaptable system for secret data embedding. In our enhanced approach, we start by embedding text into an image using an optimized version of DLSB steganography. This refined technique adapts intelligently to the image's local contrast, thereby preserving its visual quality and ensuring the integrity of the embedded information. Subsequently, the payload image is merged with a cover image through the WOW algorithm. This step optimally selects pixels for data embedding, creating a steganographic image that is virtually indistinguishable from the original. The novelty of our work lies in the seamless integration of these two advanced steganographic techniques, which significantly elevates the security and invisibility aspects beyond the current state-of-the-art methods in digital steganography. For validation, we utilized a pretrained MobileNet model to differentiate between original and stego images. This model plays a crucial role in demonstrating the indetectability of our method, achieving an impressive accuracy of 85% in distinguishing stego images from their originals. Our rigorous testing across various metrics — including Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Bit Error Rate (BER), and Mean Squared Error (MSE) — showcases the effectiveness of our approach. The results indicate a robust performance, marking a significant advancement in secure digital communication. In this paper, we focus primarily on the detailed presentation of our results and the significant contributions of our current research, setting a strong foundation for future exploration in increasing robustness against steganalysis and improving the statistical invisibility of the steganography process. [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]

In the realm of smart communication systems, where the ubiquity of 5G/6G networks and IoT applications demands robust data confidentiality, the cryptographic integrity of block and stream cipher mechanisms plays a pivotal role. This paper focuses on the enhancement of cryptographic strength in these systems through an innovative approach to generating substitution boxes (S-boxes), which are integral in achieving confusion and diffusion properties in substitution–permutation networks. These properties are critical in thwarting statistical, differential, linear, and other forms of cryptanalysis, and are equally vital in pseudorandom number generation and cryptographic hashing algorithms. The paper addresses the challenge of rapidly producing random S-boxes with desired cryptographic attributes, a task notably arduous given the complexity of existing generation algorithms. We delve into the hill climbing algorithm, exploring various cost functions and their impact on computational complexity for generating S-boxes with a target nonlinearity of 104. Our contribution lies in proposing a new cost function that markedly reduces the generation complexity, bringing down the iteration count to under 50,000 for achieving the desired S-box. This advancement is particularly significant in the context of smart communication environments, where the balance between security and performance is paramount. [ABSTRACT FROM AUTHOR]

As the global data strategy deepens and data elements accelerate integrating and flowing more rapidly, the demand for data security and privacy protection has become increasingly prominent. Confidential computing emerges as a crucial security technology to solve security and privacy problem, and it is also a hot subject of in contemporary security technologies. Leveraging collaborative security in both hardware and software, it builds a trusted execution environment to ensure confidentiality and integrity protection for data in use. This paper provides a comprehensive overview of the development process of confidential computing, summarizing its current research status and issues, which focuses on the security requirements for data security and privacy protection. Furthermore, it deeply analyses the common technical features of confidential computing, and proposes a trusted confidential computing architecture based on collaborative hardware and software trust. Then, it elaborates on the research status and issues of confidential computing from four aspects: hardware security, architecture and key technologies, applications, and standards and evaluation. Finally, this paper provides a synthesis and outlook for the future development of confidential computing. In summary, confidential computing is currently in a rapidly developing stage and will play an important role in cyber security in the future. [ABSTRACT FROM AUTHOR]

Cloud computing is an online data storage system that can be easily accessed anywhere. Various algorithms and techniques have been developed to secure cloud data, which, if used correctly, can detect cloud attacks. These algorithms can only detect cloud data attacks and cannot prevent such attacks. If an attacker gains access to the data, he or she can tamper with the data in any way that could lead to misuse of the data. This paper will design a secure architecture for securing data with various algorithm implementations on the architecture so that cloud data can be saved from replay attacks. First, a text file will be taken, the text file will be encrypted using the encryption mechanism, and this file will be transmitted on the SaaS cloud server platform. Whenever a file is uploaded to a cloud server, it will be broadcast across the network, after which any user can access it, whether it is valid or invalid. Whenever a file is downloaded from a cloud server, it will be necessary to decrypt it to access it. If the file is successfully decrypted, then the file will be verified. A verification mechanism will be used to verify the data, which will be used to check whether a replay attack has been made on the data or not. If the data authentication is successful, this data will be called authentic data. The novelty of this paper is that an algorithm has been developed in this paper to prevent replay attacks so that if the data is retransmitted with slight changes, then the authenticity and inauthenticity of the data will be identified. Recent papers will be compared with the proposed paper in the conclusion, and it will be pointed out how much better the current technique is than the previous one. [ABSTRACT FROM AUTHOR]

Due to the rapid advancements in network technology, blockchain is being employed for distributed data storage. In the Internet of Things (IoT) scenario, different participants manage multiple blockchains located in different trust domains, which has resulted in the extensive development of cross-domain authentication techniques. However, the emergence of many attackers equipped with quantum computers has the potential to launch quantum computing attacks against cross-domain authentication schemes based on traditional cryptography, posing a significant security threat. In response to the aforementioned challenges, our paper demonstrates a post-quantum crossdomain identity authentication scheme to negotiate the session key used in the cross-chain asset exchange process. Firstly, our paper designs the hiding and recovery process of user identity index based on lattice cryptography and introduces the identity-based signature from lattice to construct a post-quantum cross-domain authentication scheme. Secondly, our paper utilizes the hashed time-locked contract to achieves the cross-chain asset exchange of blockchain nodes in different trust domains. Furthermore, the security analysis reduces the security of the identity index and signature to Learning With Errors (LWE) and Short Integer Solution (SIS) assumption, respectively, indicating that our scheme has post-quantum security. Last but not least, through comparison analysis, we display that our scheme is efficient compared with the cross-domain authentication scheme based on traditional cryptography. [ABSTRACT FROM AUTHOR]

This editorial introduces the special issue, Resources for Undergraduate Cryptology. We begin by describing possible roles for cryptology in the undergraduate mathematics curriculum together with a brief overview of the subject. We conclude with a brief preview of each paper included in this issue. [ABSTRACT FROM AUTHOR]

Various organizations store data online rather than on physical servers. As the number of user's data stored in cloud servers increases, the attack rate to access data from cloud servers also increases. Different researchers worked on different algorithms to protect cloud data from replay attacks. None of the papers used a technique that simultaneously detects a full-message and partial-message replay attack. This study presents the development of a TKN (Text, Key and Name) cryptographic algorithm aimed at protecting data from replay attacks. The program employs distinct ways to encrypt plain text [P], a user-defined Key [K], and a Secret Code [N]. The novelty of the TKN cryptographic algorithm is that the bit value of each text is linked to another value with the help of the proposed algorithm, and the length of the cipher text obtained is twice the length of the original text. In the scenario that an attacker executes a replay attack on the cloud server, engages in cryptanalysis, or manipulates any data, it will result in automated modification of all associated values inside the backend. This mechanism has the benefit of enhancing the detectability of replay attacks. Nevertheless, the attacker cannot access data not included in any of the papers, regardless of how effective the attack strategy is. At the end of paper, the proposed algorithm's novelty will be compared with different algorithms, and it will be discussed how far the proposed algorithm is better than all other algorithms. [ABSTRACT FROM AUTHOR]

In today's world, Security for any means has become really important. That stands for either hard copy or the soft copy of any document. The concept of online transactions or simply digital transactions has become a rage over a period. To accommodate such stuffs, there arises a need of transforming hard copies of document into soft copy ones. This would further lead to the crisis where there is a need to provide security for these soft copies. The documents when maintained as soft copies are vulnerable to all sorts of attacks either through bugs and/or through human errors. These human errors are the ones that need to be taken care of in a large scale. Some people believe in sharing documents through online with their peers or others of same interest. This may lead to the misuse of these documents when they fall into wrong hands. Then, the security of these documents becomes a topic to dwell on. In this paper, a study was conducted based on the ways to secure data and the techniques or algorithms that can be used to do it. There are many different technologies based on the type of data that is being encrypted. These are being discussed along with the papers that were taken into account for various data Security methods. [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]

Abstract: In this paper, a novel geometric active contour model for color image is presented. It combines squared local contrast based alignment term about directional information of edge location as part of driving force, together with the improved geodesic active contour model containing Bays error based two-region segmentation information. And all these measures are integrated as a unified framework. Finally, an unconditionally stable and simple numerical scheme, including the narrow band and fast marching methods, is introduced for efficiently implementing this novel model. Experimental results on color image segmentation show that it can extract the contour of color images precisely and its performance is shown much better than the geodesic-aided C–V (GACV) method when directional information about edge location is supplied. [Copyright &y& Elsevier]

Wet paper codes were previously proposed as a tool for construction of steganographic schemes with arbitrary (nonshared) selection channels. In this paper, we propose a new approach to wet paper codes using random linear codes of small codimension that at the same time improves the embedding efficiency (number of random message bits embedded per embedding change). Practical algorithms are given and their performance is evaluated experimentally and compared to theoretically achievable bounds. An approximate formula for the embedding efficiency of the proposed scheme is derived. The proposed coding method can be modularly combined with most steganographic schemes to improve their security. [ABSTRACT FROM PUBLISHER]

Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form. Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data. This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse. If this algorithm is applied to the cloud network, the attacker will not be able to access the data. To encrypt the data, the values of the bytes have been obtained by converting the plain text to ASCII. A key has been generated using the Non-Deterministic Bit Generator (NRBG) mechanism, and the key is XNORed with plain text bits, and then Bit toggling has been implemented. After that, an efficient matrix cipher encryption algorithm has been developed, and this algorithm has been applied to this text. The capability of this algorithm is that with its help, a key has been obtained from the plain text, and only by using this key can the data be decrypted in the first steps. A plain text key will never be used for another plain text. The data has been secured by implementing different mechanisms in both stages, and after that, a ciphertext has been obtained. At the end of the article, the latest technique will be compared with different techniques. There will be a discussion on how the present technique is better than all the other techniques; then, the conclusion will be drawn based on comparative analysis. [ABSTRACT FROM AUTHOR]

This paper focuses on analyzing the performance of various encryption algorithms, namely RSA, ECC, and DSA, in terms of encrypting and decrypting sensitive data. Encryption is crucial for ensuring the security of data, and there are two types of encryption algorithms: Symmetric key and Asymmetric-key encryption. RSA is highly secure but has high computation time, whereas ECC provides equivalent security with lower computing power and battery usage. The study compares the implementation and analysis of DES, 3DES, AES, RSA, ECC, and DSA, highlighting their strengths and weaknesses. The paper aims to provide a comprehensive comparison of these cryptographic techniques, including their performances, to assist in selecting the most appropriate algorithm for specific applications. [ABSTRACT FROM AUTHOR]

The article offers information on the proposals by the Center for Cryptologic History for papers to be delivered at the biennial symposium on cryptologic history to be held at the Johns Hopkins Applied Physics Laboratory's Kossiakoff Center in Laurel, Maryland from October 19 to 20, 2017.

This paper explores and elucidates the concept of Cryptocurrency. It contributes a framework of digital money and also provides an analysis of the price range, which influences Cryptocurrency volume and market capitalisation. Findings from the OLS analysis show that the low price genre influences the volume and market capitalization of Cryptocurreny. Based on the results, the paper develops a price, volume and market capitalization framework for Cryptocurrency. The findings provide a practical and conceptual contribution for investors and future researchers on the concept of digital currency. [ABSTRACT FROM AUTHOR]