Today, hybrid cryptosystems are important part in structure of information telecommunication systems. That's why information security measures are extremely crucial at each stage of cryptosystem development life cycle. One of the most important specific of modern cryptosystems is the fact, that they often deployed in unprotected environment and outside the physically secured perimeter. That introduces new attack vectors, e.g. kleptographic attacks which include implementation forgery at endpoints. Such attack types are extremely dangerous because of the victim, who is a participant of some restricted area (electronic document flow, payment system, secure communication etc.), may induce threats for non-compromised participants (e.g., sensitive information leakage). One of the ways to solve mitigate this risks is development subliminal channel free cryptosystems which are resistant against different types of kleptographic attacks. In the article we show results belong to development of SETUP free cryptographic protocol development. Firstly, we suggest formal model for basic ''challenge-response'' protocol with subliminal channel. Using this formal model, we introduce sufficient conditions which lead to impossibility of existence of subliminal channels. Also the theorem about sufficient conditions has been formulated and proved. Further, we suggest improvements of basic protocols -- nonce generation and 1-round Diffie-Hellman key agreement protocol with design that is based of sufficient conditions. Using formalization of suggested enhanced protocols we formulated and proved the theorem about SETUP resistance property for these protocols. Our results may be useful for other SETUP free protocols development, this will be helpful for increasing security of hybrid cryptosystem.
Today, hybrid cryptosystems are important part in structure of information telecommunication systems. That's why information security measures are extremely crucial at each stage of cryptosystem development life cycle. One of the most important specific of modern cryptosystems is the fact, that they often deployed in unprotected environment and outside the physically secured perimeter. That introduces new attack vectors, e.g. kleptographic attacks which include implementation forgery at endpoints. Such attack types are extremely dangerous because of the victim, who is a participant of some restricted area (electronic document flow, payment system, secure communication etc.), may induce threats for non-compromised participants (e.g., sensitive information leakage). One of the ways to solve mitigate this risks is development subliminal channel free cryptosystems which are resistant against different types of kleptographic attacks. In the article we show results belong to development of SETUP free cryptographic protocol development. Firstly, we suggest formal model for basic ''challenge-response'' protocol with subliminal channel. Using this formal model, we introduce sufficient conditions which lead to impossibility of existence of subliminal channels. Also the theorem about sufficient conditions has been formulated and proved. Further, we suggest improvements of basic protocols -- nonce generation and 1-round Diffie-Hellman key agreement protocol with design that is based of sufficient conditions. Using formalization of suggested enhanced protocols we formulated and proved the theorem about SETUP resistance property for these protocols. Our results may be useful for other SETUP free protocols development, this will be helpful for increasing security of hybrid cryptosystem.
Introduction/purpose: The problem of efficient distribution of cryptographic keys in communication systems has existed since its first days and is especially emphasized by the emergence of mass communication systems. Defining and implementing efficient protocols for symmetric cryptographic keys establishment in such circumstances is of great importance in raising information security in cyberspace. Methods: Using the methods of Information Theory and Secure Multiparty Computation, protocols for direct establishment of cryptographic keys between communication parties have been defined. Results: The paper defines two new approaches to the problem of establishing cryptographic keys. The novelty in the protocol defined in the security model based on information theory is based on the source of common randomness, which in this case is the EEG signal of each subject participating in the communication system. Experimental results show that the amount of information leaking to the attacker is close to zero. A novelty in the second case, which provides security with keys at the level of computer security by applying Secure Multiparty Computation, is in the new application field, namely generation and distribution of symmetric cryptographic keys. It is characteristic of both approaches that within the framework of formal theories, it is possible to draw conclusions about their security characteristics in a formal way. Conclusions: The paper describes two new approaches for establishing cryptographic keys in symmetric cryptographic systems with experimental results. The significance of the proposed solutions lies in the fact that they enable the establishment of secure communication between communication parties from end to end, avoiding the influence of a trusted third party. In that way, the achieved communication level security significantly increases in relation to classical cryptographic systems.
Key exchange protocols, first introduced by Diffie and Hellman in 1976, are one of the most widely-deployed cryptographic protocols. They allow two parties, that have never interacted before, to establish shared secrets. These shared cryptographic keys may subsequently be used to establish a secure communication channel. Use cases include the classic client-server setting that is for example at play when browsing the internet, but also chats via end-to-end-encrypted instant messaging applications. Security-wise, we generally demand of key exchange protocols to achieve key secrecy and authentication. While, informally, authentication ensures that the communicating parties have confidence in the identity of their peers, key secrecy ensures that any shared cryptographic key that is established via the key exchange protocol is only known to the participants in the protocol and can be used securely in cryptographic protocols, i.e., is sufficiently random. In 1993, Bellare and Rogaway gave a first formalization of key exchange protocol security that captures these properties with respect to powerful adversaries with full control over the network. Their model constitutes the basis of the many subsequent treatments of authenticated key exchange security, including the models presented in this thesis. The common methodological approach underlying all of these formalizations is the provable security paradigm, which has become a standard tool in assessing the security of cryptographic protocols and primitives. So-called security models specify the expected security guarantees of the scheme in question with regards to a well-defined class of adversaries. Proofs that validate these security claims do so by reducing the security of the overall scheme to the security of the underlying cryptographic primitives and hardness assumptions. However, advances in computational power and more sophisticated cryptanalytic capabilities often render exactly these components insecure. Especially the advent of quantum computers will have a devastating effect on much of today's public key cryptography. This is especially true for key exchange protocols since they rely crucially on public-key algorithms. In this thesis, our focus in future-proofing key exchange protocols is two-fold. First, we focus on extending security models for key exchange protocols to capture the (un)expected break of cryptographic primitives and hardness assumptions. The aim is to gain assurances with respect to future adversaries and to investigate the effects of primitive failures on key exchange protocols. More specifically, we explore how key exchange protocols can be safely transitioned to new, post-quantum secure algorithms with hybrid techniques. Hybrids combine classical and post-quantum algorithms such that the overall key agreement scheme remains secure as long as one of the two base schemes remains secure. For this, we introduce security notions for key encapsulation mechanisms that account for adversaries with varying levels of quantum capabilities and present three new constructions for hybrid key encapsulation mechanisms. Our hybrid designs are practice-inspired and for example capture draft proposals for hybrid modes in the Transport Layer Security (TLS) protocol, which is one of the most widely-deployed cryptographic protocols that enables key agreement. Furthermore, our notion of breakdown resilience for key exchange protocols allows to gauge the security of past session keys in the event of a failure of a cryptographic component in the key exchange. We exercise our model on variants of the post-quantum secure key exchange protocol NewHope by Alkim et al. Thereby, we confirm the intuition that, in order to guard against adversaries that only have access to quantum computing power in the (more distant) future, it is sufficient to use classically-secure authentication mechanisms alongside post-quantum key agreement to achieve authenticated key exchange. As with any mathematical statement, theorems in the provable security paradigm are only as valid as the underlying assumptions. A careful consideration of any newly made assumption is thus essential to ensure the meaningfulness of the statement itself and make the assumption a viable tool for future analyses. Thus, secondly, we systematically classify the PRF-ODH assumption, a complexity-theoretic hardness assumption that has been used in key exchange security analyses of such prominent protocols as TLS, Signal, and Wireguard. In particular, we give a unified, parametrized definition of the assumption encompassing different variants that are present in the literature. We relate the resulting parametrized notions in terms of their strength and show where these assumptions fit in the collection of well-understood related hardness assumptions. We finally sketch our result on the impossibility of instantiating this assumption in the standard model, thereby disposing of the uncertainty in the community whether PRF-ODH is in fact a standard model assumption, i.e., removes the usage of some idealized assumptions in key exchange protocol proofs.
Quantum cryptography provides an ensemble of protocols, such as quantum key distribution [1-3], quantum random number generation [4], closed group digital signatures [5], long-term secure data storage [6] and multi-party secure computation [7], which are robust against future algorithmic and computational advances, including the emergence of quantum computers. This is because its security is information-theoretic, i.e., it can be proven based only on models of the local devices operated by legitimate users and does not require any assumptions on the resources available to an adversary [8-12]. Information-theoretic security will be important for data confidentiality in the future when we expect more powerful computers and new algorithms to be at the fingertips of our digital foes. Of particular concern is the advent of quantum computers that can be used to launch efficient attacks on conventional techniques, such as the widely-used forms of public key cryptography. Well before more powerful conventional and quantum computers become available, quantum cryptography will be important to protect against a generic vulnerability inherent to current cryptographic techniques based on computational complexity: encrypted data can be stored today and decrypted in the future, when suitable technology becomes available. This leads to the possibility of retrospectively breaking encryption keys established with computational techniques, such as the Diffie-Hellman key exchange algorithm. This becomes a serious threat if data confidentiality must be maintained for several years, especially as it is now feasible to store large volumes of information.Although the quantum cryptographic protocolsare information-theoretic secure, real systemsmay still possess side channels, i.e. security vulnerabilities, if their implementation deviates significantly from the idealised models used in the security analysis [12-15]. This is a common threat to any cryptosystem, irrespective of whether it is based on quantum theory [16-23] or computational complexity [24-28]. For example, timing attacks can threaten implementations of both quantum [16] and non-quantum [24] systems. Therefore, the security analysis of a cryptosystem’s implementation, for simplicity called “implementation security”, is anatural and important development in the evolution of all cryptographic technologies, including quantum cryptography.Since the security of quantum cryptography depends only on the legitimate users’ local equipment, the fundamental task in quantum cryptography implementation security is to estimate how much information such equipment leaks to a potential adversary. When this information leakage can be bounded below a certain value, security can be restored [29, 30] using a technique called privacy amplification[31, 32, 33]. This compresses a partially secret bit sequence into a highly secure key, with the amount of compression depending upon the estimated information leakage. Thus, by adequately characterising a real system, it is possible to restore the security promise of the theoretical protocol against technology available at the time that secret key is being created. It is a specific feature of quantum cryptography that this security statement does not change with future technological advances.Privacyamplification is not the only resource available to enforce the implementation security of quantum cryptography. Modifications to hardware and protocols can dramatically reduce the information leakage and the potential occurrence of side-channels and active attacks [34-38]. Moreover, quantum correlations can be used to test the hardware of a real system [39-40]. Such tests can be quite demanding to implement but have the advantage of immunity against a large class of implementation issues. The importance of analysing the implementation security of quantum cryptography is widely recognised and is a very active area of research. National metrology institutes, government organisations, universities and private companies fully acknowledge the importance of thissubject and are supporting its effective development. ETSI has established an Industry Specification Group (ISG) to coordinate these efforts and to set forward-looking standards in quantum cryptography implementation security [41]. These will guide security evaluation by qualified third parties, as part of a security certification of quantum cryptographic products.
Recent advances in quantum technology and the potential that practical quantum computers may become a reality in the future have led to renewed interest in developing cryptographic technologies that are secure against conventional and quantum attacks. Currently, virtually all asymmetric cryptographic schemes in use are threatened by the potential development of powerful quantum computers. Post-quantum cryptography is one of main the ways to combat this threat. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently, even with the help of quantum computers. The security of information systems is ensured through protection against various threats that use system vulnerabilities. Security protocols are the building blocks of secure communication. They implement security mechanisms to provide security services. Security protocols are considered abstract when analyzed, but may have additional vulnerabilities in implementation. This work contains a holistic study of security protocols. Basics of security protocols, taxonomy of attacks on security protocols and their implementation are considered, as well as various methods and models of protocol security analysis. In particular, the differences between information-theoretic and computational security, computational and symbolic models are specified. In addition, an overview of the computational security models for Authenticated Key Exchange (AKE) and Password Authentication Key Exchange (PAKE) protocols is provided. The most important security models for the AKE and PAKE protocols were also described. With the emergence of new technologies that may have different security requirements, as well as with increased opportunities for competition, there is always a need to develop new protocols. Thus, the purpose of this article is to review, classify, analyze, and research the vulnerabilities of information systems from classical, quantum, and special attacks, performed taking into account the forecast regarding the possibilities of attacks on post-quantum cryptographic transformations; studying security assessment models for existing cryptographic protocols, as well as reviewing and benchmarking security models and providing suggestions for protection against existing potential attacks.
The fast development of quantum computing poses a threat to the security of the classical cryptographic system, and so there is a need to have strong post-quantum systems that are hard to break.The issue discussed in this paper is how to develop secure and efficient cryptographic protocols, taking advantage of graph-theoretic constructions that are not vulnerable to quantum attacks.The initial goal is to create a cryptographic scheme based on graphs and with hard problems like Graph Isomorphism, Hamiltonian Path and expander graph properties.The suggested methodology combines combinatorial graph structures with algebraic transformations, which are backed up by hybrid models that combine graph embeddings and lattice-based inspired security mechanisms.The synthetic and benchmark graph datasets are experimented on and the performance is measured based on the strength of security, complexity of computation and the scale.The suggested scheme has 97.1% accuracy in attack resistance, decreases the time of key generation by 21.4% and enhances the structural security measures by 18.6% over lattice-only schemes.Compares and contrasts to show improved resilience against quantum adversaries with efficiency.The innovation in the framework is that it integrates graph-theorically to design cryptography in a hybrid manner.This research goes a long way in enhancing the security of communication between IoT, cloud and distributed systems.
Quantum computing, which uses quantum physics’ superposition and entanglement, has the potential to revolutionize a number of disciplines, including material science, cryptography, and optimization. But the emergence of quantum computing also brings serious security risks, putting cryptography measures to the test and opening up new vulnerabilities. This work offers a thorough examination of these security risks in information processing using quantum computing. We investigate quantum-specific attacks that take advantage of quantum systems’ unique properties, going beyond cryptographic flaws. Quantum side-channel attacks on quantum hardware and quantum spying attempts on quantum key distribution (QKD) protocols highlight the practical issues in protecting quantum communication networks. Long-term dangers to data privacy and integrity also arise from the possibility of data gathering for future decryption, in which attackers gather and store encrypted data now in anticipation of being able to decrypt it later with more potent quantum computers. We first investigate the threats that quantum algorithms bring to the security of the cryptographic protocols in use today. Shor’s method jeopardizes the security of popular public-key cryptosystems such as RSA, ECC, and Diffie-Hellman because it can solve discrete logarithms and factor large integers quickly. Grover’s approach, similarly, weakens the security of symmetric-key cryptography systems by essentially halving their key strength while providing a quadratic speedup for brute-force searches. In order to mitigate these risks, we address the creation and application of post-quantum cryptography algorithms that are resistant to quantum assaults. For quantum communication networks, better QKD methods and infrastructure that is resistant to quantum emulation are crucial security considerations. Proactively developing responses and staying ahead of emerging dangers require constant research and observation. In summary, while quantum computing holds immense potential, it also introduces new security challenges that require resolution to protect information processing systems. This analysis emphasizes how critical it is to switch to cryptography techniques that are resistant to quantum computing and to put in place comprehensive security measures in order to protect against the constantly changing danger landscape that this technology poses. This chapter provides a concise overview of the key concepts that a comprehensive study would encompass.