In this work we present a new algorithm that achieves the perfect Shannon secret by means of the XOR function and a method that we call multiple key reuse. The algorithm has two execution modes: message authentication and data encryption. The XOR encryption scheme allows for batch encryption and exhibits Perfect Forward Secrecy (PFS). Furthermore, based on our fundamental algorithm, we have developed a new strategy for blockchain implementation that does not require Proof of Work (PoW), but defines a fair mechanism for miner selection and secure addition of blocks to the chain. Since our method is mainly based on the Boolean XOR function, the strength of the cryptosystem can be directly established thanks to its mathematical properties. Due to the risk that quantum computers represent for current cryptosystems based on prime factorization or discrete logarithm, we postulate that our method represents a promising alternative in the quantum era for the security of communications between Internet of Things devices as well as Blockchain technology.

Data could be in many forms like text, image, audio, video and many others. Amongst these data, processing image is of important concern even with sophisticated technologies. Generally, images consume more storage space and processing time. This work aims in attaining a novel image encryption strategy that consumes very less computational time with maximum security. The idea is to split the image into blocks and rearrange the pixels in diagonal fashion to achieve confusion. Next, the blocks are combined to form sub images and one block of the sub image is subjected to Secure Hash Algorithm (SHA 512 bits). The SHA bits are XORed with the remaining blocks of the sub image. Finally, the entire image is encrypted using Advanced Encryption Standard (AES). Decryption process is the exact reverse of encryption process. The computational overhead is very low, and security is efficient. The results are compared with existing encryption techniques.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

Within an Internet of Multimedia Things, the risk of disclosing streamed video content, such as arising from video surveillance, is of heightened concern. This leads to the encryption of that content. To reduce the overhead and lack of flexibility arising from full encryption of the content, a good number of selective-encryption algorithms have been proposed in the last decade. Some of them have limitations, in terms of significant delay due to computational cost, or excess memory utilization, or, despite being energy efficient, do not provide a satisfactory level of confidentiality, due to their simplicity. To address such issues, this paper presents a lightweight selective encryption scheme, in which encoder syntax elements are encrypted with the innovative EXPer (EXtended Permutation with exclusive OR). The selected syntax elements are taken from the final stage of video encoding that is during entropy coding. As a diagnostic tool, the Encryption Space Ratio measures encoding complexity of the video relative to the level of encryption so as to judge the success of the encryption process, according to entropy coder. A detailed comparative analysis of EXPer with state-of-the-art algorithms confirms that the EXPer provides significant confidentiality with a small computational cost and negligible encryption bitrate overhead. Thus, the results demonstrate that the proposed security scheme is a suitable choice for constrained devices in an Internet of Multimedia Things environment.

(1) Background: As Patient-reported outcome measures face challenges with low response rate on surveys, different incentive mechanism have been proposed to achieve a higher response rate. However, it seems that monetary incentives are the only mechanism with proven effect. Nevertheless, it is less likely to be used than other mechanisms due to the monetary cost. (2) Methods: In this research work, a cryptographic scheme for rewarding patients with cryptographic tokens is developed and implemented on the Ethereum test network. (3) Results: The model is able to distribute decentralised tokens to patients who complete the PROMs in a fair, private, decentralised approach. The token can be further used by patients to exchange more healthcare services, encouraging more patients to participate in PROMs. At the same time, an IER detection method is built to improve the quality of PROMs, avoiding the healthcare provider paying for meaningless PROMs from patients who barely participate for incentives. (4) Conclusions: This work provides an privacy-preserving incentive model to increase the response rate for PROMs surveys. Our model prevents patients providing invalid responses to gain rewards.

In this paper, different cryptography algorithms were reviewed, and their relative merits were discussed. Symmetric and asymmetric cryptography algorithms were compared for time and space efficiencies. These experiments were run to measure the execution time and the memory footprints of various algorithms to understand the implications of their real-life applications. In the experiment performed, it was observed that elliptic curve cryptography was the most efficient in terms of encryption/decryption time, as well as memory usage.

When we talk about the Internet of Things, we are referring to the connecting of things to a1 physical network that is embedded with software, sensors, and other devices that allow information2 to be exchanged between devices. It is possible that the interconnection of devices will present3 issues in terms of security, trustworthiness, reliability, and confidentiality, among other things.4 The proposed approach is effective at detecting intrusions into the Internet of Things network.5 Initially, the privacy-preserving technology was deployed utilising a Blockchain-based methodology6 to ensure that personal information was protected. Patients’ health records (PHR) security is the7 most crucial component of encryption over the Internet because of the value and importance of these8 records, particularly in the context of the Internet of Medical Things (IoMT). The search terms access9 mechanism is one of the most common approaches used to access personal health records from a10 database, but it is vulnerable to a number of security flaws. However, while blockchain-enabled11 healthcare systems provide increased security, they may also introduce weaknesses into the current12 state of the art. Blockchain-enabled frameworks have been proposed in the literature as a means13 of resolving those challenges. These solutions, on the other hand, are primarily concerned with14 data storage, with Blockchain serving as a database. To enable secure search and keyword-based15 access to a distributed database, this study proposes the use of blockchain technology as a distributed16 database, together with a homomorphic encryption mechanism. Aside from that, the suggested17 system includes a secure key revocation mechanism that can be used to automatically update various18 policies.As a result, our proposed approach provides greater security, efficiency, and transparency19 while also being more cost-effective. We have compared the findings of our proposed models with20 those of the benchmark models, if appropriate. Our comparison research demonstrates that our21 suggested framework provides a more secure and searchable mechanism for the healthcare system22 than the current state of the art.

The focus of this research is to analyze the results of encrypting audio using various authenticated encryption algorithms implemented in the Python cryptography library for ensuring authenticity and confidentiality of the original contents. The Advanced Encryption Standard (AES) is used as the underlying cryptographic primitive in conjunction with various modes including Galois Counter Mode (GCM), Counter with Cipher Block Chaining Message Authentication Code (CCM), and Cipher Block Chaining (CBC) with Keyed-Hashing for encrypting a relatively small audio file. The resulting encrypted audio shows similarity in the variance when encrypting using AES-GCM and AES-CCM. There is a noticeable reduction in variance of the performed encodings and an increase in the amount of time it takes to encrypt and decrypt the same audio file using AES-CBC with Keyed-Hashing. In addition, the corresponding encrypted using this mode audio spans a longer duration. As a result, AES should either have GCM or CCM for an efficient and reliable authenticated encryption integration within a workflow.

With the emerging technology connected with the internet, there is one constant issue related to that is data security. The only solution with which this issue can be resolved at a limit and can be used to protect the data is various algorithms for encryption. Though different approaches were used for the same, Cryptography seems to be efficiently protecting the data while transmitting in network from sender to receiver. Firstly the data is encrypted before sending to receiver using the most secure and reliable encryption algorithm. Secondly, at the receiver end it can be decrypted using the same decryption algorithm. Only receiver will have the key with which the data can be decrypted. In this paper, AES, DSS and RSA algorithms were implemented. These algorithms are encryption algorithms which perform encoding and decoding of data, to be sent from sender to receiver, using the keys. Each have different criteria for encryption and are then compared based on different parameters viz. delay, throughput, PDR is an acronym for packet delivery ratio, PLR represents packet loss ratio and RPC denotes Received Packet Count. The results in the form of graphs are given to analyze the security provided by each algorithm.

In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.

One of the most reliable methods of authentication used today is biometric matching. This authentication process, which is done by using biometrics information such as fingerprint, iris, face, etc. is used in many application areas. Authentication at border gates is one of these areas. However, some restrictions have been introduced to storing and using such data, especially with the General Data Protection Regulation (GDPR). The main goal of this work is to find the practical implementation of fully homomorphic encryption-based biometric matching in border controls. In this paper, we propose a biometric authentication system based on hash expansion and fully homomorphic encryption features, considering these restrictions. One of the most significant drawbacks of the homomorphic encryption method is the long execution time. We solved this problem by executing the matching algorithm in parallel manner. The proposed scheme is implemented as proof-of-concept in the SMILE, and its advantages in privacy preservation has been demonstrated.

String matching is an important part in many real world applications. It must robust against variations in string field. In record linkage for two different datasets matching should detect two patients in common in spite of small variations. But it becomes difficult in case of confidential data because sometimes data sharing between organizations become restricted for privacy purposes. Several techniques have been proposed on privacy-preserving approximate string matching such as Secure Hash Encoding etc. Relative to other techniques for approximate string matching Homomorphic encryption is very new. In this paper we have proposed a Homomorphic Encryption based approximate string matching technique for matching multiple attributes. There is no solution currently available for multiple attributes matching using Homomorphic encryption. We have proposed two different methods for multiple attributes matching. Compare to other existing approaches our proposed method offers security guarantees and greater matching accuracy.

This paper proposes an encryption scheme for high pixel density images. Based on the application of the quantum random walk algorithm, the Long short-term memory (LSTM) can effectively solve the problem of low efficiency of the quantum random walk algorithm in generating large-scale pseudorandom matrices, and further improve the statistical properties of the pseudorandom matrices required for encryption. The LSTM is then divided into columns and fed into the LSTM in order for training. Due to the randomness of the input matrix, the LSTM cannot be trained effectively, so the output matrix is predicted to be highly random. The LSTM prediction matrix of the same size as the key matrix is generated based on the pixel density of the image to be encrypted, which can effectively complete the encryption of the image. In the statistical performance test, the proposed encryption scheme achieves an average information entropy of 7.9992, an average number of pixels changed rate (NPCR) of 99.6231%, an average uniform average change intensity (UACI) of 33.6029% and an average correlation of 0.0032. Finally, various noise simulation tests are also conducted to verify its robustness in real-world applications where common noise and attack interference are encountered.

Machine Learning has completely transformed health care system, which transmits medical data through IOT sensors. So it is very important to encrypt them to protect patient data. encrypting medical images from a performance perspective consumes time; hence the use of an auto encoder is essential. An auto encoder is used in this work to compress the image as a vector prior to the encryption process. The digital image passes across description function and a decoder to get back the image in the proposed work; various experiments are carried out on hyper parameters to achieve the highest outcome of the classification. The findings demonstrate that the combination of Mean Square Logarithmic Error as the loss function, ADA grad as an optimizer, two layers for the encoder, and another reverse for the decoder, RELU as the activation function generates the best auto encoder results. The combination of Mean square error (lose function), RMS prop (optimizer), three layers for the encoder and another reverse for the decoder, and RELU (activation function) has the best classification result. All the experiments with different hyper parameter has run almost very close to each other even when changing the number of layers. The running time is between 9 and 16 second for each epoch.

There are introduced two new steganalytic methods not depending on the statistics of the cover objects, namely side attacks stegosystems. The first one assumes that the plaintext, encrypted before embedding, is known by the attacker. In this case, the stegosystem’s detection is based on the calculation of mutual information between message and extracted encrypted data. For this calculation, a notion of the k-nearest neighbor distance is applied. The second method is applied to HUGO, one of the most efficient steganographic algorithms. In this case the stegosystem’s detection is based on a verification of the NIST tests to the extracted encrypted messages. Moreover, we show that the problem to find a submatrix of­ the embedding matrix determining a trellis code structure in the HUGO algorithm provides a search of the stegokey of the proposed stegosystem.

In this age of internet communication, the security of digital information is one of the main issues. The privacy of data depends upon the encryption using some secure algorithm. The selection of robust cryptosystems to ensure confidentiality is a major concern to decrease the risk of cryptographic attacks. In this article, we have implemented a grey theory-based decision-making technique for the election of a robust cryptosystem that complies with all the cryptographic parameters. Six different already proposed encryption algorithms are selected as the alternatives of the decision-making problem and the parameters concerned for the decision are entropy, correlation coefficient, the number of pixels changing rate (NPCR), unified average changing intensity (UACI). The algorithm ranked as first by using grey-based decision-making method can be utilized for secure data encryption.

A lightweight image encryption algorithm based on chaos induction via a 5-dimensional hyperjerk oscillator (5DHO) is presented. First, the dynamics of our 5DHO network is investigated and shown to exhibit up to five coexisting hidden attractors in the state space that depend exclusively on the system’s initial values. Further, a simple implementation of the circuit was used to validate its ability to exhibit chaotic dynamical properties. Second, an Arduino UNO platform is used to confirm the usability of our oscillator in digital implementation of the system. Finally, an efficient image encryption application is executed using the proposed chaotic networks based on the use of permutation-substitution sequences. The superior qualities of the proposed strategy are traced to the dynamic set of keys used in the substitution process which heralds the generation of the final ciphered image. Based on the results obtained from the entropy analysis (7.9976), NPCR values (99.62), UACI tests (33.69) and encryption execution time for 512x512 images (0.1179 sec), the proposed algorithm is adjudged to be fast and robust to differential and statistical attacks relative to similar approaches.

The IoT Internet of Things being a promising technology of the future. It is expected to connect billions of devices. The increased communication number is expected to generate data mountain and the data security can be a threat. The devices in the architecture are fundamentally smaller in size and low powered. In general, classical encryption algorithms are computationally expensive and this due to their complexity and needs numerous rounds for encrypting, basically wasting the constrained energy of the gadgets. Less complex algorithm, though, may compromise the desired integrity. In this paper we apply a lightweight encryption algorithm named as Secure IoT (SIT) to a quantized speech image for Secure IoT. It is a 64-bit block cipher and requires 64-bit key to encrypt the data. This quantized speech image is constructed by first quantizing a speech signal and then splitting the quantized signal into frames. Then each of these frames is transposed for obtaining the different columns of this quantized speech image. Simulations result shows the algorithm provides substantial security in just five encryption rounds.

Cloud Computing is a promising and emerging technology that is rapidly being adopted by many IT companies due to a number of benefits that it provides, such as large storage space, low investment cost, virtualization, resource sharing, etc. Users are able to store a vast amount of data and information in the cloud and access it from anywhere, anytime on a pay-per-use basis. Since many users are able to share the data and the resources stored in the cloud, there arises a need to provide access to the data to only those users who are authorized to access it. This can be done through access control schemes which allow the authenticated and authorized users to access the data and deny access to unauthorized users. In this paper, a comprehensive review of all the existing access control schemes has been discussed along with analysis. Keywords: role-based access control, attribute-based access control, attribute-based encryption

Although there are several access control systems in the literature for flexible policy management in multi-authority and multi-domain environments, achieving interoperability & scalability, without relying on strong trust assumptions, is still an open challenge. We present HMBAC, a distributed fine-grained access control model for shared and dynamic multi-authority and multi-domain environments, along with Janus, a practical system for HMBAC policy enforcement. The proposed HMBAC model supports: (a) dynamic trust management between different authorities; (b) flexible access control policy enforcement, defined at domain and cross-domain level; (c) a global source of truth for all entities, supported by an immutable, audit-friendly mechanism. Janus implements the HMBAC model and relies on the effective fusion of two core components. First, a Hierarchical Multi-Blockchain architecture that acts as a single access point that cannot be bypassed by users or authorities. Second, a Multi-Authority Attribute Based Encryption protocol that supports flexible shared multi-owner encryption, where attribute keys from different authorities are combined to decrypt data distributedly stored in different authorities. Our approach was implemented using Hyperledger Fabric as the underlying blockchain, with the system components placed in Kubernetes Docker container pods. We experimentally validated the effectiveness and efficiency of Janus, while fully reproducible artifacts of both our implementation and our measurements are provided.

In view of the problem of cracking easily and partial distortion of images after encryption or decryption, a novel image encryption and decryption algorithm based on Arnod Transform and fractional chaotic is proposed. To begin with, the Arnold transform is used to encrypt. So that the spatial confidence of the original image has been comprehensively disturbed. Secondly, the XOR involving the fractional order chaotic sequence is used to encrypt. The key sequence is dynamically generated to ensure the randomness and difference of key generation. When decryption is required, the first decryption is performed using the key and XOR. Then the second decryption is carried out by using the inverse Arnold transform, and finally the decrypted image is obtained. Experimental results show that the improved algorithm has achieved better performance in encryption and decryption.

Multi-receiver encryption enables a sender to encrypt a message and transmit the ciphertext to a set of authorized users, while no one out this group of authorized users can decrypt the message. Multi-receiver encryption is of great importance in many sectors such as broadcast communication, cloud computing, wireless communications, networking applications, e-voting, lottery, and medical applications. This paper proposes an efficient multi-receiver public key encryption scheme based on Lucas sequences. The results of the computational analysis show that, projected scheme is better against renown attacks and prevailing anonymous multireceiver algorithms

The scheme to realize high speed (~250Gb/s) all-optical Boolean logic gates using semiconductor optica amplifiers with quantum-dot (QD-SOA) is introduced and analyzed in this review. Numerical simulation method was presented by solving the rate equation and taking into account nonlinear dynamics including carrier heating and spectral hole-burning. Binary phase shift keyed (BPSK) signal and on-off keyed signal are used to generate high speed all-optical logic gates. The applications based on all-optical logic gates such as, all-optical latches, pseudo random bit sequence (PRBS) generation and all-optical encryption, are also discussed in this review. Results show that the scheme based on QD-SOA is a promising method for the realization of high speed all-optical communication system in the future.

In today’s digital media data communication over the internet increasing day by day. Therefore the data security becomes the most important issue over the internet. With the increase of data transmission, the number of intruders also increases. That’s the reason it is needed to transmit the data over the internet very securely. Steganography is a popular method in this field. This method hides the secret data with a cover medium in a way so that the intruders cannot predict the existence of the data. Here a steganography method is proposed which uses a video file as a cover medium. This method has five main steps. First, convert the video file into video frames. Then a particular frame is selected for embedded the secret data. Second, the Least Significant Bit (LSB) Coding technique is used with the double key security technique. Third, an 8 characters password verification process. Fourth, reverse the encrypted video. Fifth, signature verification process to verify the encryption and decryption process. These five steps are followed by both the encrypting and decrypting processes.

This paper presents a method for a decentralised peer-to-peer software license validation system using cryptocurrency blockchain technology to ameliorate software piracy, and to provide a mechanism for software developers to protect copyrighted works. Protecting software copyright has been an issue since the late 1970's and software license validation has been a primary method employed in an attempt to minimise software piracy and protect software copyright. The method described creates an ecosystem in which the rights and privileges of participants are observed.

As the embedded device and internet of things (IoTs) concept prevalent in today's world, there is an increasing demand for the security and performance requirements on deploying these devices to private and public sectors. The crucial part of it is to protect privacy, confidentiality and integrity, meanwhile, maintain an adequate level of performance during transmission, storage and access of critical information. While the conventional cryptography methods, such as the Advanced Encryption Standard (AES), SHA$-$2 hashing method and RSA and Diffie Hellman for message authentication and identification, work well on systems which have reasonable processing power and memory capabilities. These do not scale well into a world with embedded systems and sensor networks, in conjunction with their nature of smaller size and lower cost. Thus, in the context of resource constrained device, lightweight cryptography methods are proposed to overcome many of the problems of conventional cryptography possessed. This includes constraints related to physical size, processing requirement, memory limitation, energy drain and production cost. This paper provides a survey of the architectures that are defined as replacements for conventional ciphers within an IoTs space and discuss some trends in the design of future lightweight algorithms. The performance metrics are carefully chosen to reflect and assess the suitability for embedded devices. The aim of this research is to identify the various performance metrics applied on different types of symmetric block ciphers especially lightweight ciphers and compare the results on versatile platforms with stream ciphers and public key methods. The comparative analysis on efficient LW cipher will be tested against other similar block ciphers on both MacBook Pro with Intel core and resource constrained device Raspberry Pi with ARM processor.

Compressive sensing (CS) is a technique that allows a signal vector to be reconstructed with a number of linear measurements far fewer than its size. In this study, optical hybrid cryptography with simultaneous compressive sensing based on orthogonal matching pursuit (OMP) is proposed as an alternative solution to the two important problems in communications, namely, effective / efficient / signal processing and secure encryption/decrypton. The whole system is able to both compress and encrypt data with attack immunity.