Complete Security Analysis Research Articles

A collaborative auditing scheme with dynamic data updates based on blockchain

Cloud data auditing is essential to ensure the integrity of cloud data. The main idea of cloud auditing is to entrust the audit task to a third-party auditor (TPA) with powerful computing ability. However, TPA may lead to data leakage and become the single point of failure. Recently, blockchain has been introduced to solve these problems by TPA. However, the dynamic storage structure developed by traditional cloud storage does not apply to the blockchain. This paper proposes a blockchain-based collaborative public auditing scheme for dynamic data. We design the cloud service provider(CSP) to generate a challenge set using the latest block hash. It does not need to interact with the blockchain in the challenge phase, dramatically reducing communication overhead. In addition, considering economic factors, we allow users to seek partners to reduce audit costs. The EigenTrust model evaluates the reputation of each user's audit behaviour, effectively avoiding the probability of malicious users participating. For data update, we introduce the Pseudo Index Linked List(PIL) index management structure, which reduces the size of the index management structure to adapt to the blockchain's characteristics and makes the update operation have a constant time complexity. Through a complete security analysis and performance evaluation, we proved the security and effectiveness of the scheme.

Pseudorandom number generator based on novel 2D Hénon-Sine hyperchaotic map with microcontroller implementation.

Recently, chaotic maps have been considered to design pseudorandom number generator (PRNG). However, some chaotic maps present security disadvantages, such as low uniformity and low randomness properties. Nowadays, chaos-based PRNGs are used as the main source for the development of cryptographic algorithms. In this work, to overcome such weaknesses, a novel 2D hyperchaotic map is proposed based on discrete-time feedback by using Hénon map and Sine map. In addition, the dynamics of the hyperchaotic map are enhanced by using the remainder after division function (rem), where better random statistical properties are obtained. A comparison is made between the enhanced Hénon-Sine hyperchaotic map (EHSHM) and the Hénon-Sine hyperchaotic map through Lyapunov exponent analysis, attractor trajectory, histograms and sensitivity at initialization. Then, 8-bit pseudorandom number generator based on the proposed hyperchaotic map (PRNG-EHSHM) is designed and the initial seed of the PRNG is calculated by a secret key of 60 hexadecimal characters. It is implemented in both MATLAB and Arduino Mega microcontroller for experimental results. A complete security analysis is presented from a cryptographic point of view, such as key space, floating frequency, histograms and entropy of the information. Moreover, the randomness is verified with the tests of the National Institute of Standards and Technology (NIST 800-22). Based on the security results obtained, the proposed PRNG-EHSHM can be implemented in embedded cryptographic applications based on chaos.

Blockchain-Enabled Federated Learning Data Protection Aggregation Scheme With Differential Privacy and Homomorphic Encryption in IIoT

With rapid growth in data volume generated from different industrial devices in IoT, the protection for sensitive and private data in data sharing has become crucial. At present, federated learning for data security has arisen, and it can solve the security concerns on data sharing by model sharing on Internet of mutual distrust. However, the hackers still launch attack aiming at the security vulnerabilities (e.g., model extraction attack and model reverse attack) in federated learning. In this article, to address the above problems, we first design an application model of blockchain-enabled federated learning in Industrial Internet of Things (IIoT), and formulate our data protection aggregation scheme based on the above model. Then, we give the distributed K-means clustering based on differential privacy and homomorphic encryption, and the distributed random forest with differential privacy and the distributed AdaBoost with homomorphic encryption methods, which enable multiple data protection in data sharing and model sharing. Finally, we integrate the methods with blockchain and federated learning, and provide the complete security analysis. Extensive experimental results show that our aggregation scheme and working mechanism have the better performance in the selected indicators.

Security of multiple RGB images in the time domain and frequency domain

Secure and efficient transmission of images from a sender to a receiver through the public channel has become a prime agenda. An encryption algorithm to secure three color images simultaneously using matrix affine cipher, factional discrete cosine transform and Arnold transform is proposed in this paper. In earlier proposed algorithms, pixel intensities were not changed but rather shifted. In our proposed algorithm, pixel intensities are both shifted and changed. The color maps of the three color images are extracted to convert three color images into three indexed images respectively. The three indexed images are taken as R(red), G(green) and B(blue) channels of a color image. The color image is encrypted using the proposed encryption algorithm. The encryption algorithms for the security of color images proposed so far are secure either in time domain or in frequency domain, but the proposed encryption algorithm is secure in both the time and the frequency domain without any loss of data. The security of the proposed encryption algorithm depends not only upon secret keys but also upon the correct arrangement of the secret keys as compared to existing similar encryption algorithms whose security depends only upon secret keys. The encrypted(cipher) image is a single color image and is favorable for secure and efficient transmission over the public channel. Simulation is done with standard examples to analyze the validity of the proposed encryption scheme. We have provided the complete security analysis, statistical analysis and comparison with the existing similar encryption algorithms.

Security Analysis of Out‐of‐Band Device Pairing Protocols: A Survey

Numerous secure device pairing (SDP) protocols have been proposed to establish a secure communication between unidentified IoT devices that have no preshared security parameters due to the scalability requirements imposed by the ubiquitous nature of the IoT devices. In order to provide the most user‐friendly IoT services, the usability assessment has become the main requirement. Thus, the complete security analysis has been replaced by a sketch of a proof to partially validate the robustness of the proposal. The few existing formal or computational security verifications on the SDP schemes have been conducted based on the assessment of a wide variety of uniquely defined security properties. Therefore, the security comparison between these protocols is not feasible and there is a lack of a unified security analysis framework to assess these pairing techniques. In this paper, we survey a selection of secure device pairing proposals that have been formally or computationally verified. We present a systematic description of the protocol assumptions, the adopted verification model, and an assessment of the verification results. In addition, we normalize the used taxonomy in order to enhance the understanding of these security validations. Furthermore, we refine the adversary capabilities on the out‐of‐band channel by redefining the replay capability and by introducing a new notion of delay that is dependent on the protocol structure that is more adequate for the ad hoc pairing context. Also, we propose a classification of a number of out‐of‐band channels based on their security properties and under our refined adversary model. Our work motivates the future SDP protocol designer to conduct a formal or a computational security assessment to allow the comparability between these pairing techniques. Furthermore, it provides a realistic abstraction of the adversary capabilities on the out‐of‐band channel which improves the modeling of their security characteristics in the protocol verification tools.

A new one time password mechanism for client-server applications

OTP (One Time Passwords) are very important in today’s scenario in various applications like in financial transactions, e-commerce etc. They are used for enhancing the security of data communication. Many security applications are based on the strength of OTP. Any prediction in OTP generation can create serious threats to information security. Many new methods have been presented by researchers for OTP generation in the past decade. In this paper, we present a new authenticated OTP generation procedure between client and server. We also provide illustration with complete security analysis in order to prove its utility in various applications. Our procedure is implementable very easily and has embedded authentication and randomness.

Enhanced secure sharing of PHR’s in cloud using user usage based attribute based encryption and signature with keyword search

Cloud based Personal health record (PHR) is an emerging cloud based platform for exchanging a person’s health information in a secure manner. There occur many security issues when records of the data owners are outsourced through the third party cloud providers. The health records which are sensitive must be stored and retrieved through a secure source without any loss in the data. Nevertheless sharing and searching of the data is the key aspect, but when it is outsourced undeniably it is a cumbersome task. It may lead to unveil the sensitive information and so the records may become vulnerable to the hackers. In this report, we have suggested a novel access control structure called as user usage based encryption constructed on the searchable attribute based encryption to guarantee the data protection. Usage is mapped as credential with a time frame to every private attribute. The data user can decipher a fortified attribute only if there is a match between the credentials associated with the attribute. Using the feature extraction algorithm the searchable encryption scheme enables a consistent routing of encrypted attributes. Multi-Credential routing is applied to strengthen the confidentiality of the fragile records. We allow the data user to perpetuate the credentials according to their usage criteria also the user receives the keys as labels along with the credentials. The data owner will be able to associate each enciphered attribute with a set of credentials. Before beginning the encryption scheme we apply the singular value decomposition algorithm to the unutilized or less used attributes to reduce the attribute set. Additionally the data user confidentiality pitfalls are tackled using the semantic clustering of data user. To preserve the data user confidentiality reliable overlay privacy preserving protocol is designed. We manifest a complete security analysis so that our recommended system dominates the up to date approaches in terms of communication and ciphering cost.

A Double Chaotic Layer Encryption Algorithm for Clinical Signals in Telemedicine.

Recently, telemedicine offers medical services remotely via telecommunications systems and physiological monitoring devices. This scheme provides healthcare delivery services between physicians and patients conveniently, since some patients can not attend the hospital due to any reason. However, transmission of information over an insecure channel such as internet or private data storing generates a security problem. Therefore, authentication, confidentiality, and privacy are important challenges in telemedicine, where only authorized users should have access to medical or clinical records. On the other hand, chaotic systems have been implemented efficiently in cryptographic systems to provide confidential and privacy. In this work, we propose a novel symmetric encryption algorithm based on logistic map with double chaotic layer encryption (DCLE) in diffusion process and just one round of confusion-diffusion for the confidentiality and privacy of clinical information such as electrocardiograms (ECG), electroencephalograms (EEG), and blood pressure (BP) for applications in telemedicine. The clinical signals are acquired from PhysioBank data base for encryption proposes and analysis. In contrast with recent schemes in literature, we present a secure cryptographic algorithm based on chaos validated with the most complete security analysis until this time. In addition, the cryptograms are validated with the most complete pseudorandomness tests based on National Institute of Standards and Technology (NIST) 800-22 suite. All results are at MATLAB simulations and all them show the effectiveness, security, robustness, and the potential use of the proposed scheme in telemedicine.

ANU: an ultra lightweight cipher design for security in IoT

AbstractThis paper proposes an ultra lightweight cipher ANU. ANU is a balanced Feistel‐based network. ANU supports 64 bit plaintext and 128/80 bit key length, and it has total 25 rounds. It needs only 1015 gate equivalents for 128 bit key length that is less as compared with all existing lightweight ciphers. Its memory size is minimal, and power consumption is very less. It needs only 22 mW of dynamic power, while PRESENT cipher consumes 39 mW of power. This paper furnishes the complete security analysis of the ANU cipher design. Our security analysis shows that ANU can attain ample security level against linear and differential cryptanalysis, biclique attack, zero‐correlation attack, and algebraic attack. Biclique cryptanalysis provides maximal data complexity of 264. ANU cipher not only needs less gate equivalents but also it consumes very less power and has less memory requirement. ANU cipher is best suited for applications like Internet of Things. The design of ANU cipher will have a positive impact in the field of lightweight cryptography. Copyright © 2016 John Wiley & Sons, Ltd.

Implementation of an improved chaotic encryption algorithm for real-time embedded systems by using a 32-bit microcontroller

Currently, several embedded applications in military, industry, banking transference, e-commerce, biometric systems and others use insecure communication channels such as Internet to transmit or store confidential information. Therefore, the integrity and security of information are an important issue in continuous research. In last years, chaotic systems have been proposed in cryptography due they have several properties related with cryptography properties such as extreme sensibility on initial conditions with confusion and ergodicity with diffusion. In this paper, we present a 32-bit microcontroller implementation of an improved text encryption algorithm (based on Murillo-Escobar’s algorithm [13]) for real-time embedded systems and we present a complete security analysis such as key size analysis, key sensitivity, plain text sensitivity, floating frequency, histograms, N-grams, autocorrelation, information entropy, robustness against classic attacks, randomness analysis, and security characteristics. In addition, the digital implementation and performance are analyzed such as programming details, memory required, frequency system, implementation costs and encryption time. In contrast with recent approaches presented in literature, we present a complete security analysis in both statistical and implementation level, to justify the proposed scheme in a real application. Based in the results, the proposed embedded text encryption system is secure, effective and at low cost, and it could be implemented in real-time cryptosystem based on microcontroller.

A Fingerprint Image Encryption Scheme Based on Hyperchaotic Rössler Map

Currently, biometric identifiers have been used to identify or authenticate users in a biometric system to increase the security in access control systems. Nevertheless, there are several attacks on the biometric system to steal and recover the user’s biometric trait. One of the most powerful attacks is extracting the fingerprint pattern when it is transmitted over communication lines between modules. In this paper, we present a novel fingerprint image encryption scheme based on hyperchaotic Rössler map to provide high security and secrecy in user’s biometric trait, avoid identity theft, and increase the robustness of the biometric system. A complete security analysis is presented to justify the secrecy of the biometric trait by using our proposed scheme at statistical level with 100% of NPCR, low correlation, and uniform histograms. Therefore, it can be used in secure biometric access control systems.

A robust embedded biometric authentication system based on fingerprint and chaotic encryption

Fingerprint recognition is a reliable solution in user authentication systems. Nevertheless, the security and secrecy of the users data are a concern in today’s biometric systems and most of the security attention is focused in biometric template protection to avoid identity theft. In recent years, several approaches have been presented where the main objective is to have the biometric revocable, but almost all them have failed in verify their security and robustness. In last years, chaotic systems have been proposed in cryptography due they have several properties related with cryptography properties such as extreme sensibility on initial conditions with confusion and ergodicity with diffusion. In this paper, we present a novel fingerprint template protection scheme based on chaotic encryption by using the logistic map and Murillo-Escobar’s algorithm (Murillo-Escobar et al., 2014). In addition, we present a novel implementation of our scheme in a 32 bit microcontroller for secure authentication systems to show its application on embedded expert systems. In contrast with recent approaches presented in literature, we present a complete security analysis in both statistical and implementation level, to justify the proposed scheme in a real application. Based in the results, the proposed embedded authentication system is secure, effective and at low cost, and it could be implemented on real secure access control systems.

Enhanced Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data

To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data uct keyword search. Related works on searchable encryption emphasis on single keyword based search or Boolean keyword based search, and hardly work on sorting the search results. Our work focuses on realizing secure semantic search through query keyword semantic extension. We mix-ups and used architecture of two clouds, explicitly private cloud and public cloud. The search process is distributed into two steps. The leading step develops the question keyword upon warehoused database in the private cloud. The subsequent step uses the drawn-out query keywords set to recover the index on public cloud. Finally the matched files are resumed in order. Complete security analysis shows that our explanation is privacy-preserving and secure. Trial evaluation determines the efficiency and effectiveness of the scheme.

A simple coherent attack and practical security of differential phase shift quantum cryptography

The differential phase shift quantum key distribution protocol reveals good security against such powerful attacks as unambiguous state discrimination and beam splitting attacks. Its complete security analysis is complex due to high dimensions of the supposed spaces and density operators. In this paper, we consider a particular and conceptually simple coherent attack, available in practical implementations. The main condition for this attack is the length of used coherent state tuples of order 8–12. We show that under this condition, no high level of practical distance between legitimate users can be achieved.

Experimental Bit Commitment Based on Quantum Communication and Special Relativity

Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information. Perfect security is however possible when Alice and Bob split into several agents exchanging classical and quantum information at times and locations suitably chosen to satisfy specific relativistic constraints. Here we report on an implementation of a bit commitment protocol using quantum communication and special relativity. Our protocol is based on [A. Kent, Phys. Rev. Lett. 109, 130501 (2012)] and has the advantage that it is practically feasible with arbitrary large separations between the agents in order to maximize the commitment time. By positioning agents in Geneva and Singapore, we obtain a commitment time of 15 ms. A security analysis considering experimental imperfections and finite statistics is presented.

A low overhead scaled equalized harmonic-based voice authentication system

With the increasing trends of mobile interactions, voice authentication applications are in a higher demand, giving rise to new rounds of research activities. Authentication is an important security mechanism that requires the intended communication parties to present valid credentials to the communication network. In a stronger sense, all the involved parties are required to be authenticated to one another (mutual authentication).In the voice authentication technique described in this paper, the voice characteristics of an intended individual wishing to take part in a communication channel will be classified and processed. This involves a low overhead voice authentication scheme, which features equalization and scaling of the voice frequency harmonics. The performance of this system is discussed in a Labview 8.5 visual development environment, following a complete security analysis.

The future of security visualization: Lessons from network visualization

Approaches in security visualization have made significant progress in addressing challenges in the ever changing landscape of network security. However, many approaches are limited in both scope and scale, especially when we consider the complexity of the complete security analysis process. In this article, we review several notable recent systems in security visualization, examining their relative strengths and limitations. We then show that recent research in general network visualization, which often deals with domains other than security, provides new visual metaphors and interaction techniques that will help address limitations in security visualization systems. We examine several of these network visualization approaches in detail, and discuss how they can be applied to meet the challenges of the next generation of security visualization systems.

Multi-identity management for identity-based cryptography

In identity-based (or ID-based) cryptography, user identities can be employed as public keys, where each public key maps a unique private key generated by a trusted authority usually called Private Key Generator (PKG). In some situations, a user could hold multiple identities; therefore, he has to manage the same number of private keys. This adds extra work to the user, especially when the number is large. In this paper, we tackle this issue by proposing two novel key management schemes that allow a single private key to map multiple public keys (identities). We name them Multi-Identity-Based Encryption (MIBE) and Mutable Identity-Based Signature (MIBS), respectively. In MIBE scheme, a single private key can be used to decrypt multiple ciphertexts encrypted with different public keys associated to the single private key. In MIBS, there is only a single private key that maps various public keys (identities).We refer to this property of public keys as mutable. We also provide complete security analysis to our schemes.

A parallel complete method for real-time security analysis in power systems

Abstract In this paper is presented a proposal for real-time implementation of complete security analysis for power system. The proposed algorithm is derived from boundary methods and exploits adaptively the ‘local’ concept combined with distributed processing. The proposal is inserted on the Modern Energy Management Systems model and results of simulations with real-life networks considering single and multiple contingencies, are also reported.