Efficient online/offline identity-based signature for wireless sensor network

Liu, Joseph K.; Baek, Joonsang; Zhou, Jianying; Yang, Yanjiang; Wong, Jun Wen

doi:10.1007/s10207-010-0109-y

Cited by 121 publications

(74 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Important Remark: Similar kind of key constructs for identity based cryptosystem can be seen in [9], [12] and [14]. In [9], an identity based key agreement protocol was proposed by Dario et al, in [12] a deterministic aggregate signature scheme was proposed by Javier Herranz and in [14] an identity based online/offline signature was proposed by Liu et al.…”

Section: Unforgeabilitymentioning

confidence: 94%

“…In [9], an identity based key agreement protocol was proposed by Dario et al, in [12] a deterministic aggregate signature scheme was proposed by Javier Herranz and in [14] an identity based online/offline signature was proposed by Liu et al. In this section, we describe a new identity based aggregate signature scheme based on the identity based signature scheme by Galindo et al [10].…”

Section: Unforgeabilitymentioning

confidence: 99%

See 1 more Smart Citation

Identity based partial aggregate signature scheme without pairing

Selvi

Vivek

Shriram

et al. 2012

2012 35th IEEE Sarnoff Symposium

View full text Add to dashboard Cite

Abstract. An identity based signature allows users to sign their documents using their private keys and the signature can be verified by any one, using the identity of the signer and public parameters of the system. An aggregate signature scheme is a digital signature scheme which allows aggregation of different signatures by different users on different messages. The primary objective of aggregate signature scheme is to achieve both computational and communication efficiency. Here, we propose an identity based aggregate signature scheme, which uses a variation of light weight Schnorr type identity based signature scheme, where in the signers need not agree upon a common randomness and the aggregation is done without having any kind of interaction among the signers. The scheme does not involve any pairing operations even for aggregate signature verification. It is computationally efficient since it avoids the costlier operation in elliptic curve groups (Bilinear Pairings). It should be noted that our signature achieves only partial aggregation because the private key of each user is generated by a randomized extract algorithm and hence a random value is to be propagated with each single signature generated.

show abstract

Section: Unforgeabilitymentioning

confidence: 94%

Section: Unforgeabilitymentioning

confidence: 99%

Identity based partial aggregate signature scheme without pairing

Selvi

Vivek

Shriram

et al. 2012

2012 35th IEEE Sarnoff Symposium

View full text Add to dashboard Cite

show abstract

“…The online/offline encryption strategy is more suitable for lightweight equipment such as wireless sensor nodes or smart cards [12,13]. Online/offline identity-based encryption scheme has attracted extensive attention, and series of research results have emerged [14][15][16]. Recently online/offline technology is also used in attribute-based encryption [17,18].…”

Section: Wireless Communications and Mobile Computingmentioning

confidence: 99%

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

Wang

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Anonymous multireceiver encryption scheme can not only protect the privacy of the receiver but also ensure the security of message. However, the computational cost of this scheme is very large. It is not suitable for the sender which has limited resources, such as mobile devices and sensor nodes. In this work, an anonymous multireceiver online/offline identity-based encryption is proposed based on offline/online and identity-based encryption (IBE). In identity-based encryption scheme, the sender can encrypt the message using the unique information of the user (such as identity number or e-mail address) as its public key. The receiver obtains the private key from a central authority. For mobile device with limited resource, the online/offline encryption scheme can reduce the computational cost. Compared to the previous anonymous multireceiver schemes, the proposed scheme can efficiently encrypt message with offline/online method and ensure the anonymity of receivers. The analysis results also show that our scheme is efficient in terms of computational cost by comparing to the previous works.

show abstract

“…A cluster formation procedure is thought to be dynamic (otherwise as static) once it includes a regular (periodic or event driven) CH election [8] or cluster reorganization procedures [9], either to effectively react to constellation changes and change befittingly the cluster topology, or just aiming at the acceptable rotation of the CH role among the nodes to achieve in energy potency.…”

Section: Cluster Formationmentioning

confidence: 99%

HEF Clustering for Secure and Efficient Data Transmission in CWSN

Salimon¹,

Lavanya²,

Mathivanan³

2015

IJCA

View full text Add to dashboard Cite

Among the modern wireless networks, wireless sensor network plays a prominent role. Bunch reduces the general energy consumption. In this paper HEF (High Energy First) bunch protocol is employed. This protocol provides improved network time period since the energy level of the nodes are considered while choosing the cluster head. The cluster area is fashioned dynamically and sporadically. The cluster heads are usually having more resources (generally energy) on comparison with other nodes in the cluster. We tend to propose a globally trust management theme that enhance security in WSNs. In this trust management scheme, trust model takes 2 methodologies, trust from direct observation methodology and trust from indirect observation method. In direct observation methodology observer node gets trust value by exploiting theorem reasoning. On the other hand, with indirect observation trust value is obtained from neighbor nodes of the observer node. The trust value for this methodology is based on Dempster-Shafer theory. Combining these 2 trust models, we tend to get a lot of correct trust values that results the effectiveness of our methodology.

show abstract

Efficient online/offline identity-based signature for wireless sensor network

Cited by 121 publications

References 28 publications

Identity based partial aggregate signature scheme without pairing

Identity based partial aggregate signature scheme without pairing

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

HEF Clustering for Secure and Efficient Data Transmission in CWSN

Contact Info

Product

Resources

About