Key Cryptosystem Research Articles

A TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM

The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.

New Key Agreement Protocol and Cryptosystem over ECC under SET Protocol Environment in E-Commerce

New Key Agreement Protocol and Cryptosystem over ECC under SET Protocol Environment in E-Commerce

Key Aggregation Cryptosystem and Double Encryption Method for Cloud-Based Intelligent Machine Learning Techniques-Based Health Monitoring Systems.

Cloud technology is a business strategy that aims to provide the necessary material to customers depending on their needs. Individuals and cloud businesses alike have embraced the cloud storage service, which has become the most widely used service. The industries outsource their data to cloud storage space to relieve themselves of the load of dealing with redundant data contents. This must be protected to prevent the theft of personal belongings, and privacy must be improved as well. Different research projects have been suggested to ensure the safe management of the information included within the data content. The security of current research projects, on the contrary, still needs improvement. As a result, this method has been suggested to address the security concerns associated with cloud computing. The primary goal of this study effort is to offer a safe environment for cloud users while also increasing the profit of cloud resource providers by managing and securely delivering data contents to the cloud users. The bulk of sectors, including business, finance, military, and healthcare industry, do not store data in cloud-based storage systems. This technique is used to attract these kinds of customers. Increasing public acceptance, medical researchers are drawn to cloud computing because it allows them to store their study material in a centralized location and distribute and access it in a more flexible manner. They were collected from numerous individuals who were being evaluated for medical care at the time. Scalable and enhanced key aggregate cryptosystem is a protected data protection method that provides highly effective security in the healthcare industry. When parties interested in a dispute disagree on the outflow of sensitive information, this technique manages the disputes and ensures the data security deployment of a cloud-based intelligent health monitoring system for the parties involved. The encrypted data structure of medical and healthcare prescriptions is recorded as they move through the hands of patients and healthcare facilities, according to the technique recommended. The double encryption approach is used in order to raise the overall degree of security. An encryption class is created by referring to the Ciphertext ID during the encryption procedure. The keyholder is a master secret key that facilitates in the recovery of the secret keys of various monsters and creatures by acting as a conduit between them. It is transferred and stored as a single aggregate for the benefit of the patient or customer in order to make decryption more convenient and efficient. A safe connection between cloud-based intelligent health monitoring systems and healthcare organizations and their patients may be established via the use of a key aggregation cryptosystem and a double encryption approach, according to the researchers. Because of this, when compared to earlier techniques, the findings reveal that the research methodology provides high levels of security in terms of confidentiality and integrity, in addition to excellent scalability.

Sharing PHR Data in Cloud Using Sigmoid Key and Median Support Signature-Based Cryptosystem

Sharing PHR Data in Cloud Using Sigmoid Key and Median Support Signature-Based Cryptosystem

Implementation Diffie-Hellman by Using Standard Groups and Hosoya-Polynomial to Generate a Matrix as Key Cryptosystem

Implementation Diffie-Hellman by Using Standard Groups and Hosoya-Polynomial to Generate a Matrix as Key Cryptosystem

Identity-based key aggregate cryptosystem from multilinear maps

A key-aggregate cryptosystem (KAC) is the dual of the well-known notion of broadcast encryption (BE). In KAC, each plaintext message is encrypted with respect to some identity, and a single aggregate key can be generated for any arbitrary subset \begin{document}$ \mathcal{S} $\end{document} of identities, such that any ciphertext designated for any identity in \begin{document}$ \mathcal{S} $\end{document} can be decrypted using this aggregate key. A KAC scheme is said to be efficient if all public parameters, ciphertexts and aggregate keys have polynomial overhead, and can be generated using poly-time algorithms. A KAC scheme is said to be identity-based if remains efficient even when the number of unique identities supported by the system is exponential in the security parameter \begin{document}$ \lambda $\end{document} . Unfortunately, existing KAC constructions do not satisfy this property. In particular, adopting these constructions to the identity-based setting leads to public parameters with exponential overhead. In this paper, we propose new identity-based KAC constructions using multilinear maps that are secure in the generic multilinear map model, and are fully collusion resistant against any number of colluding parties. Our first construction is based on asymmetric multilinear maps, with a poly-logarithmic overhead for the public parameters, and a constant overhead for the ciphertexts and aggregate keys. Our second construction is based on the more generalized symmetric multilinear maps, and offers tighter security bounds in the generic multilinear map model. This construction has a poly-logarithmic overhead for the public parameters and the ciphertexts, while the overhead for the aggregate keys is still constant.

Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication

Moving target defense (MTD) strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to a quantum computer. In such a setting, today’s widely used cryptographic systems including Diffie-Hellman key agreement protocol and RSA cryptosystem will be insecure and alternative solutions are needed. We will use a physical assumption, existence of multiple communication paths between the sender and the receiver, as the basis of security, and propose a cryptographic system that uses this assumption and an MTD strategy to guarantee efficient long-term information theoretic security even when only a single path is not eavesdropped. Following the approach of Maleki et al., we model the system using a Markov chain, derive its transition probabilities, propose two security measures, and prove results that show how to calculate these measures using transition probabilities. We define two types of attackers that we call risk-taking and risk-averse and compute our proposed measures for the two types of adversaries for a concrete MTD strategy. We will use numerical analysis to study tradeoffs between system parameters, discuss our results, and propose directions for future research.

Secure data storage in cloud computing to avoiding some cipher text attack

Nowadays, cloud computing has become popular for storage of data. Yet, flexibility and security are the significant parameters for better transmission. Sharing data with others may lead to security and flexibility issues. Key cryptosystem is a technique in which, decryption rights for a set of cipher texts are efficiently assigned. Key aggregation will be performed by the power of all keys, when they are aggregated. But the delegated keys or aggregate keys stored in the mobile device are prompt to leakage. Hence, we need to design a leakage-resilient cryptosystem which reduces key leakage attacks. For leakage-resilient cryptosystem, we propose Hash-Proof System techniques; which will be applied on chosen cipher text key leakages and other key leakages. A number of cipher text classes are predefined in our approach.

A new cluster-based secure communication scheme for mobile ad hoc networks

Mobile ad hoc networks have attracted considerable interest because of their use by the military and emergency rescue personnel as well as in mining operations and vehicular networks. However, mobile ad hoc networks are more vulnerable to security attacks than other types of wireless networks, such as wireless local area network or 3G/LTE networks. As a countermeasure to attack, clustering is used, where each node must be authenticated with the corresponding clusterhead in the cluster, and all data must be encrypted. In this paper, a new cluster-based secure communication scheme is proposed in which mutual authentications are performed before data transmission. In contrast to conventional schemes that use public key infrastructure cryptosystems, resulting in serious overheads in terms of computation and communication, our authentication process uses a station-to-station protocol, which is in itself an extended version of the Diffie-Hellman key exchange protocol to establish authenticated context. Moreover, attacks like replay attacks and man-in-the-middle attacks can be prevented by additional security mechanisms in the authentication and communication processes such as hash-function message authentication codes. Our proposed scheme not only meets all the security requirements, but also supports efficient communication. Performance analysis demonstrates the superiority of our scheme to related schemes.

Formal Analysis and Verification of OAuth 2.0 Protocol Improved by Key Cryptosystems

The reasons which take huge losses to enterprises and users are: Open authorization (OAuth) 2.0 protocol is excessively dependent on Hyper text transfer protocol over secure socket layer (HTTPS) to transmit data and ignores per-message encryption, and the transmission efficiency of HTTPS is too low to work well under poor network. The improved OAuth 2.0 modified by Hyper text transfer protocol (HTTP), public key system and private key signature is proposed. With verifying the security of OAuth 2.0 by model checking technology, an improved protocol of higher security is acquired. Comparing different protocol modeling optimized by three combination optimization strategies which involve technologies such as type checking, static analysis and syntactic reordering, an optimal security verification model of the improved protocol is obtained. Program enumeration is presented to compute the repository of attacker. The modeling method of attacker above can effectively reduce the complexity of attacker modeling, consequently those methods can be applied to analyze and validate multi-principal protocols.

Security and Privacy-Preserving Metering Service in the Smart Grid

The deployment of smart metering provides an immense amount of data for power grid operators and energy providers. By using this data, a more efficient and flexible power grid can be realized. However, this data also raises privacy concerns since it contains very sensitive information about customers. In this paper, we present a security and privacy-preserving metering scheme for the community customers, by utilizing the password authenticated key exchange (PAKE) protocol and Elliptic Curve Cryptosystem (ECC). The proposed scheme will protect the community network from possible malicious behavior, and security analysis is also given in the paper.

Asymmetric Public Key Cryptography by Using Logic-based Optical Processing

In this paper, a new asymmetric public key cryptography based on the modified RSA algorithm is proposed by using logic-based optical processing. The proposed asymmetric public key algorithm is realized into an optical schematic, where AND, OR and XOR logic operations are implemented by using free space digital optics architecture. Schematically, the proposed optical configuration has an advantage of generating the public keys simultaneously. Another advantage is that the suggested optical setup can also be used for message encryption and decryption by simply replacing data inputs of SLMs in the optical configuration. The last merit is that the optical configuration has a 2-D array data format which can increase the key length easily. This can provide longer 2-D key length resulting in a higher security cryptosystem than the conventional 1-D key length cryptosystem. Results of numerical simulation and differential cryptanalysis are presented to verify that the proposed method shows the effectiveness in the optical asymmetric cryptographic system.

Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks

In order to tolerate possible leakage of secret keys, leakage-resilient cryptosystem models a class of attractive leakage output by allowing an adversary to provide any computable leakage function and learning the partial keys or other possible internal states from the output of function. In this work, we present an adaptively secure broadcast encryption resilient to key continual leakage in the standard model. Our scheme provides the tolerance of continual leakage, in which any user can generate multiple private keys per user by periodically updating the key. We use the dual system encryption mechanism to implement the leakage resilience and adaptive security, and intrinsically set an algorithm to refresh a key and produce a same distributed new key. We also give the evaluation of the leakage bound and leakage fraction, and the simulations show that our scheme can tolerate about 71% leakage fraction with 3.34 × 10−52 failure probability in standard 80-bit security level when we adjust the leakage factor to allow the private key to be 100 Kb.

Editorial for Security and Privacy in Wireless Networks Special Issue

Editorial: This special issue features five invited papers from experts working in the area of wireless security and privacy. The first article, “Trust-based routing mechanism in MANET: Design and Implementation”, discusses the challenging issues in MANET routing security. The authors present FrAODV, a trustbased scheme for securing AODVrouting protocol inMANET using the friendship mechanism. In their proposed scheme the nodes can evaluate the routing paths according to some selected features (such as node reputation and identity information) before forwarding the data through these routes. They have used two types of implementation in their scheme, simulation (using NS-2) and a real test-bed (using JADHOC). The proposed scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community. The second article, entitled “Performance of IEEE 802.11 under Jamming”, studies the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. The authors consider two channel-oblivious jammers: a periodic jammer that jams deterministically at a specified rate, and amemoryless jammer whose interfering signals arrive according to a Poisson process. They also develop new models for channel-aware jamming, including a reactive jammer that only jams noncolliding transmissions and an omniscient jammer that optimally adjusts its strategy according to current states of the participating nodes. The study comprises of a theoretical analysis of the saturation throughput of 802.11 under jamming, an extensive simulation study, and a testbed to conduct real world experimentation of jamming IEEE 802.11 using software defined radio (GNU Radio combined with USRP boards). In the third paper, “Adaptive Information Coding for Secure and Reliable Wireless Telesurgery”, a Telesurgical Robot System (TRS) is studied and the authors present a novel approach that uses information coding to integrate both light-weight privacy and adaptive reliability in a single protocol called Secure and Statistically Reliable UDP (SSR-UDP). They prove that the offered security is equivalent to the existing AES-based long key crypto systems, yet with significantly less computational overhead. They also demonstrate that the proposed scheme can meet high reliability and delay requirements of TRS applications in highly lossy environments while optimizing the bandwidth use. The fourth paper is entitled “Reverse authentication in financial transactions and identity management”, and the authors utilise the concept that new families of protocol, based on communication over human-based side channels, can permit secure pairing or group formation inways such that no party has to prove its name. In this model, individuals are able to hook up devices in their possession to others that they can identify by context. They examine a model in which, to prove his or her identity to a party, the user uses one of these human-interactive security protocols (or HISPs) to connect to it. Thus, when authenticating A to B, A authenticates a channel she has to B: the reverse direction. This can be characterised as bootstrapping a secure connection using human trust. This provides new challenges to the formal modelling of trust and authentication. In the fifth paper, titled “A privacy preserving method using privacy enhancing techniques for location based services”, the authors study the privacy issues relating to gathering of location information for non-trusted applications like locationbased marketing or user behaviour profiling. It shows how M. Rajarajan (*) Security Engineering, City University London, Northampton Square, EC1V 0HB London, UK e-mail: R.Muttukrishnan@city.ac.uk

Non-Interactive Authenticated Key Agreement over the Mobile Communication Network

A key agreement scheme is an important technique to establish a common secret over an insecure communication environment such as the Internet. In this paper, we elaborate on the merits of self-certified public key systems and bilinear pairing cryptosystems to propose an efficient and secure non-interactive authenticated key agreement (NI-AKA) scheme. The security of our scheme is proved to be computationally equivalent to the bilinear Diffie-Hellman problem (BDHP). In addition, the proposed scheme has the following advantages: (i) Two participants can easily establish a shared secret key between them without further interactions, so as to greatly reduce the possibility of leaking any security information of the shared secret key. (ii) Combining with self-certified public key systems, the proposed scheme makes it unnecessary to verify each other's public key in advance, since the authenticity of the public keys is simultaneously validated when the mutually shared secret key is correctly established. (iii) Based on the bilinear pairing cryptosystems over elliptic curves, our scheme is suitable for mobile applications with limited computing power and insufficient storage space, such as PDAs and cellular phones, etc.

A Generic Hybrid Encryption System (HES)

This study proposes a Generic Hybrid Encryption System (HES) under mutual committee of symmetric and asymmetric cryptosystems. Asymmetric (public key) Cryptosystems associates several performance issues like computational incompetence, memory wastages, energy consumptions and employment limitations on bulky data sets but they are quite secure and reliable in key exchange over insecure remote communication channels. Symmetric (private key) cryptosystems are 100 times out performed, having no such issues but they cannot fulfill non-repudiation, false modifications in secret key, fake modifications in cipher text and origin authentication of both parties while exchanging information. These contradictory issues can be omitted by utilizing hybrid encryption mechanisms (symmetric+asymmetric) to get optimal benefits of both schemes. Several hybrid mechanisms are available with different logics but our logic differs in infrastructural design, simplicity, computational efficiency and security as compared to prior hybrid encryption schemes. Some prior schemes are either diversified in performance aspects, customer satisfaction, memory utilization or energy consumptions and some are vulnerable against forgery and password guessing (session key recovery) attacks. We have done some functional and design related changes in existing Public Key Infrastructure (PKI) to achieve simplicity, optimal privacy and more customer satisfaction by providing Hybrid Encryption System (HES) that is able to fulfill all set of standardized security constraints. No such PKI based generic hybrid encryption scheme persists as we have provided in order to manage all these kinds of discussed issues.

Adaptive Information Coding for Secure and Reliable Wireless Telesurgery Communications

Telesurgical Robot Systems (TRSs) have been the focus of research in academic, military, and commercial domains for many years. Contemporary TRSs address mission critical operations emerging in extreme fields such as battlefields, underwater, and disaster territories. The lack of wirelined communication infrastructure in such fields makes the use of wireless technologies including satellite and ad-hoc networks inevitable. TRSs over wireless environments pose unique challenges such as preserving a certain reliability threshold, adhering some maximum tolerable delay, and providing various security measures depending on the nature of the operation and communication environment. In this study, we present a novel approach that uses information coding to integrate both light-weight privacy and adaptive reliability in a single protocol called Secure and Statistically Reliable UDP (SSR-UDP). We prove that the offered security is equivalent to the existing AES-based long key crypto systems, yet, with significantly less computational overhead. Additionally, we demonstrate that the proposed scheme can meet high reliability and delay requirements of TRS applications in highly lossy environments while optimizing the bandwidth use. Our proposed SSR-UDP protocol can also be utilized in similar cyber-physical wireless application domains.

Privacy protection of biometric traits using modified hill cipher with involutory key and robust cryptosystem

Abstract In this paper we have proposed a technique for securing biometric traits using the modified Hill Cipher with an involutory key and a robust cryptosystem. The Modified Hill Cipher solves the drawbacks of conventional Hill ciphers by using iterations and interlacing. Interlacing of the binary bits of the plaintext image creates confusion while iterations create complexity to the cipher image. The Modified Hill cipher is secure to known plaintext. Binary conversion is only possible for integer elements so an integer involutory key matrix is used. As the key matrix is involutory, which eliminates necessity of matrix inverse while decryption. We have used a robust cryptosystem algorithm to send the cipher matrix safely. The cryptanalysis and histogram graphs show the variation of image property before and after encryption.

A cryptanalytic time-memory trade-off

A probabilistic method is presented which cryptanalyzes any <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> key cryptosystem in <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N^{2/3}</tex> operational with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N^{2/3}</tex> words of memory (average values) after a precomputation which requires <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> operations. If the precomputation can be performed in a reasonable time period (e.g, several years), the additional computation required to recover each key compares very favorably with the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> operations required by an exhaustive search and the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> words of memory required by table lookup. When applied to the Data Encryption Standard (DES) used in block mode, it indicates that solutions should cost between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1 and</tex> 100 each. The method works in a chosen plaintext attack and, if cipher block chaining is not used, can also be used in a ciphertext-only attack.