Search

Integration of the internet of things (IoT) and robotics into the internet of robotic things (IoRT) presents inherent security and trust challenges. This article introduces an innovative blockchain-centred framework designed to address these challenges. By harnessing the features of oneM2M and blockchain technology, the architecture enhances accessibility, security and data management within IoRT. Encompassing key aspects such as data flow, user authentication, health data management and security, the proposed framework ensures compliance with the oneM2M standard. A notable contribution is the integration of a private blockchain network on ZedBoard development boards, focusing on access control and data integrity verification. External IoT data are securely transmitted to a cloud platform hosted on AWS, ensuring streamlined data management with minimal impact on the resources of ZedBoards. In a stride towards bolstering IoRT security, the study implements elliptic curve digital signature algorithm (ECDSA) with Radix-2w optimizations on ZedBoards, demonstrating a significant 58.63% reduction in addition operation costs compared to standard ECDSA. The practical implementation on ZedBoards validates the effectiveness of this approach, offering a comprehensive solution for securing IoRT networks. This research caters to industries relying on the seamless integration of IoT and robotics, concluding with noteworthy findings and suggesting potential avenues for future research, including optimizations in hardware/software co-design for ECDSA on Zynq boards.

Physically unclonable functions (PUFs) are crucial for enhancing cybersecurity by providing unique, intrinsic identifiers for electronic devices, thus ensuring their authenticity and preventing unauthorized cloning. The SRAM-PUF, characterized by its simple structure and ease of implementation in various scenarios, has gained widespread usage. The soft-decision Reed–Muller (RM) code, an error correction code, is commonly employed in these designs. This paper introduces the design of an RM code soft-decision attack algorithm to reveal its potential security risks. To address this problem, we propose a soft-decision SRAM-PUF structure based on the elliptic curve digital signature algorithm (ECDSA). To improve the processing speed of the proposed secure SRAM-PUF, we propose a custom ECDSA scheme. Further, we also propose a universal architecture for the critical operations in ECDSA, elliptic curve scalar multiplication (ECSM), and elliptic curve double scalar multiplication (ECDSM) based on the differential addition chain (DAC). For ECSMs, iterations can be performed directly; for ECDSMs, a two-dimensional DAC is constructed through precomputation, followed by iterations. Moreover, due to the high similarity of ECSM and ECDSM data paths, this universal architecture saves hardware resources. Our design is implemented on a field-programmable gate array (FPGA) and an application-specific integrated circuit (ASIC) using a Xilinx Virtex-7 and an TSMC 40 nm process. Compared to existing research, our design exhibits a lower bit error rate ( 2.7 × 10 − 10 ) and better area–time performance (3902 slices, 6.615 μ s ECDSM latency). [ABSTRACT FROM AUTHOR]

Physically unclonable functions (PUFs) are crucial for enhancing cybersecurity by providing unique, intrinsic identifiers for electronic devices, thus ensuring their authenticity and preventing unauthorized cloning. The SRAM-PUF, characterized by its simple structure and ease of implementation in various scenarios, has gained widespread usage. The soft-decision Reed–Muller (RM) code, an error correction code, is commonly employed in these designs. This paper introduces the design of an RM code soft-decision attack algorithm to reveal its potential security risks. To address this problem, we propose a soft-decision SRAM-PUF structure based on the elliptic curve digital signature algorithm (ECDSA). To improve the processing speed of the proposed secure SRAM-PUF, we propose a custom ECDSA scheme. Further, we also propose a universal architecture for the critical operations in ECDSA, elliptic curve scalar multiplication (ECSM), and elliptic curve double scalar multiplication (ECDSM) based on the differential addition chain (DAC). For ECSMs, iterations can be performed directly; for ECDSMs, a two-dimensional DAC is constructed through precomputation, followed by iterations. Moreover, due to the high similarity of ECSM and ECDSM data paths, this universal architecture saves hardware resources. Our design is implemented on a field-programmable gate array (FPGA) and an application-specific integrated circuit (ASIC) using a Xilinx Virtex-7 and an TSMC 40 nm process. Compared to existing research, our design exhibits a lower bit error rate (2.7×10−10) and better area–time performance (3902 slices, 6.615 μs ECDSM latency).

Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms of attacks. With symmetric encryption, both parties can encrypt and decrypt messages using the same key. Lattice attacks on digital signature algorithms (ECDSA) involve forming a basis and setting a target vector from signatures, then solving the closest vector problem (CVP) or shortest vector problem (SVP) in the generated lattice to obtain the private key. Prior research focused on obtaining leakage information from the signature's random nonce to facilitate a CVP or SVP solution. This study establishes a clear boundary for a successful ECDSA attack and introduces a "double basis" lattice version that expands the boundary or reduces the necessary signatures by nearly half with the same lattice rank. To approach the boundary, a heuristic strategy is employed to shift the target vector in different directions with a feasible step size, using tests on the Trusted Platform Module (TPM) 2.0 ECDSA. The distance from the closest moved target vector to the boundary is reduced by a ratio of 424 to 179 to the minimal length of orthogonal vectors in the formed basis. Experimental results show that moving attempts in two directions with the original basis and 84 signatures take approximately 247.7 s on the experiment computer. [ABSTRACT FROM AUTHOR]

The concept of blockchain has sparked hopes in the field of communication security between IoT devices. In blockchain, all network nodes need to verify its legitimacy before accepting and recording it. Users of HIoTNs (Hierarchical IoT Networks) want to get real-time data from specific sensors in a specific implementation. Users need authentications at GNs for obtaining their required services. On successful authentications, parties on either sides of communication can create secret session keys for safe communications. Critical issues like this in HIoTNs are addressed in this work by its novel proposed multimodal-biometrics based lightweight user authentications. The scheme based on block chain technologies is called SMUAAKMPs (Secure Multimodal Biometrics-based User Anonymous Authenticated Key Management Protocols). ECDSAs (Elliptic Curve Digital Signature Algorithms) are utilised for devices and GNs, to generate public and private keys. In addition, multimodal biometric verifications are executed using fuzzy commitment approaches. The fuzzy commitment technique is then used to validate the biometric authentication using the segmented face. This work's detailed security analyses use ROR (Real-Or-Random) models where formal security verifications are done by software verification tool AVISPAs (Automated Validation of Internet Security Protocols and Applications). Informal security analyses show that the proposed SMUAAKMPs withstand multiple known attacks. The system also provides improved safety and functionalities at reduced costs in computations and communications when compared to UABKMPs, UAKMPs, and SMBUAKEPs. • Users of HIoTNs (Hierarchical IoT Networks) want to get real-time data from specific sensors in a specific implementation. • Secure Multimodal Biometrics-based User Anonymous Authenticated Key Management Protocol (SMUAAKMPs) block chain technologies. • Improved safety and reduced costs in computations and communications when compared to UABKMPs, UAKMPs, and SMBUAKEPs. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a series of attacks on DSA schemes that, under certain assumptions, can expose the secret key when one or more signed messages are accessible. By utilizing these signed messages, we construct a system of linear congruences with at most one solution smaller than a specific bound, which can be efficiently determined using Babai's Nearest Plane Algorithm. As a case study, we provide a successful attack on secp161k1, assuming that a particular multiple of an ephemeral key is 161 bits long. [ABSTRACT FROM AUTHOR]

In this paper, we present a deterministic attack on (EC)DSA signature scheme, providing that several signatures are known such that the corresponding ephemeral keys share a certain amount of bits without knowing their value. By eliminating the shared blocks of bits between the ephemeral keys, we get a lattice of dimension equal to the number of signatures having a vector containing the private key. We compute an upper bound for the distance of this vector from a target vector, and next, using Kannan's enumeration algorithm, we determine it and hence the secret key. The attack can be made highly efficient by appropriately selecting the number of shared bits and the number of signatures. [ABSTRACT FROM AUTHOR]

Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms of attacks. With symmetric encryption, both parties can encrypt and decrypt messages using the same key. Lattice attacks on digital signature algorithms (ECDSA) involve forming a basis and setting a target vector from signatures, then solving the closest vector problem (CVP) or shortest vector problem (SVP) in the generated lattice to obtain the private key. Prior research focused on obtaining leakage information from the signature’s random nonce to facilitate a CVP or SVP solution. This study establishes a clear boundary for a successful ECDSA attack and introduces a “double basis” lattice version that expands the boundary or reduces the necessary signatures by nearly half with the same lattice rank. To approach the boundary, a heuristic strategy is employed to shift the target vector in different directions with a feasible step size, using tests on the Trusted Platform Module (TPM) 2.0 ECDSA. The distance from the closest moved target vector to the boundary is reduced by a ratio of 424 to 179 to the minimal length of orthogonal vectors in the formed basis. Experimental results show that moving attempts in two directions with the original basis and 84 signatures take approximately 247.7 s on the experiment computer.

The privacy and utility are treated as a major factor in influencing the role of data privacy preservation in cloud environments. There exists a trade-off between these two factors, where one factor should compromise its functionality over the other. It is hence necessary to maintain both utility and privacy for a data offloaded or accessed across cloud computing environment. In this paper, we develop a utility privacy model that established utility using Deep Adaptive Clustering (DAC) and privacy using Elliptic Curve Digital Signature Algorithm (ECDSA). The utility is performed using clustering of the input datasets using DAC and the privacy is maintained using ECDSA. The simulation is conducted on specific datasets to test the efficacy of the model and the results shows improved accuracy on clustering, and efficient privacy metrics than existing methods. [ABSTRACT FROM AUTHOR]

The future of Internet of Things (IoT) foresees a world of interconnected people with every physical object in a seamless manner. The security related aspects for the IoT world are still an open field of discussion and research. The Message Queue Telemetry Transport (MQTT) application layer protocol is widely used in IoT networks. Since, MQTT standard has no mandatory requirements regarding the security services, therefore, manipulating the security related issues is different in MQTT platforms. This paper proposes a novel security protocol. It is the Protected Message Queue Telemetry Transport (PMQTT) protocol which is based on MQTT with added cryptographic primitives to offer security services for IoT systems. Moreover, a formal verification for a PMQTT protocol is conducted using the ProVerif cryptographic automated verifier tool to prove that the PMQTT protocol satisfies the intended security properties.

Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighboring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. In this paper, we present a resistive to selective drop attack (RSDA) scheme to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, jitter, and routing overhead at a different pause time are reduced to 9%, 0.11%, and 45%, respectively. The packet drop rate at varying mobility speed in the presence of one gray hole and two gray hole nodes are obtained as 13% and 14% in RSDA scheme.

The future of Internet of Things (IoT) foresees a world of interconnected people with every physical object in a seamless manner. The security related aspects for the IoT world are still an open field of discussion and research. The Message Queue Telemetry Transport (MQTT) application layer protocol is widely used in IoT networks. Since, MQTT standard has no mandatory requirements regarding the security services, therefore, manipulating the security related issues is different in MQTT platforms. This paper proposes a novel security protocol. It is the Protected Message Queue Telemetry Transport (PMQTT) protocol which is based on MQTT with added cryptographic primitives to offer security services for IoT systems. Moreover, a formal verification for a PMQTT protocol is conducted using the ProVerif cryptographic automated verifier tool to prove that the PMQTT protocol satisfies the intended security properties. [ABSTRACT FROM AUTHOR]

Elliptic Curve Digital Signature Algorithm (ECDSA) is a public key cryptographic algorithm based on the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP), it is used to ensure users' authentication, data integrity and transactions non-repudiation. However, its weakness is to derive the signer's private key in case he uses the same random number for to generate two signatures for two different messages. Firstly, in this paper we present the ECDSA and analyse its variants proposed in the literature.Also, we propose a new improvement technique for ECDSA of Liao and Shen and ECDSA of Chande and Lee. We intend to do so by introducing the unknown parameters which are used in the verification of the signature. Our aim is to overcome the problem which has not been explained in ECDSA schemes of both Liao and Shen and Chande and Lee. [ABSTRACT FROM AUTHOR]

Although digital signature has been a fundamental technology for cryptosystems, it still draws considerable attention from both academia and industry due to the recent raising interest in blockchains. This article revisits the subliminal channel existing digital signature and reviews its abuse risk of the constructor’s private key. From a different perspective on the subliminal channel, we find the new concept named the chamber of secrets in blockchains. The found concept, whereby the secret is hidden and later recovered by the constructor from the common transactions in a blockchain, highlights a new way to encourage implementing various applications to benefit efficiency and security. Thus, the proposed scheme benefits from the following advantages: (1) avoiding the high maintenance cost of certificate chain of certificate authority, or public key infrastructure, and (2) seamlessly integrating with blockchains using the property of chamber of secrets. In order to easily understand the superiority of this new concept, a remote authentication scenario is taken as a paradigm of IoT to demonstrate that the further advantages are achieved: (1) avoiding high demand for storage space in IoT devices, and (2) avoiding maintaining a sensitive table in IoT server.

We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently. Using this result, we develop attacks against the DSA schemes which, under some assumptions, can provide the secret key in the case where one or several signed messages are available.

Today’s developing era data and information security plays an important role in unsecured communication between Internet of Things (IoT) elements. In IoT, data are transmitted in plaintext for many reasons. One of the most common reason is the availability of hardware. Many IoT products are inexpensive components with limited memory and computational resources. Such devices might be unable to support the computationally intense cryptographic functions of asymmetrical cryptography. If designers considered the privacy implications of unencrypted data, they have limited options for encryption because of the hardware platform. Therefore the designers have to create their own security protocols or implement stripped-down versions of existing security protocols. The second option has a better chances. Evidence recommends such a modified protocol would run efficiently on small devices. Elliptic Curve Cryptography (ECC) is used to ensure complete protection against the security risks such as confidentiality, integrity, privacy and authentication by implementing an Elliptic Curve Cryptoprocessor. The work focuses on high-performance Elliptic Curve Cryptoprocessor design, optimized for Field Programmable Gate Array (FPGA) implementation, using the concept of asymmetric and hash algorithms. A novel cryptographic algorithm consisting of matrix mapping methodology and hidden generator point theory is to be applied for encryption/decryption between the sender and receiver whereas Elliptic Curve Digital Signature Algorithm (ECDSA) designed using Keccak Secured Hash Algorithm (SHA) algorithm is applied for the validation of the encrypted data. The proposed Cryptoprocessor operates at a minimum period of 6.980 ns and maximum frequency of 143.276 MHz. This work focuses on the practicability of public key cryptography implementation for devices connected in the perceptual layer of IoT.

Quantum computers are expected to have a dramatic impact on numerous fields due to their anticipated ability to solve classes of mathematical problems much more efficiently than their classical counterparts. This particularly applies to domains involving integer factorization and discrete logarithms, such as public key cryptography. In this paper, we consider the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions. We then propose a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a quantum-resistant digital signature scheme. The transition protocol functions even if ECDSA has already been compromised. While our scheme requires modifications to the Bitcoin protocol, these can be implemented as a soft fork.