Certificate-based cryptography proposed by Gentry in Eurocrypt 2003 combines the advantages of traditional public key cryptography (PKI) and identitybased cryptography, and removes the certificate management problem and the private key escrow security concern. Based on computational Diffie-Hellman assumption, a certificate-based signature scheme is constructed to insure the security of communic...

Motivated by the strong, low temperature damping of nodal quasiparticles observed in some cuprate superconductors, we study quantum phase transitions in d(x(2)-y(2)) superconductors with a spin-singlet, zero momentum, fermion bilinear order parameter. We present a complete, group-theoretic classification of such transitions into seven distinct cases (including cases with nematic order) and anal...

Blind signature allows one user to get a signature without giving the signer any information about the actual message or the resulting signature. In this paper, we aim to improve the recently proposed Lin et al.’s Self-certified Partially Blind Signature Scheme[1] in order to withstand the security flaw in their scheme. The security of the improved scheme is enhanced in the blind signing phase ...

Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. However, most of the short signature schemes are only based on one intractable assumption. Recently, Su presented an identity-based short signature scheme based on knapsack and bilinear pairing. He claimed that the signature scheme is secure in the random or...

A new ID-based group signature scheme, in which group managers (Membership Manager and Tracing Manager) and group members are all ID-based, is presented in this paper. Due to the nice constructive method of group signature schemes and the sound properties of bilinear pairing, it is shown that our scheme has the advantages of concurrent joining of users, immediate revocation of group members, ea...

Certificateless public key cryptography was introduced to solve the key escrow problem in identity based cryptography while enjoying the most attractive certificateless property. In this paper, we present the first secure certificateless public key encryption (CLPKE) scheme without redundancy. Our construction provides optimal bandwidth and quite efficient decryption process compared with the e...

In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zero-knowledge (and witness-indistinguishable) proofs in bilinear groups. While avoiding expensive NPreductions, these proof systems are still inefficient due to the number of pairing computations required for verification. We apply recent techniques of batch verification to the Groth-Sahai proof systems an...

In 2013, Li et al. pointed out the security problems of Chen’s password authentication scheme. they proposed an enhanced smart card based remote user password authentication scheme and claimed their scheme is secure against replay attacks, forgery attacks. In this paper, we state that the scheme is vulnerable to user impersonation attack. It also suffers from user anonymity violation and clock ...

We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we show how to use prime-order elliptic curve groups to construct bilinear groups with the same properties. In particular, we define a generalized version of the subgroup decision problem and give explicit constructions...

Over the past decade bilinear maps have been used to build a large variety of cryptosystems. In parallel to new functionalities, we have also seen the emergence of many security assumptions. This leads to the general question of comparing two such assumptions. Boneh, Boyen and Goh introduced the Uber assumption as an attempt to offer a general framework for security assessment. Their idea is to...