In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed co...In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.展开更多
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 b...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 2d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is（2dm^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.展开更多
基金Supported by the National Natural Science Foundation of China（10771023）
文摘In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.
基金Project supported by the National Natural Science Foundation of China（Nos.61303198,61471409,61472470,and 61402112） the Natural Science Foundation of Shandong Province,China（No.ZR2013FQ031）
文摘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 2d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is（2dm^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.
