Batch Verification Suitable for Efficiently Verifying a Limited Number of Signatures

Hakuta, Keisuke; Katoh, Yosuke; Sato, Hisayoshi; Takagi, Tsuyoshi

doi:10.1007/978-3-642-37682-5_30

Cited by 8 publications

(5 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the most important considerations in implementing blockchain technology is the measurement of time between uploading data and attaining immutability (confirmation time). For systems with a large number of nodes frequently generating new data, aggregate verification may be implemented to efficiently verify many signatures simultaneously in one action [31]. One such example of this form of implementation may be in IoT devices which require periodic firmware and software updates.…”

Section: Aggregate Verificationmentioning

confidence: 99%

“…In the case of immediate verification of items uploaded to the blockchain, some blockchains may choose to require fewer block confirmations for signature verification, thereby compromising security [33]. Therefore, in addition to the aggregate verification case described above, a new aggregate verification application has been proposed in [31] in which a system may need to verify a smaller number of signatures with high efficiency and minimized confirmation time. For example, an IP camera surveillance system may have cameras with a framerate of 15 FPS, with each device generating approximately 1.25 million images in one day.…”

Section: Aggregate Verificationmentioning

confidence: 99%

See 1 more Smart Citation

Secured Multi-Layer Blockchain Framework for IoT Aggregate Verification

Sie¹,

Wu²,

Harding³

et al. 2022

Adv. sci. technol. eng. syst. j.

View full text Add to dashboard Cite

Section: Aggregate Verificationmentioning

confidence: 99%

Section: Aggregate Verificationmentioning

confidence: 99%

Secured Multi-Layer Blockchain Framework for IoT Aggregate Verification

Sie¹,

Wu²,

Harding³

et al. 2022

Adv. sci. technol. eng. syst. j.

View full text Add to dashboard Cite

“…) appear in the eight messages as depicted in Figure 7, the number of calculations T worst is 11 exponential operations (see Figure 10). Even though it is just σ ′ 1 and σ ′ 8 that being illegal, (11) still need to compute σ 2 and σ 7 , because they are located in the same tree. that located in the different tree, the number of calculations become 15 exponential operations (see Figure 11).…”

Section: ) the Best-case Scenariomentioning

confidence: 99%

“…Batch verification is a method for verifying large amounts of digital signatures at once. This method can reduce the computational cost compared to one-by-one schemes [11]. Without batch verification, a sequentially large number of signatures could take a long time and undeniably cause a bottleneck at the RSUs and OBUs.…”

Section: Introductionmentioning

confidence: 99%

A Lightweight BT-Based Authentication Scheme for Illegal Signatures Identification in VANETs

Cahyadi

Hwang

2022

IEEE Access

View full text Add to dashboard Cite

Research related to vehicular ad hoc networks (VANETs) has received some significant attention in recent years. Despite all the advantages, the security and privacy in VANETs still become the main challenge that is widely open to discussion. The authentication scheme plays a substantial role to guarantee the security and privacy of information circulation and verification efficiency in VANETs. In this high-density environment, a scalability issue would emerge when the number of message-signature pairs received by a roadside unit (RSU) or vehicles becomes large. This issue happens because those entities cannot sequentially verify each received signature according to the required time limit. Some researchers believe that the symmetric cryptography-based authentication scheme provides a lightweight verification operation, which leads to low computation and communication costs. Combined with the batch verification process, this approach can be very beneficial. However, to the best of our knowledge, not many of those related schemes provide a realistic scenario regarding some illegal signatures' appearance. Could the system identify the forged messages? Is it still efficient enough to do such an operation? In this paper, we propose a lightweight binary tree-based (BT-based) authentication scheme with a batch verification mechanism, that could efficiently identify a modest amount of illegal signatures in the sum of messages. To even improve the operation, we combine our BT-based batch verification scheme with our vehicle reputation scoring system. Given any n received messages with b ≥ 1 illegal ones, the computation cost to verify all these messages only requires approximately (2[⌈lg n⌉ − lg(⌈ b 2 ⌉2)] + 2 ⌈lg(⌈ b 2 ⌉2)⌉+1 − 1) pairing operations, as the best-case scenario. By this approach, we can guarantee the best-case scenario (the most desirable condition) in our BT-based identification appear as much as possible. Hence, the computation cost can be kept low.

show abstract

“…The uniqueness and the minimality are not only of intrinsic mathematical interest, but also desirable in some cryptographic applications such as batch verification (cf. [8], [9], [15]). For higher width version of the τ -NAF on Koblitz curves or another special types of elliptic curves, these properties have been investigated (cf.…”

Section: Introductionmentioning

confidence: 99%

Some properties of $${\tau }$$ τ -adic expansions on hyperelliptic Koblitz curves

Hakuta

Sato

Takagi

2017

J. Appl. Math. Comput.

Self Cite

View full text Add to dashboard Cite

This paper explores two techniques on a family of hyperelliptic curves that have been proposed to accelerate computation of scalar multiplication for hyperelliptic curve cryptosystems. In elliptic curve cryptosystems, it is known that Koblitz curves admit fast scalar multiplication, namely, the τ -adic non-adjacent form (τ -NAF). It is shown that the τ -NAF has the three properties: (1) existence, (2) uniqueness, and (3) minimality of the Hamming weight. These properties are not only of intrinsic mathematical interest, but also desirable in some cryptographic applications. On the other hand, Günther, Lange, and Stein have proposed two generalizations of τ -NAF for a family of hyperelliptic curves, called hyperelliptic Koblitz curves. However, to our knowledge, it is not known whether the three properties are true or not.We provide an answer to the question. Our investigation shows that the first one has only the existence and the second one has the existence and uniqueness. Furthermore, we shall prove that there exist 16 digit sets so that one can achieve the second one.

show abstract

Batch Verification Suitable for Efficiently Verifying a Limited Number of Signatures

Cited by 8 publications

References 27 publications

Secured Multi-Layer Blockchain Framework for IoT Aggregate Verification

Secured Multi-Layer Blockchain Framework for IoT Aggregate Verification

A Lightweight BT-Based Authentication Scheme for Illegal Signatures Identification in VANETs

Some properties of $${\tau }$$ τ -adic expansions on hyperelliptic Koblitz curves

Contact Info

Product

Resources

About