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.

Wireless sensor networks (WSNs) have been widely used in many applications recently. As an important application of the WSNs, the wireless medical sensor networks (WMSNs) could improve health-care quality and have become significant in the modern medical system. WMSNs devices typically have limited computing, storage and communication capabilities. To enhance the capabilities of WSNs, cloud-assisted WMSNs have been introduced, and they can provide more efficient processing of cloud users' medical data records stored in the cloud. The integrity of medical data records is very important since these data will be used to provide a medical diagnosis and other medical treatments. In this paper, we propose an efficient integrity verification scheme for medical data records in cloud-assisted WMSNs. Based on elliptic curve digital signature algorithm, we construct linearly homomorphic authenticator, so that the third party auditor (TPA) can verify the the integrity of medical data records without bringing in new security threats. TPA does not need to retrieve the entire medical data records, thus can dramatically reduce the communication and computation overhead. Moreover, we further extend our scheme to support batch integrity verification for multiple cloud users simultaneously. In particular, to achieve efficient medical data dynamic operations, using index hash tables, our scheme can execute dynamic operations efficiently. Performance comparison shows that our scheme is more light-weight, and can be used much more practically in cloud-assisted WMSNs. [ABSTRACT FROM AUTHOR]

The evolution of the cloud computing furnishes a better way for the data storage. ABE with delegation is accustomed for accessing the data and keep it confidential. But this scheme faces some limitations like the cloud servers can replace the cipher text with some malignant intent. They may also cheat the eligible users as unauthorized ones. The cloud servers even face external threats like the security attacks. So, to protect against the security attacks and to preserve the data integrity in the cloud, a hybrid encryption with VD scheme is proposed by Xu et al. Even this scheme faces the challenges like having larger keys, more computational time and vulnerability to man-in-the-middle attacks. A secure Hybrid Encryption using ECC in clouds is proposed to overcome these problems. The application of Elliptic Curve Cryptography and its algorithms in the proposed work provides a greater security because of the Elliptic Curve Discrete Logarithm Problem. The proposed work ensures greater security with the aid of a smaller key size. It also ensures less computational time, less memory and communication bandwidth. [ABSTRACT FROM AUTHOR]

Elliptic curve cryptosystems proved to be well suited for securing systems with constrained resources like embedded and portable devices. In a fault-based attack, errors are induced during the computation of a cryptographic primitive, and the results are collected to derive information about the secret key safely stored in the device.We introduce a novel attack methodology to recover the secret key employed in implementations of the Elliptic Curve Digital Signature Algorithm. Our attack exploits the information leakage induced when altering the execution of the modular arithmetic operations used in the signature primitive and does not rely on the underlying elliptic curve mathematical structure, thus being applicable to all standardized curves. We provide both a validation of the feasibility of the attack, even employing common off-the-shelf hardware to perform the required computations, and a low-cost countermeasure to counteract it. [ABSTRACT FROM AUTHOR]

Booming telemedicine applications makes it deemed necessary to provide security services for such applications. The algorithms proposed in this field can be grouped into three classes: watermarking‐based algorithms, crypto‐based algorithms and hybrid algorithms. In this study, the authors propose two crypto‐based algorithms capable of providing confidentiality, authenticity and integrity services to medical images exchanged in telemedicine applications. Strong cryptographic functions with internally generated symmetric keys and hash codes are used. The advanced encryption standard‐Galois counter mode is used with the whirlpool hash function to provide confidentiality and authenticity, and the elliptic curve digital signature algorithm is used to provide authenticity and integrity. The proposed algorithms are based on the digital imaging and communication in medicine (DICOM) standard; however, unlike the standard, the algorithms provide confidentiality, authenticity and integrity for the header data, as well as for the pixel data of the DICOM images. Effectiveness of the proposed algorithms is evaluated and demonstrated through extensive experimentation using a benchmark set of DICOM images. [ABSTRACT FROM AUTHOR]

Cheque Truncation System (CTS) is a technique of preventing tangible movement of cheque by substituting it with a digital image, with an aim for secure and faster clearance. For the first time re-watermarking is applied for authenticating transactions in CTS. Methodology for the proposed approach splits the host image (Ih) into two layers (L). InL1cheque details are fused with two image color channels to form a composite message (Cm). Secure hash algorithm (SHA-512) is applied toCmto generate a unique message digest (Md). Elliptic Curve Digital Signature Algorithm (ECDSA) is applied toMdto create a digital signature. The signature is embedded by exploiting Human Visual System (HVS) color channel sensitivity in equally parted mode. InL2, joint secret is established to form key using Elliptic Curve Diffie Hellman Protocol (ECDHP). Advanced Encryption Standard (AES) is applied to user details intricate in the transaction. Encrypted contents are then inserted inL2by applying Discrete Cosine Transform (DCT). Experimental results state solution to integrity concerns by using ECDSA with SHA-512, reaction to security issues by AES and the response to key distribution problem by ECDHP. An effective semi-blind CTS is perceived with PSNR between 59-60 dB. [ABSTRACT FROM AUTHOR]

ABSTRACT Recently, mobile networks are more and more popular in providing the most pursuing pervasive networking services. Many technologies are deployed in mobile networks, such as Universal Mobile Telecommunication System (UMTS). In these communication systems, user secrecy and privacy are important issues and should be managed seriously. To avoid security threats, many studies on authentication in the mobile networks are proposed. In 2008, Juang and Wu introduced an authentication scheme with user privacy protection in UMTS networks. It resisted and avoided many security attacks and threats, but there are still some problems, such as the incomplete defense against the impersonation attack and data with International Mobile Subscriber Identity exchanged outside home networks. In this paper, we proposed a simple and rapid authentication scheme in mobile networks. The proposal applies the Elliptic Curve Diffie-Hellman key agreement protocol to exchange the session key safely and Elliptic Curve Digital Signature Algorithm to improve the mobile security. It also deploys the temporary key mechanism to speed up the authentication while user is roaming in the mobile networks. The analysis shows that our mechanism not only improves Juang and Wu's proposal but also is a more secure and simple authentication protocol. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this study, we propose a blind digital signature (BDS) scheme based on the elliptic curve digital signature algorithm that increases the performance significantly. The security of our scheme is based on the difficulty of the elliptic curve discrete algorithm problem. Therefore, it offers much smaller key lengths for the desired security levels, along with much faster cryptographic processes, leading to fewer hardware and software requirements. According to our simulation results, the relative performance improvement of our proposed BDS scheme is up to 96% when compared with previously proposed schemes. [ABSTRACT FROM AUTHOR]

ABSTRACT Wireless mesh networks (WMNs) are one of the key technologies that will dominate wireless networking in the few years. The main characteristics of WMNs permit network connectivity anywhere anytime with simplicity and low cost. Their capability for self-organization significantly reduces the complexity of network deployment. The draft standard of IEEE P802.11 s™/D4.0 is not considered secure for the routing protocol. In this paper, we propose a secure Hybrid-Wireless-Mesh Protocol using an Elliptic Curve Digital Signature Algorithm (ECDSA-HWMP). We then compare the ECDSA-based HWMP against identity-based encryption (IBE)-based HWMP. This study has been carried out to show the great benefits of the IBE technique in securing HWMP. Through extensive Network Simulator-3 simulations, results have shown that the IBE-HWMP outperforms the ECDSA-HWMP in terms of overhead, throughput, loss ratio and delay. Simulation results show that the use of the IBE-based HWMP provides a greater level of security with light overhead. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In a vehicular ad hoc network (VANET), a road-side infrastructure or road-side unit (RSU) is anticipated to be installed at some road-side location. This exposes the VANET to several different adversaries. In this paper, we present an authentication scheme for infrastructure-generated safety messages using an identity (ID)-based proxy signature and verification mechanism. An ID-based technique offers a certificate-less public key verification, while a proxy signature provides flexibility in message authentication and trust management. We incorporate an ID-based proxy signature framework with the standard elliptic curve digital signature algorithm for safety application messages from RSU. We also provide forwarding of safety message components ensuring the accountable authentication of RSU's application messages. Security analysis and network simulation prove that our scheme is resilient to all major security threats, compatible to standards and efficient in terms of computation complexity. We also conduct simulation experiments to determine the most suitable access classes for on-board unit and RSU. [ABSTRACT FROM PUBLISHER]