Implementation Of Cryptographic Protocols Research Articles

Enhancing Field Multiplication in IoT Nodes with Limited Resources: A Low-Complexity Systolic Array Solution

Enhancing Field Multiplication in IoT Nodes with Limited Resources: A Low-Complexity Systolic Array Solution

Semi-Permanent Stuck-At Fault injection attacks on Elephant and GIFT lightweight ciphers

Fault attacks pose a potent threat to modern cryptographic implementations, particularly those used in physically approachable embedded devices in IoT environments. Information security in such resource-constrained devices is ensured using lightweight ciphers, where combinational circuit implementations of SBox are preferable over look-up tables (LUT) as they are more efficient regarding area, power, and memory requirements. Most existing fault analysis techniques focus on fault injection in memory cells and registers. Recently, a novel fault model and analysis technique, namely Semi-Permanent Stuck-At (SPSA) fault analysis, has been proposed to evaluate the security of ciphers with combinational circuit implementation of Substitution layer elements, SBox. In this work, we propose optimized techniques to recover the key in a minimum number of ciphertexts in such implementations of lightweight ciphers. Based on the proposed techniques, a key recovery attack on the NIST lightweight cryptography (NIST-LWC) standardization process finalist, Elephant AEAD, has been proposed. The proposed key recovery attack is validated on two versions of Elephant cipher. The proposed fault analysis approach recovered the secret key within 85 − 240 ciphertexts, calculated over 1000 attack instances. To the best of our knowledge, this is the first work on fault analysis attacks on the Elephant scheme. Furthermore, an optimized combinational circuit implementation of Spongent SBox (SBox used in Elephant cipher) is proposed, having a smaller gate count than the optimized implementation reported in the literature. The proposed fault analysis techniques are validated on primary and optimized versions of Spongent SBox through Verilog simulations. Further, we pinpoint SPSA hotspots in the lightweight GIFT cipher SBox architecture. We observe that GIFT SBox exhibits resilience towards the proposed SPSA fault analysis technique under the single fault adversarial model. However, eight SPSA fault patterns reduce the nonlinearity of the SBox to zero, rendering it vulnerable to linear cryptanalysis. Conclusively, SPSA faults may adversely affect the cryptographic properties of an SBox, thereby leading to trivial key recovery. The GIFT cipher is used as an example to focus on two aspects: i) its SBox construction is resilient to the proposed SPSA analysis and therefore characterizing such constructions for SPSA resilience and, ii) an SBox even though resilient to the proposed SPSA analysis, may exhibit vulnerabilities towards other classical analysis techniques when subjected to SPSA faults. Our work reports new vulnerabilities in fault analysis in the combinational circuit implementations of cryptographic protocols.

Securing digital authentication with cryptographic innovations in intrinsic verification systems

In the digital era, authentication system’s security is crucial. This paper discusses the issue of improving digital authentication from the position of cryptographic improvements in intrinsic verification structures. The emphasis is made on creation and implementation of efficient cryptographic protocols that reinforce security in digital authentication procedures. This research focuses on developing a new cryptographic framework that is capable of improving the attack tolerance of intrinsic verification systems against various kinds of cyber-attacks such as identity theft and data breach. This structure takes advantage of innovative cryptographic algorithms, including quantum-resistant techniques that secure authentication records containing sensitive information. The Author conducts further feasibility study of these innovations that can be applied in practical settings, quantifying the success or failure through simulations. The outcomes evidenced significant security features improvements, indicating that such cryptographic developments have the potential to revolutionize digital authentication. This study is not only coming up with the solution, Prescence to current security challenges but also has shown path for development of secure digital authentication system in an interconnected world.

Cryptographic protocol conformance testing based on domain-specific state machine

We present a method of conformance testing of the cryptographic protocol implementations that ensures a high degree of automation of the testing process and provides criteria for the quality assessment of the generated test suites. Our method is based on a kind of extended (non-finite) state machine which is specifically designed for the domain of cryptographic protocols. The key concept of the proposed machine is a built-in mechanism of sequences, which, firstly, sets an effective way to deal with the nondeterminism inherent in cryptographic protocols and, secondly, provides the means to express "inconvenient" (for the high-level declarative languages) requirements, such as e.g. "take the concatenation of the specified parts of all the previous messages which meet specified condition". Basing on this machine, we propose a high-level declarative language (embedded in Haskell) intended for development of interoperable protocol specifications used as input data for our testing tool. The protocol specification consists of two parts: a description of the structure of the protocol messages (this part, by virtue of its conciseness and declarativeness, can be directly incorporated in the primary specifications such as RFC) and a set of state machine transition functions binded to the sequences. In the paper, we present the principles of building of our machine and introduce the notion of sequences fuzzing. The proposed approach was successfully approved for the industrial cryptographic protocol TLS.

Извлечение опорных тестовых наборов из спецификаций криптопротоколов на предметно-ориентированном языке

The paper describes a tool for testing the security of cryptographic protocol implementations working on the basis of specifications written in a declarative interoperable domain-specific language implemented as EDSL (Embedded [in Haskell] DSL). The problem of forming high-quality reference test suites for testing the security of cryptoprotocol implementations is considered. A method of addressing this problem within the tool being developed is discussed.

Experimental implementation of secure anonymous protocols on an eight-user quantum key distribution network

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications. Often, knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here, we experimentally demonstrate five information-theoretically secure anonymity protocols on an eight user city-wide quantum network using polarisation entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping their identity anonymous. For a network of n users, the protocols retain anonymity for the sender, given that no more than n − 2 users are colluding. This is an implementation of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

Improved Pohlig - Hellman using Sieve of Eratosthenes for Three-Pass Protocol Security Enhancement

Password-based is widely used as an exchange model in many areas such as smartphones, computers and other devices in which the keys are directly distributed to the recipients. Therefore, the implementation of cryptographic protocols without key exchange remains an undesirable area. The three-pass protocol is an instrument that enables sender and receiver to send encrypted data without any of the keys being transmitted to recipients. Furthermore, this process eliminates key exchange between senders and recipients when there is three ways direct communication using their own key.

Semiquantum secure direct communication with authentication based on single-photons

Semiquantum cryptography has drawn much attention in recent years since it simplifies the implementation of quantum cryptographic protocols. In this paper, we study semiquantum secure direct communication (SQSDC). Based on single-photons, we propose a two-step SQSDC protocol with identity authentication, which can be used to prevent impersonation and the man-in-the-middle attack. Different from previous protocols based on quantum entanglement or quantum memory, our protocol removes there restrictions for simplifying its physical implementation. We prove that our two-step SQSDC protocol is completely robust. That is, any adversarial attempting to learn some information on the secure message or identity strings will inevitably induce some errors that can be detected by communicators.

Intrinsic Run-Time Row Hammer PUFs: Leveraging the Row Hammer Effect for Run-Time Cryptography and Improved Security †

Physical Unclonable Functions (PUFs) based on the retention times of the cells of a Dynamic Random Access Memory (DRAM) can be utilised for the implementation of cost-efficient and lightweight cryptographic protocols. However, as recent work has demonstrated, the times needed in order to generate their responses may prohibit their widespread usage. To address this issue, the Row Hammer PUF has been proposed by Schaller et al., which leverages the row hammer effect in DRAM modules to reduce the retention times of their cells and, therefore, significantly speed up the generation times for the responses of PUFs based on these retention times. In this work, we extend the work of Schaller et al. by presenting a run-time accessible implementation of this PUF and by further reducing the time required for the generation of its responses. Additionally, we also provide a more thorough investigation of the effects of temperature variations on the Row Hammer PUF and briefly discuss potential statistical relationships between the cells used to implement it. As our results prove, the Row Hammer PUF could potentially provide an adequate level of security for Commercial Off-The-Shelf (COTS) devices, if its dependency on temperature is mitigated, and, may therefore, be commercially adopted in the near future.

Measurement-Device Independency Analysis of Continuous-Variable Quantum Digital Signature.

With the practical implementation of continuous-variable quantum cryptographic protocols, security problems resulting from measurement-device loopholes are being given increasing attention. At present, research on measurement-device independency analysis is limited in quantum key distribution protocols, while there exist different security problems for different protocols. Considering the importance of quantum digital signature in quantum cryptography, in this paper, we attempt to analyze the measurement-device independency of continuous-variable quantum digital signature, especially continuous-variable quantum homomorphic signature. Firstly, we calculate the upper bound of the error rate of a protocol. If it is negligible on condition that all measurement devices are untrusted, the protocol is deemed to be measurement-device-independent. Then, we simplify the calculation by using the characteristics of continuous variables and prove the measurement-device independency of the protocol according to the calculation result. In addition, the proposed analysis method can be extended to other quantum cryptographic protocols besides continuous-variable quantum homomorphic signature.

Continuous-variable protocol for oblivious transfer in the noisy-storage model

Cryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We present and experimentally demonstrate here a quantum protocol for oblivious transfer for optical continuous-variable systems, and prove its security in the noisy-storage model. This model allows us to establish security by sending more quantum signals than an attacker can reliably store during the protocol. The security proof is based on uncertainty relations which we derive for continuous-variable systems, that differ from the ones used in quantum key distribution. We experimentally demonstrate in a proof-of-principle experiment the proposed oblivious transfer protocol for various channel losses by using entangled two-mode squeezed states measured with balanced homodyne detection. Our work enables the implementation of arbitrary two-party quantum cryptographic protocols with continuous-variable communication systems.

Tripartite outsoursing key-agreement protocol on bilinear pairings

The implementation of cryptographic protocols in systems with resource-constrained devices and possible transfer of laborious calculations to a cloud server is considered. In this case, the device performs “simple” arithmetic operations. A tripartite key-agreement with two servers and the model with one malicious computer is proposed.

Affine Refinement Types for Secure Distributed Programming

Recent research has shown that it is possible to leverage general-purpose theorem-proving techniques to develop powerful type systems for the verification of a wide range of security properties on application code. Although successful in many respects, these type systems fall short of capturing resource-conscious properties that are crucial in large classes of modern distributed applications. In this article, we propose the first type system that statically enforces the safety of cryptographic protocol implementations with respect to authorization policies expressed in affine logic. Our type system draws on a novel notion of “exponential serialization” of affine formulas, a general technique to protect affine formulas from the effect of duplication. This technique allows formulate of an expressive logical encoding of the authentication mechanisms underpinning distributed resource-aware authorization policies. We discuss the effectiveness of our approach on two case studies: the EPMO e-commerce protocol and the Kerberos authentication protocol. We finally devise a sound and complete type-checking algorithm, which is the key to achieving an efficient implementation of our analysis technique.

Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations

We present a new type system for verifying the security of reference implementations of cryptographic protocols written in a core functional programming language. The type system combines prior work on refinement types, with union, intersection, and polymorphic types, and with the novel ability to reason statically about the disjointness of types. The increased expressivity enables the analysis of important protocol classes that were previously out of scope for the type-based analyses of reference protocol implementations. In particular, our types can statically characterize: (i) more usages of asymmetric cryptography, such as signatures of private data and encryptions of authenticated data; (ii) authenticity and integrity properties achieved by showing knowledge of secret data; (iii) applications based on zero-knowledge proofs. The type system comes with a mechanized proof of correctness and an efficient type-checker.

In quantum direct communication an undetectable eavesdropper can always tellΨfromΦBell states in the message mode

We show that in any quantum direct communication protocol that is based on $\ensuremath{\Psi}$ and $\ensuremath{\Phi}$ Bell states, an eavesdropper can always tell $\ensuremath{\Psi}$ from $\ensuremath{\Phi}$ states without altering the transmission in any way in the message mode. This renders all protocols that make use of only one $\ensuremath{\Psi}$ state and one $\ensuremath{\Phi}$ state completely insecure in the message mode. All four-Bell-state protocols require a revision and this might be of importance for new implementations of entanglement-based cryptographic protocols. The detection rate of an eavesdropper is 25$%$ per control transmission, i.e., a half of the rate in the two-state (ping-pong) protocol. An eavesdropper can detect control probes with certainty in the standard control transmission without a photon in the Alice-to-Bob's travel mode and with near certainty in a transmission with a fake photon in the travel mode. Resending of measured control photons via the travel mode would make an eavesdropper completely invisible.

Min-entropy uncertainty relation for finite-size cryptography

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.

An Experimental Study on Energy Consumption of Cryptographic Algorithms for Mobile Hand-Held Devices

Due to the continuous advancement in technology, mobile devices are playing important role in everyone’s day to day life. Everyone is moving towards wireless mobile systems, but power consumption is an important concern in such devices. While designing, a lot of care has to be taken especially in power optimization because there is no regular power supply in this kind of devices. This paper represents software level cryptographic protocols for optimizing the power consumption in wireless mobile devices. The capacity of battery grows up very slowly, which is insufficient for the electricity that the handheld devices demand, and thus designs and implementations of battery-efficient systems are in urgent need. This work focuses on one important constraint of such devices-battery life-and examines how it is impacted by the use of various security mechanisms.The energy consumption of these algorithms is measured by loading their software level cryptographic protocol implementations through the device’s serial port, running them and measuring their power consumption. Our results will show that proposed cryptographic protocol provides a better security guarantee and acquires much less energy consumption than the existing cryptographic protocols. Finally, performance analysis will show that compared with existing cryptographic protocols, our proposed scheme is to be more simple, secure and efficient.

Verified Cryptographic Implementations for TLS

We narrow the gap between concrete implementations of cryptographic protocols and their verified models. We develop and verify a small functional implementation of the Transport Layer Security protocol (TLS 1.0). We make use of the same executable code for interoperability testing against mainstream implementations for automated symbolic cryptographic verification and automated computational cryptographic verification. We rely on a combination of recent tools and also develop a new tool for extracting computational models from executable code. We obtain strong security guarantees for TLS as used in typical deployments.

An Experimental Study on Energy Consumption of Cryptographic Algorithms for Mobile Hand-Held Devices

Due to the continuous advancement in technology, mobile devices are playing important role in everyone‟s day to day life. Everyone is moving towards wireless mobile systems, but power consumption is an important concern in such devices. While designing, a lot of care has to be taken especially in power optimization because there is no regular power supply in this kind of devices. The capacity of battery grows up very slowly, which is insufficient for the electricity that the handheld devices demand, and thus designs and implementations of battery-efficient systems are in urgent need. The energy consumption of these algorithms is measured by loading their software level cryptographic protocol implementations through the device‟s serial port, running them and measuring their power consumption. Our results will show that proposed cryptographic protocol provides a better security guarantee and acquires much less energy consumption than the existing cryptographic protocols. Finally, performance analysis will show that compared with existing cryptographic protocols, our proposed scheme is to be more simple, secure and efficient.

Cryptographically-masked flows

Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterference-based) information-flow definitions allow no flow from secret to public data. Unfortunately, this implies that programs with encryption are ruled out because encrypted output depends on secret inputs: the plaintext and the key. However, it is desirable to allow flows arising from encryption with secret keys provided that the underlying cryptographic algorithm is strong enough. In this article we conservatively extend the noninterference definition to allow safe encryption, decryption, and key generation. To illustrate the usefulness of this approach, we propose (and implement) a type system that guarantees noninterference for a small imperative language with primitive cryptographic operations. The type system prevents dangerous program behavior (e.g., giving away a secret key or confusing keys and nonkeys), which we exemplify with secure implementations of cryptographic protocols. Because the model is based on a standard noninterference property, it allows us to develop some natural extensions. In particular, we consider public-key cryptography and integrity, which accommodate reasoning about primitives that are vulnerable to chosen-ciphertext attacks.