This paper investigates the application of 5G wireless multicast to the big data system. In particular, we propose a hybrid unicast/multicast transmission scheme using 3D massive multi-input multi-output (MIMO) technique. The proposed scheme employs multicast beamforming in the multicast group and multi-user MIMO (MU-MIMO) linear precoding in the unicast group. It also applies the null space based interference cancellation to eliminate the signal leakage generated by other groups. Simulation results show that the proposed system can significantly improve the system throughput with an antenna array configuration, precoding/beamforming schemes and user grouping strategies.

Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption (HIBE) scheme in the standard model whose public key size is only ( dm 2 + mn ) log q bits and whose message-ciphertext expansion factor is only log q , where d is the maximum hierarchical depth and ( n , m , q ) are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2 d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is (2 dm 2 + mn + m ) log q . To reduce the message-ciphertext expansion factor of the proposed scheme to log q , the encryption algorithm of this scheme is built based on Gentry’s encryption scheme, by which m 2 bits of plaintext are encrypted into m 2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.

This paper proposes a short lattice-based signature scheme in the standard model. The proposed scheme is designed without using the lattice-based delegation tools whose the verification key size and the signature length are both short. To achieve the provable security and shorten the verification key and the signature length, given a message with bit length l, we firstly encode the message into an m-dimensional vector with the help of l + 1m-dimensional public vectors, and then we use the Gaussian sample algorithm to sign the encoded result on the same lattice by the trapdoor basis. Hence, all the messages are signed on the same lattice in this paper. Moreover, the verification key of the proposed scheme only consists of one shared matrix and l + 1 public vectors. Simultaneously, the signature length of the proposed scheme is the same as that of the signature scheme in the random oracle model. Under the hardness of the shortest integer solution problem, the presented scheme is provable strong unforgeable under adaptive chosen-message attack in the standard model. Copyright © 2016 John Wiley & Sons, Ltd.

Key-dependent message KDM security should be considered in the design of security protocols, especially for complicated ones, where the messages related to the secret key might be encrypted. In this paper, we present a new method of constructing a KDM secure asymmetric encryption scheme with the notation of hybrid encryption in the standard model; although the notation of hybrid encryption was thought as no help to get rid of dependencies between messages and the secret key. Our result can also be seen as a partial instantiation for a previously well-known KDM secure asymmetric encryption scheme based on random oracle. As we know, this has never been carried out before. And our result indicates a new cryptographic application for the primitive of lossy trapdoor function. Throughout the paper, our main idea is to archive KDM security by making use of both leakage-resilience and auxiliary-input security properties. Copyright © 2014 John Wiley & Sons, Ltd.

ABSTRACT Correlation power analysis (CPA) has been a powerful and thoroughly studied threat for implementations of block ciphers and public key algorithms but not yet for stream ciphers. This paper proposes a novel CPA attack on the hardware‐oriented stream cipher Trivium, one of the finally chosen ciphers by the eSTREAM project. Based on the Hamming distance model, the proposed attack exploits the resynchronization phase of Trivium. By choosing proper initial value vectors, the algorithmic noise of the device is completely eliminated. Furthermore, a novel concept of modified correlation coefficients is introduced, which can be used to describe the relation between the hypothetical power consumption values and the measured power consumption values. Through the calculation of modified correlation coefficients, the effect of the electronic noise is significantly decreased and values of the hypotheses can be discriminated uniquely by the highest modified correlation coefficient. According to the recovered hypotheses, many equations on the secret key bits can be obtained, which will be sequentially solved to extract the secret key of Trivium. Compared with Fischer's differential power analysis attack on Trivium, the proposed algorithm is more efficient and robust. Finally, a simulation attack is mounted to confirm the efficiency of the algorithm. Copyright © 2011 John Wiley & Sons, Ltd.