What determines logistics sub-degree students’ decision to pursue a bachelor’s degree?

With the growing importance of the logistics industry and the increasing demand for logistics professionals with a bachelor’s degree qualification, the government and industry in China have long been looking for ways to attract more logistics sub-degree students to pursue higher education. This article aims to provide insights into the factors that determine logistics sub-degree students’ intention to pursue a bachelor’s degree. The study extended the theory of reasoned action (TRA) model to include four variables, namely perceived difficulty, job opportunities, job starting salary and genuine interest. The findings from the study involving 361 logistics sub-degree students from three institutions show that logistics sub-degree students’ decision to pursue a bachelor’s degree is determined by attitude, subjective norm, perceived difficulty, job opportunities, job starting salary and genuine interest. Genuine interest is identified as a new precursor of intention. The findings also show that there is a significant difference between students from different types of programmes. Based on the findings, this article proposes some measures for the relevant parties to motivate and attract logistics sub-degree students to further their study at bachelor’s degree level

Efficient identity-based signcryption scheme for multiple receivers

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously. In this paper, we propose an efficient identity based signcryption scheme for multiple receivers which needs only one pairing computation to signcrypt a message for n different receivers and can provide confidentiality and authenticity simultaneously. This scheme turns out to be more efficient than all others proposed so far. We prove its security in the random oracle model. Specifically, we prove its semantic security under the hardness of Bilinear Diffie-Hellman (BDH) problem and its unforgeability under the Computational Diffie-Hellamn (CDH) assumption

Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

Abstract. In this paper we describe a new identity-based signcryption (IBSC) scheme built upon bilinear maps. This scheme turns out to be more efficient than all others proposed so far. We prove its security in a formal model under recently studied computational assumptions and in the random oracle model. As a result of independent interest, we propose a new provably secure identity-based signature (IBS) scheme that is also faster than all known pairing-based IBS methods.