Identity-based Scheme Research Articles

Cryptanalysis and security enhancement of a remote user authentication scheme using smart cards

With the broad implementations of the electronic business and government applications, robust system security and strong privacy protection have become essential requirements for remote user authentication schemes. Recently, Chen et al. pointed out that Wang et al.'s scheme is vulnerable to the user impersonation attack and parallel session attack, and proposed an enhanced version to overcome the identified security flaws. In this paper, however, we show that Chen et al.'s scheme still cannot achieve the claimed security goals and report its following problems: (1) It suffers from the offline password guessing attack, key compromise impersonation attack and known key attack; (2) It fails to provide forward secrecy; (3) It is not easily repairable. As our main contribution, a robust dynamic ID-based scheme based on non-tamper resistance assumption of the smart cards is presented to cope with the aforementioned defects, while preserving the merits of different related schemes. The analysis demonstrates that our scheme meets all the proposed criteria and eliminates several grave security threats that are difficult to be tackled at the same time in previous scholarship.

Comparing General Paradigms on Data Secrecy Protection for Outsourced Files in Mobile Cloud Computing

The data secrecy of outsourced files in cloud server should be protected even though cloud servers are untrustworthy. In this paper, we extensively analyze the techniques on data privacy protection for secure cloud storage. We propose and compare several general paradigms on data secrecy protection including ID-based scheme, CLPKCbased scheme, key-escrow-based scheme, ID-based threshold decryption scheme, and trusted third party based scheme. After the analysis and comparison, ID-based threshold decryption scheme has the most advantages with respect to no constraints such as certificate and key escrow.

Secure identity-based multisignature schemes under quadratic residue assumptions

Digital signatures are one of the fundamental security primitives because they provide authenticity and nonrepudiation in the broadcast/multicast communication networks. However, the current broadcast/multicast authentication standards are vulnerable to signature flooding because excessive signature verification requests exhaust the computational resource of victims. The situation becomes worse in the case of the energy-constrained networks such as wireless sensor networks and mobile ad hoc networks. As an essential variation of ordinary digital signature schemes, multisignature schemes enable a single compact signature to authenticate a message under a set of different signers. In this paper, we first propose an efficient identity-based multisignature scheme with three interactive rounds under quadratic residue assumption, which equals to the large integer factoring assumption. By using the technique of quadratic residue-based multiplicatively homomorphic equivocable commitment, an advanced identity-based multisignature scheme is proposed to achieve to reduce the interactive round complexity to two rounds. We give the formal security proof that our schemes are existentially unforgeable under adaptively chosen message attacks and chosen identity attacks in the random oracle model. Compared with the previous work, our schemes are very efficient. In particular, our schemes are featured by the weak assumption and the efficient signing and verification procedures. Copyright © 2012 John Wiley & Sons, Ltd.

Cryptanalysis of Sood et al.'s Dynamic Identity Based Authentication Protocol for Multi-Server Architecture

Sood, Sarje, and Singh recently proposed a secure dynamic identity-based (ID-based) authentication protocol for multi-server architectures utilizing smart cards, wherein they reveal security weaknesses of Hsiang and Shih’s dynamic identity-based remote user authentication scheme. Sood et al. claim their proposed scheme can provide protection from various attacks such as replay, malicious user, stolen smart card, and offline dictionary attacks. However, we found their protocol does not have any defense mechanism against denial-of-service (DoS) or distributed denial-of-service (DDoS) attacks such as resource exhaustion attack which severely affects cascade style authentication schemes. We also found the protocol is susceptible to smart card vulnerabilities such as power analysis attack from privileged insiders. In addition, if an attacker has knowledge of both the verification tables and the master secret of the control server, the client verification tables and the service provider server database are susceptible to the verifier disclosure attack and offline dictionary attack. In this paper, we will demonstrate that Sood et al.’s protocol is insecure and suffers from aforementioned potential security vulnerabilities in detail.

Efficient ID-based proxy multi-signature scheme secure in random oracle

Proxy signature schemes enable an entity to delegate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxymultisignature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diffie-Hellman (CDH) assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original signers. Furthermore the proposed scheme is simple and computationally more efficient than other ID-based proxy multisignature schemes.

Fuzzy Identity-Based Key Agreement Scheme for Wireless Sensor Networks

Fuzzy Identity-Based Key Agreement Scheme for Wireless Sensor Networks

Cryptanalysis of Strong Designated Verifier Signature Scheme with Non-delegatability and Non-transferability

Strong designated verifier signature scheme (SDVS) allows a verifier to privately check the validity of a signature. Recently, Huang et al. first constructed an identity-based SDVS scheme (HYWS) in a stronger security model with non-interactive proof of knowledge, which holds the security properties of unforgeability, non-transferability, non-delegatability, and privacy of signer's identity. In this paper, we show that their scheme does not provide the claimed properties. Our analysis indicates that HYWS scheme neither resist on the designated verifier signature forgery nor provide simulation indistinguishability, which violates the security properties of unforgeability, non-delegatability and non-transferability.

Relations between the security models for certificateless encryption and ID-based key agreement

We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in some sense ID-based key agreement is a primitive from which all others can be derived. In doing so we focus on distinctions between what we term pure ID-based schemes and non-pure schemes, in various security models. We present security models for ID-based key agreement which do not “look natural” when considered as analogues of normal key agreement schemes, but which look more natural when considered in terms of the models used in certificateless encryption. We illustrate our models and constructions with two running examples, one pairing based and one non-pairing based. Our work highlights distinctions between the two approaches to certificateless encryption and adds to the debate about what is the “correct” security model for certificateless encryption.

Identity-Based Multi-Signcryption with Public Verifiability

Multi-signcryption can meet the requirement of message signcryption with muti-participant. Since the existing identity-based multi-signcryption scheme cannot offer the function of public verifiability, based on identity and bilinear pairing on the Elliptic Curve, a new scheme with public verifiability is proposed. In the scheme, with the steps which is comparatively independent to the signcryption process, it can provide the public verification of each signcryption in need. Therefore, our scheme efficiently achieves the cryptographic functions of multi-signcryption.

Identity-based threshold decryption on access structure

For the applied limitation of the existing threshold decryption schemes based on the (t, n) structure, an identity-based threshold decryption scheme which can be applied on the access structure is proposed through designing a special distribution algorithm of the private key shares. The generation and distribution of private key shares, the encryption, the decryption and the combination are introduced in detail. The validity and security of the scheme are proved and analyzed. Comparisons with the existing schemes show that the proposed scheme is more flexible.

Generic Construction of Identity-Based Strong Key-Insulated Signature

It is worthwhile to deal with the key-exposure problem for identity-based signature. Identity-based key-insulated signature can successfully reduce the damage caused by key-exposure, and thus attracts the researchers' great interest. In this paper, we study the problem of how to generically construct identity-based strong key-insulated signature, and proposed a generic construction of identity-based strong key-insulated signature schemes from two-level hierarchical identity-based signature.

Identity-based group key management scheme in pervasive computing environment

The requirements of group key management scheme in pervasive environment were analyzed.A new identity-based group key management scheme was proposed by combing the identity-based cryptography and STR protocol.Concerning nodes' free joining and leaving the group,group key renewing protocol was proposed,which could guarantee the forward security and backward security of the group key.The scheme can achieve security requirements and has less computation and communications load.

Secure Dynamic Identity-Based Authentication Scheme Using Smart Cards

ABSTRACT In 2004, Das et al. proposed a dynamic identity-based remote user authentication scheme using smart cards. This scheme allows users to choose and change their passwords freely, and the server does not maintain any verification table. Das et al. claimed that their scheme is secure against stolen verifier attack, replay attack, forgery attack, dictionary attack, insider attack and identity theft. However, many researchers have demonstrated that Das et al.'s scheme is susceptible to various attacks. Furthermore, this scheme does not achieve mutual authentication and thus cannot resist malicious server attack. In 2009, Wang et al. argued that Das et al.'s scheme is susceptible to stolen smart card attack. If an attacker obtains the smart card of the user and chooses any random password, the attacker gets through the authentication process to get access of the remote server. Therefore, Wang et al. suggested an improved scheme to preclude the weaknesses of Das et al.'s scheme. However, we found that Wang et al.'s scheme is susceptible to impersonation attack, stolen smart card attack, offline password guessing attack, denial of service attack and fails to preserve the user anonymity. This paper improves Wang et al.'s scheme to resolve the aforementioned problems, while keeping the merits of different dynamic identity based smart card authentication schemes.

ID-based bidirectional threshold proxy re-signature

Based on Shao et al's ID-based proxy re-signature,an ID-based bidirectional threshold proxy re-signature scheme in the standard model was presented in this paper.The scheme eliminated the cost of restoring and managing certificates,and solved the difficult problem of excessive rights of the proxy in the proxy re-signature scheme.The scheme can tolerate tn/2 malicious proxies.This scheme proves to be robust and secure against the existential forgery under the adaptive chosen identity and message attacks,under the computation Diffie-Hellman assumption.

Attack and improvement of Zhang’s multi-signature scheme

After analyzing the ID-based digital multi-signature scheme based on RSA ( Rivest-Shamir-Adleman) proposed by Zhang et al. in 2008, a complete attack algorithm was proposed. Firstly, Zhang et al. 's scheme and the attack algorithm were introduced, and then two improved schemes against to the security problem of Zhang's scheme were proposed. The random operation of each signer was changed, and part of computation operation was transferred in both of the improved schemes. The results show that the improved schemes are secure without decreasing the efficiency of signing and verifying. Therefore, the improved schemes are more valuable in practical application.

Certificateless signcryption scheme in standard model

Most of the current identity-based signature schemes are secure in the random oracle model but many of them have security problem.In this paper an efficient and provably secure identity-based certificateless signcryption scheme was proposed.The scheme was proved secue in the standard model and reduced the q-Augmented Bilinear Diffie-Hellman Exponent q-ABDHE problem.Compared with the known identity-based scheme in the standard model the proposed scheme has shorter signature length and less operation.

New constructions of identity-based threshold decryption

In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen ciphertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic checkability of ciphertext in the IDTDS is given by simply creating a signed ElGamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.

Dual Construction of Stern-based Signature Scheme

In this paper, we propose a dual version of the first identity-based scheme based on error-correcting code proposed by Cayrel et.al. Our scheme combines the McEliece signature and the Veron zero-knowledge identification scheme, which provide better computation complexity than the Stern one. We also propose a generalization of the Veron identification scheme in order to build a threshold ring signature scheme, which is secure in the random oracle model and has the advantage to reduce the computation complexity as well as the size of storage.

Identity-Based Threshold Proxy Signature from Bilinear Pairings

Delegation of rights is a common practice in the real world. We present two identity-based threshold proxy signature schemes, which allow an original signer to delegate her signing capability to a group of n proxy signers, and it requires a consensus of t or more proxy signers in order to generate a valid signature. In addition to identity-based scheme, privacy protection for proxy singers and security assurance are two distinct features of this work. Our first scheme provides partial privacy protection to proxy signers such that all signers' identities are revealed, whereas none of those t participating signers is specified. On the other hand, all proxy signers remain anonymous in the second scheme. This provides a full privacy protection to all proxy signers; however, each valid signature contains a tag that allows one to trace all the participating proxy signers. Both our proposed schemes are secure against unforgeability under chosen message attack, and satisfy many other necessary conditions for proxy signature.

Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields

Tate-pairing-based cryptosystems, because of their ability to be used in multiparty identity-based key management schemes, have recently emerged as an alternative to traditional public key cryptosystems. Due to the inherent parallelism of the existing pairing algorithms, high performance can be achieved via hardware realizations. Three schemes for Tate pairing computations have been proposed in the literature: cubic elliptic, binary elliptic, and binary hyperelliptic. In this paper, we propose a new FPGA-based architecture of the Tate-pairing-based computation over binary fields. Even though our field sizes are larger than in the architectures based on cubic elliptic curves or binary hyperelliptic curves with the same security strength, nevertheless fewer multiplications in the underlying field need to be performed. As a result, the computational latency for a pairing computation has been reduced, and our implementation runs 2-20 times faster than the equivalent implementations of other pairing-based schemes at the same level of security strength. Furthermore, we ported our pairing designs for eight field sizes ranging from 239 to 557 bits to the reconfigurable computer, SGI Altix 4700 supported by Silicon Graphics, Inc., and performance and cost are demonstrated.