Recent decades have seen dramatic development and adoption of digital technology. This technological advancement generates a large amount of critical data that must be safeguarded. The security of confidential data is one of the primary concerns in fog computing. As a result, achieving a reliable level of security in the fog computing environment is crucial. To this context, 3D point and mesh fog data are becoming increasingly popular among the various types of data stored in the fog. Data encryption using chaotic behavior is one of the preferred research areas due to its unique properties such as randomness, determinism, sensitivity to initial conditions, and ergodicity. In this paper, we have taken advantage of this chaotic behavior to achieve higher security. This study presents a novel approach for protecting the privacy of 3D point and mesh fog data. Initially, the fog data coordinates are transformed using the sequence generated by the chaotic behavior. Then, bifurcation analysis is used to depict the enhanced scope of the proposed map. The quality of the proposed chaotic system is assessed using metrics such as the Lyapunov exponent and approximate entropy. Results show that the proposed encryption framework performs superior when subjected to brute-force and statistical attacks. Further, the designed framework produces better results as compared to the prior literature.

The global production of information continuously increases in quantity and variety. However, the tools and technologies developed to handle such large volumes of data have not adequately met the security and privacy requirements. Existing cloud security systems, often managed by a trusted third party, are susceptible to various security risks. To address these challenges and ensure the protection of personal information, blockchain technology emerges as a crucial solution with substantial potential. This research uses the blockchain-powered attribute-aware encryption method to establish a real-time secure communication approach over the cloud. By employing attribute-based encryption technology, data owners can implement fine-grained search permissions for data users. The proposed solution incorporates accessible encryption technology to enable secure access to encrypted data and facilitate keyword searches on the blockchain. This study provides a functional comparison of recently developed attribute-based encryption algorithms. The access control strategy comprises two access tree types and a linear secret-sharing system, serving as the main components. The elliptic curve’s base field was set to 512b, and the bilinear pairing parameter type used was Type-A. This approach involves storing keywords on a remote server and encrypting them using attribute-based encryption. Furthermore, the encrypted data blockchain and the corresponding ciphertext are stored in the blockchain. Numerical experiments were conducted to evaluate the system’s key generation, trapdoor building, and keyword retrieval capabilities.

Electronic commerce (E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as $\mathrm{O}\left(ɲ\times \mathsf{\tau }\right)$which is higher than Rabin-P ($\mathrm{O}(ɲ))$ algorithms.

The advancements in communication speeds have enabled the centralized financial market to be faster and more complex than ever. The speed of the order execution has become exponentially faster when compared to the early days of electronic markets. Though the transaction speed has increased, the underlying architecture or models behind the markets have remained the same. These models come with their own disadvantages. The disadvantages are usually faced by non-institutional or small traders. The bigger players, such as financial institutions, have an advantage over smaller players because of factors such as information asymmetry and access to better infrastructure, which give them an advantage in terms of the speed of execution. This makes the centralized stock market an uneven playing field. This paper discusses the limitations of centralized financial markets, particularly the disadvantage faced by non-institutional or small traders due to information asymmetry and better infrastructure access by financial institutions. The authors propose the usage of blockchain technology and the data highway protocol to create a decentralized stock exchange that can potentially eliminate these disadvantages. The data highway protocol is used to generate new blocks with a flexible finality condition that allows for the consensus mechanism to configure security thresholds more freely. The proposed framework is compared with existing frameworks to confirm its effectiveness and identify areas that require improvement. The evaluation of the proposed approach showed that the improved highway protocol boosted the transaction rate compared to the other two mechanisms (PoS and PoW). Specifically, the transaction rate of the proposed model was found to be 2.2 times higher than that of PoS and 12 times higher than that of the PoW consensus model.

Providing security to user information are the most important aspects of today’s internet applications. Due to the very fast increase in the internet applications, the value of data exchange also became important. Hence, the better security and fast processing of the system is at high demand in the communication-related communities. Cryptography is one such area of providing data security. The two major criteria that specify the significance of a cryptographic algorithm are the security provided against the various attacks and the time to perform the operations. The proposed system is a solution to the cryptographic system to reduce the time complexity by retaining the security of the algorithm as it is. The solution proposed is to reduce the processing time required for the XOR function. This solution is by generating; XOR values for the vector space mentioned by the tuple, later replace the same wherever required. These values of XOR depend on the tuple, which represents the vector. Algorithm and time complexity for the generation of the vector space of XOR values for the proposed space evaluated. The result of the work compared based on two Standard symmetric-key cipher systems, Advanced Encryption Standard (AES) and Blowfish. The results are also tested and analyzed for different data size for the time complexity.

Now a days transferring of texts, documents over the internet are the tasks in common. The transferred text must be cryptographically protected so that cannot be accessed by the invaders. In the communication medium, protected data uses cryptographic techniques and random bit generators. Once the key is generated by the random generators, how well we can secure and transmit fast in the network plays a vital role by applying appropriate algorithm. As a solution, a system is developed by symmetric algorithmic approach, uses AES and Fiestel content and also implements three different ways of random generators such as pseudorandom number generator (PRNG), linear multiples of prime sequence based method and nonlinear prime methods. Multilevel encryption and decryption techniques are adopted in the solution to transfer the information over the network securely with reduced delay. This method provides very strong technique against different kinds of attacks.