Youliang Tian

Learn More
To ensure only authorized access to medical services, several authentication schemes for telecare medicine information systems (TMIS) have been proposed in the literature. Due to its better performance than traditional cryptography, Hao et al. proposed an authentication scheme for TMIS using chaotic map based cryptography. They claimed that their scheme(More)
User authentication with unlinkability is one of the corner stone services for many security and privacy services which are required to secure communications in wireless sensor networks (WSNs). Recently, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs, and claimed that their scheme achieves identity(More)
We extend our Morse type inequalities for holomorphic symplectic reductions [TZ1, 2] to the case of singular reductions. 0. Introduction and the statement of main results Let (M, ω) be a closed symplectic manifold. We make the assumption that there is a Hermitian line bundle L over M admitting a Hermitian connection ∇L with the property that √−1 2π (∇L)2 =(More)
This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion model and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM , FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption(More)
Recently, He et al. proposed an anonymous two-factor authentication scheme following the concept of temporal-credential for wireless sensor networks (WSNs), which is claimed to be secure and capable of withstanding various attacks. However, we reveal that the authentication phase of their scheme has several pitfalls. Firstly, their scheme is susceptible to(More)
A practical publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of B. Schoenmakerspsila PVSS and its secret is not the form of discrete logarithm, thus this PVSS is extremely practical. Moreover, in the schemepsilas distribution of shares phase, only using bilinearity of(More)
A non-interactive, simple and efficient publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of Schoenmakers’ PVSS in [15]. Moreover, in the scheme’s distribution of shares phase, only using bilinearity of bilinear paring, anybody can verify that the participants received whether(More)
In group key exchange (GKE) protocols, a shared secret key is established among a group of members for cryptographic use over a public network. An identity-based protocol is preferred to that under the employment of traditional public key infrastructure (PKI), since identity-based cryptosystem can simplify public key management procedure. In ASIACCS 2011, a(More)