An efficient identity-based signature scheme with batch verifications

Digital rights management (DRM) system is a technology based mechanism to ensure only authorized access and legal distribution/consumption of the protected digital content. DRM system deals with the whole lifecycle of the digital content including production, management, distribution and consumption. DRM schemes are effective means for the transfer of digital content and safeguard the intellectual property. Recently, Yang et al. proposed a smart-card based DRM authentication scheme providing mutual authentication and session key establishment among all the participants of the DRM environment. We show that their scheme does not resist threats like smart card attack; fails to provide proper password update facility; and does not follow forward secrecy. To overcome these weaknesses, we propose an improvement of Yang et al.'s scheme. The security of our scheme remains intact even if the smart card of the user is lost. In our scheme, user's smart card is capable of verifying the correctness of the inputted identity and password and hence contributes to achieve an efficient and user-friendly password update phase. In addition, the session keys established between the participating entities are highly secure by virtue of forward secrecy property. We conduct security analysis and comparison with related schemes to evaluate our improved scheme. During comparison, we also highlight the computational cost/time complexity at the user and the server side in terms of the execution time of various operations. The entire analysis shows that the design of the improved scheme is robust enough for the for DRM environment.

show abstract

“…As per the performance simulation results in [3,5], t a and t h(.) are quite lightweight as compared to the operations t b , t m , t H(.)…”

Section: Performance and Security Comparison Of The Improved Schemementioning

confidence: 93%

A more secure digital rights management authentication scheme based on smart card

Kumari

Khan

2014

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…In [24], the challenges of providing secure communication in DTNs is discussed and the use of Identity-Based Cryptography (IBC) [25] is suggested. In [26], source authentication and anonymous communication as well as message confidentiality are provided using IBC.…”

Section: Related Workmentioning

confidence: 99%

“…In the proposed scheme, the authentication mechanism for the packets generated by a specific source is provided by a Bloom filter [38] and ID-based signature (IBS) [25]. Whenever a source node sends some packets belonging to the flow that is initiated by itself, it creates a Bloom filter output from those packets, signs it using IBS, and sends it to its contacts.…”

Section: Trust Management Scheme For Dtnsmentioning

confidence: 99%

An Iterative Algorithm for Trust Management and Adversary Detection for Delay-Tolerant Networks

Ayday

Fekri

2012

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Delay/Disruption Tolerant Networks (DTNs) have been identified as one of the key areas in the field of wireless communication, wherein sparseness and delay are particularly high. They are emerging as a promising technology in vehicular, planetary/interplanetary, military/tactical, disaster response, underwater and satellite networks. DTNs are characterized by large endto-end communication latency and the lack of end-to-end path from a source to its destination. These characteristics pose several challenges to the security of DTNs. Especially, Byzantine attacks in which one or more legitimate nodes have been compromised and fully controlled by the adversary can give serious damages to the network in terms of latency and data availability. Using reputationbased trust management systems is shown to be an effective way to handle the adversarial behavior in Mobile Ad hoc Networks (MANETs). However, because of the unique characteristics of DTNs, those traditional techniques do not apply to DTNs. Our main objective in this paper is to develop a robust trust mechanism and an efficient and low cost malicious node detection technique for DTNs. Inspired by our recent results on reputation management for online systems and e-commerce, we develop an iterative malicious node detection mechanism for DTNs referred as ITRM. The proposed scheme is a graph-based iterative algorithm motivated by the prior success of message passing techniques for decoding low-density parity-check codes over bipartite graphs. Applying ITRM to DTNs for various mobility models, we observed that the proposed iterative reputation management scheme is far more effective than well-known reputation management techniques such as the Bayesian framework and EigenTrust. Further, we concluded that the proposed scheme provides high data availability and packet-delivery ratio with low latency in DTNs under various adversary attacks which attempt to both undermine the trust and detection scheme and the packet delivery protocol.

show abstract

“…As we discussed in the introduction, several works (e.g., [15,16]) claim to do batch verification when, in fact, they often meet a weaker guarantee called screening [2]. However, in most cases the confusion is about words, e.g.…”

Section: Definition 1 (Batch Verification Of Signatures)mentioning

confidence: 99%

Batch Verification of Short Signatures

Camenisch

Hohenberger

Pedersen

2007

Lecture Notes in Computer Science

111

View full text Add to dashboard Cite

Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particular requirements on the applicable cryptographic primitives. For instance, several applications require that communication overhead be small and that many messages be processed at the same time. In this paper we consider the suitability of public key signatures in the latter scenario. That is, we consider signatures that are 1) short and 2) where many signatures from (possibly) different signers on (possibly) different messages can be verified quickly.We propose the first batch verifier for messages from many (certified) signers without random oracles and with a verification time where the dominant operation is independent of the number of signatures to verify. We further propose a new signature scheme with very short signatures, for which batch verification for many signers is also highly efficient. Prior work focused almost exclusively on batching signatures from the same signer. Combining our new signatures with the best known techniques for batching certificates from the same authority, we get a fast batch verifier for certificates and messages combined. Although our new signature scheme has some restrictions, it is the only solution, to our knowledge, that is a candidate for some pervasive communication applications.

show abstract

An efficient identity-based signature scheme with batch verifications

Cited by 29 publications

References 29 publications

A more secure digital rights management authentication scheme based on smart card

A more secure digital rights management authentication scheme based on smart card

An Iterative Algorithm for Trust Management and Adversary Detection for Delay-Tolerant Networks

Batch Verification of Short Signatures

Contact Info

Product

Resources

About