Without limitation on the number of mates, Z-periodic complementary sequence (ZPCS) sets, which have potential applications in multi-carriers CDMA communication systems and MIMO channel estimation, can support more users than conventional complementary sequence sets. In this paper, a generic construction of ZPCS sets is proposed based on perfect sequences and orthogonal matrices. It generalizes the earlier constructions by Li et al., and produces new ZPCS sets which cannot generated by earlier ones. The parameters of our ZPCS sets are flexible and are thus suitable for different application scenarios.

ABSTRACT In 2003, Steinfeld et al. introduced the notion of universal designated verifier signature (UDVS), which allows a signature holder, who receives a signature from the signer, to convince a designated verifier whether he is possession of a signer's signature; at the same time, the verifier cannot transfer such conviction to anyone else. These signatures devote to protect the receiver's privacy, that is, the receiver may want to prove to any designated verifier who he is in possession of such signature signed by the known signer but reluctant to disclose it. Moreover, the receiver also does not want the verifier to be able to convince anyone that he is in possession of such signature. In the existing UDVS schemes, a secure channel is required between the signer and the signature holder to transfer the signature. This paper, for the first time, proposes the notion of universal designated verifier signcryption without this secure channel by combining the notions of UDVS and signcryption. We give the formal definitions and a concrete construction of universal designated verifier identity‐based signcryption scheme. We also give the formal security proofs for our scheme under the random oracle model. Copyright © 2013 John Wiley & Sons, Ltd.