Signature Generation Time Research Articles

Elliptic curves cryptography for lightweight devices in IoT system

The Internet of Things (IoT) is revolutionizing industries by connecting billions of devices, ranging from home appliances to industrial machines, to the internet. This transformation enables unprecedented automation, data collection, and process optimization. However, the widespread adoption of IoT also introduces significant security challenges, especially for lightweight devices with limited computational power and energy resources. Ensuring secure communication and data integrity in such constrained environments is critical. This paper explores and compares the performance of implemented algorithms within IoT devices. A comparison between Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) implementations is made to identify a lightweight, secure, and efficient solution for IoT environments. Our results indicate that ECC outperforms RSA in terms of memory requirements, overall energy consumption, key sizes, signature generation time, key generation and execution time, and decryption time in a resource-constrained environment. However, RSA performs better in signature verification and encryption.

Efficient Linkable Ring Signature Scheme over NTRU Lattice with Unconditional Anonymity.

In cloud and edge computing, senders of data often want to be anonymous, while recipients of data always expect that the data come from a reliable sender and they are not redundant. Linkable ring signature (LRS) can not only protect the anonymity of the signer, but also detect whether two different signatures are signed by the same signer. Today, most lattice-based LRS schemes only satisfy computational anonymity. To the best of our knowledge, only the lattice-based LRS scheme proposed by Torres et al. can achieve unconditional anonymity. But the efficiency of signature generation and verification of the scheme is very low, and the signature length is also relatively long. With the preimage sampling, trapdoor generation, and rejection sampling algorithms, this study proposed an efficient LRS scheme with unconditional anonymity based on the e-NTRU problem under the random oracle model. We implemented our scheme and Torres et al.'s scheme, as well as other four efficient lattice-based LRS schemes. It is shown that under the same security level, compared with Torres et al.'s scheme, the signature generation time, signature verification time, and signature size of our scheme are reduced by about 94.52%, 97.18%, and 58.03%, respectively.

Generic, efficient and isochronous Gaussian sampling over the integers

Gaussian sampling over the integers is one of the fundamental building blocks of lattice-based cryptography. Among the extensively used trapdoor sampling algorithms, it is ineluctable until now. Under the influence of numerous side-channel attacks, it is still challenging to construct a Gaussian sampler that is generic, efficient, and resistant to timing attacks. In this paper, our contribution is three-fold. First, we propose a secure, efficient exponential Bernoulli sampling algorithm. It can be applied to Gaussian samplers based on rejection samplings. We apply it to FALCON, a candidate of round 3 of the NIST post-quantum cryptography standardization project, and reduce its signature generation time by 13–14%. Second, we develop an isochronous Gaussian sampler based on rejection sampling. Our Algorithm can securely sample from Gaussian distributions with different standard deviations and arbitrary centers. We apply it to PALISADE (S&P 2018), an open-source lattice-based cryptography library. During the online phase of trapdoor sampling, the running time of the G-lattice sampling algorithm is reduced by 44.12% while resisting timing attacks. Third, we improve the efficiency of the COSAC sampler (PQC 2020). The new COSAC sampler is 1.46x–1.63x faster than the original and has the lowest expected number of trials among all Gaussian samplers based on rejection samplings. But it needs a more efficient algorithm sampling from the normal distribution to improve its performance.

Blockchain-Based Dashcam Video Management Method for Data Sharing and Integrity in V2V Network

A dashboard camera (Dashcam) is attached to the front or rear of a vehicle to record images and video. As it is effective in crime prevention and accident management and it can also be used as learning data for Traffic Accident Detection technology for Autonomous Vehicles the use of Dashcam is increasing. However, the video data is stored on a memory card or a cloud server, so there is a high possibility of data loss and forgery. Although it is possible to prevent forgery and falsification using distributed storage based on blockchain technology, the authenticity and privacy of the image data stored in the blockchain cannot be guaranteed. In this study, to solve this problem, we propose a multi-signature-based access control method by grouping and storing video data of multiple vehicles based on GPS (Global Positioning System) data. To ensure the privacy of the video data stored in the blockchain, only users uploading video belonging to the relevant GPS can access nearby Dashcam videos. Through these experimental results, it show that Experimental results proposed method can maintain low latency in large-scale request environment to the privacy and reach data management efficiently in a distributed file system. According to our experiments, the dashcam video data distributed storage latency was fast enough, with an average of 25 ms for uploads and less than 15 ms for downloads. The signature generation time is 10ms, and the verification time required for access control is also less than 100 ms, which is the same even if the number of nodes increases, so scalability is not affected. The blockchain transaction processing took about 2 seconds, but it does not affect the V2V network. Also, client registration time does not affect performance.

Multi-Zone Authentication and Privacy-Preserving Protocol (MAPP) Based On the Bilinear Pairing Cryptography for 5G-V2X.

5G-Vehicle-to-Everything (5G-V2X) supports high-reliability and low latency autonomous services and applications. Proposing an efficient security solution that supports multi-zone broadcast authentication and satisfies the 5G requirement is a critical challenge. In The 3rd Generation Partnership Project (3GPP) Release 16 standard, for Cellular- Vehicle-to-Everything (C-V2X) single-cell communication is suggested to reuse the IEEE1609.2 security standard that utilizes the Public Key Infrastructure (PKI) cryptography. PKI-based solutions provide a high-security level, however, it suffers from high communication and computation overhead, due to the large size of the attached certificate and signature. In this study, we propose a light-weight Multi-Zone Authentication and Privacy-Preserving Protocol (MAPP) based on the bilinear pairing cryptography and short-size signature. MAPP protocol provides three different authentication methods that enable a secure broadcast authentication over multiple zones of large-scale base stations, using a single message and a single short signature. We also propose a centralized dynamic key generation method for multiple zones. We implemented and analyzed the proposed key generation and authentication methods using an authentication simulator and a bilinear pairing library. The proposed methods significantly reduce the signature generation time by 16 times–80 times, as compared to the previous methods. Additionally, the proposed methods significantly reduced the signature verification time by 10 times–16 times, as compared to the two previous methods. The three proposed authentication methods achieved substantial speed-up in the signature generation time and verification time, using a short bilinear pairing signature.

New digital signature algorithm based on ECC and its application in bitcoin and IoT

Elliptic curve digital signature algorithm (ECDSA) is the simulation of digital signature algorithm (DSA) algorithm on elliptic curve. Compared with DSA, ECDSA has higher security and is the only widely accepted ECDSA, which has been adopted by many standardisation organisations. Based on the study of the original ECDSA scheme, this paper attempts to propose a new improved scheme. The proposed scheme has one main improvement. That is, considering that the original scheme has a finite field inversion process in the signature equation, the time-consuming inversion operation is completely avoided in the design. The proposed scheme has faster computation speed and reduces the ratio of verifying signature to signature generation time. The algorithm has certain significance for improving the efficiency of elliptic curve cryptography. Our simulation results show that the scheme runs faster and has higher signature and verification efficiency than that of the original scheme without compromising security. What's more, we also explore its application in bitcoin and Internet of Things (IoT).

Light-weight hashing method for user authentication in Internet-of-Things

The goal of Internet-of-Things (IoT) is that every object across the globe be interconnected under the Internet Infrastructure. IoT is expanding its application domain to range from environmental monitoring to industrial automation thereby leading to vast research challenges. Vast presence of devices in the Internet has increased the possible challenges faced by devices and data. The devices communicate on a public channel that is more likely to be accessed by unauthorized users and disturb the privacy of genuine users. The existing solutions that ensure data authenticity and user privacy, use MD5 and SHA-family of hashing algorithms under digital signature schemes. These algorithms create a trade-off between the security concern and energy consumption of IoT devices. To provide an energy efficient authentication method, we propose a customized BLAKE2b hashing algorithm with modified elliptic curve digital signature scheme (ECDSA). The parameters considered for the evaluation of the proposed methods are signature generation time, signature verification time and hashing time. The experiments are conducted under client server model using Raspberry Pi-3. The proposed method has shown about 0.7–1.91% improvement in the signature generation time and 7.67–9.13 % improvement in signature verification time when compared with BLAKE2b based signature generation/verification. The proposed method is resistant to Man-in-the-Middle attack, Distributed DoS attack (DDoS), pre-image resistance, second pre-image resistance and collision resistance. Based on the performance obtained by the experiments, it can be inferred that the proposed scheme is feasible for resource-constrained IoT devices.

CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS

Let n = pq be an RSA modulus with unknown prime factors of equal bit-size. Let e be the public exponent and d be the secret exponent satisfying ed ≡ 1 mod ϕ(n) where ϕ(n) is the Euler totient function. To reduce the decryption time or the signature generation time, one might be tempted to use a small private exponent d. Unfortunately, in 1990, Wiener showed that private exponents smaller than [Formula: see text] are insecure and in 1999, Boneh and Durfee improved the bound to n0.292. In this paper, we show that instances of RSA with even large private exponents can be efficiently broken if there exist positive integers X, Y such that |eY - XF(u)| and Y are suitably small where F is a function of publicly known expression for which there exists an integer u ≠ 0 satisfying F(u) ≈ n and pu or qu is computable from F(u) and n. We show that the number of such exponents is at least O(n3/4-ε) when F(u) = p(q - u).

모바일 환경에서 전자 계약 시스템의 설계 및 구현 : M-XContract

모바일 단말기의 하드웨어 한계, 단말기에 탑재된 시스템의 비호환성, 무선의 낮은 대역폭 등으로 인해 유선 환경의 전자 계약 시스템을 M-Commerce에 그대로 적용하기에는 무리가 있다. 본 논문은 이러한 문제점들을 해결하기 위해 XML 기반의 전자 계약서를 정의하고 이를 바탕으로 모바일 환경에 적합한 전자 계약 시스템 M-XContract를 설계 구현한 내용을 다룬다. M-Xcontract 시스템은 전자 계약 서버, PDA 상에서 고객과 계약하고 전자 서명된 계약서를 서버에 전송하는 M-ESign 모듈, 서명된 전자 계약서를 서버로부터 수신한 후 고객에게 보여주는 M-EDecoder 모듈, 그리고 전자 계약서 저작 도구 X-Auth로 구성된다 M-XContract 시스템의 성능을 분석하기 위해 PDA 상에서 전자 서명 생성 시간, 서버로 전송 시간을 측정하였다. 성능 분석 결과 M-XContract 시스템은 모바일 전자 계약 시스템을 위한 효과적인 모델이라는 결론을 얻었다. Due to hardware resource limit and system incompatibility of the mobile device, and low bandwidth of wireless communication, there are a few difficulties in introducing the digital contract system based on wired communication to M-Commerce. To get over the difficulties, this paper defines a digital contract based upon XML and then addresses the design and implementation of M-XContract, a digital contract system for the mobile environment. M-XContract system has been constructed with the digital contract server, M-ESign module which contracts with the customer on the PDA and transfers the contract digitally signed to the server, M-EDecoder module which shows the contract to the customer from the server, and X-Auth which is a contract authoring tool. To evaluate the run-time performance of the M-XContract, we measured the digital signature generation time and transfer time to the server. The evaluation results show that the M-Xcontract is an efficient model for the mobile contract system.