|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Lattice-based linearly homomorphic signature scheme over binary field显示文摘To design an efcient post-quantum linearly homomorphic signature scheme,using the pre-image sampling function,a lattice-based linearly homomorphic signature scheme over a binary feld is proposed in this paper.Linear homomorphism is achieved through the homomorphism of the lattice-based hash function used in the proposed signature scheme.It is shown that the proposed scheme satisfes the privacy property.Based on the hardness of the short integer solution problem,the proposed scheme is unforgeable against the type 1 and type 2adversaries in the random oracle model.Moreover,compared with a presented linearly homomorphic signature scheme in 2011,the proposed scheme has some advantages with respect to the public key size,signature length and computational cost. | WANG FengHe HU YuPu WANG BaoCang | 2013 | Science China(Information Sciences)2013，56，11： | 9 |
| 2 | Certificateless Sequential Aggregate Signature Scheme on NTRU Lattice显示文摘Having the advantages of certificateless signature and the aggregate signature at the same time,certificateless aggregate signature has been widely applied in e-business, e-government and software security since it was proposed in 2007. Although a number of certificateless aggregate signature schemes have been proposed, all of them are based on the classic number theory problem,which are no longer secure in the quantum era. In this paper, a certificateless sequential aggregate signature over number theory research unit lattice is proposed, which is proven to be secure in random oracle model. Moreover,we extend the new scheme into an efficient certificatebased sequential aggregate signature which is also secure in quantum era. | XIE Jia HU Yupu GAO Juntao JIANG Mingming | 2019 | Chinese Journal of Electronics2019，28，2： | 6 |
| 3 | Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings显示文摘Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then- en- cryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and au- thenticated manner. We prove its semantic security and unforge- ability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads. | LI Fagen HU Yupu LIU Shuanggen | 2007 | Wuhan University Journal of Natural Sciences2007，12，1： | 5 |
| 4 | Differential Collision Attack on Reduced FOX Block Cipher显示文摘 | Chen Jie Hu Yupu Zhang Yueyu Dong Xiaoli | 2012 | China Communications2012，9，7： | 5 |
| 5 | Pseudo-randomness of the fourth class of GSS sequences显示文摘This paper discusses pseudo-randomness of a periodic sequence, named the fourth class of GSS sequence. We get the following results: ① Its least period always reaches the maximum (that is, 2n-1). ② Its least period and linear complexity keep robust under single-symbol-substitution. ③ It has good low-degree-auto-correlation feature. ④ It has good short-length-run-distribution. | HU Yupu XIAO Guozhen | 2004 | Science in China(Series F)2004，47，2： | 4 |
| 6 | Efficient Ring Signature Scheme Without Random Oracle from Lattices显示文摘Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members. | GAO Wen HU Yupu WANG Baocang CHEN Jiangshan WANG Xin | 2019 | Chinese Journal of Electronics2019，28，2： | 4 |
| 7 | An Attribute-Based Signature Scheme from Lattice Assumption显示文摘Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to the concatenation of a lattice matrix with the sum of some random matrices, and the signature vector is generated by using the Preimage Sampling algorithm. Compared with current attribute-based signature schemes, this scheme can resist quantum attacks and enjoy shorter public-key, smaller signature size and higher efficiency. | ZHANG Yanhua HU Yupu JIANG Mingming | 2015 | Wuhan University Journal of Natural Sciences2015，20，3： | 4 |
| 8 | Lattice-based sequential aggregate signatures with lazy verification显示文摘This paper proposes the first lattice-based sequential aggregate signature(SAS) scheme with lazy verification that is provably secure in the random oracle model. As opposed to large integer factoring and discrete logarithm based systems, the security of the construction relies on worst-case lattice problem, namely, under the small integer solution(SIS) assumption. Generally speaking, SAS schemes enable any group of signers ordered in a chain to sequentially combine their signatures such that the size of the aggregate signature is much smaller than the total size of all individual signatures. Unlike prior such proposals, the new scheme does not require a signer to retrieve the keys of other signers and verify the aggregate-so-far before adding its own signature, and the signer can add its own signature to an unverified aggregate and forward it along immediately, postponing verification until load permits or the necessary public keys are obtained. Indeed, the new scheme does not even require a signer to know the public keys of other signers. | Zhang Yanhua Hu Yupu Jiang Mingming Xue Lili | 2015 | The Journal of China Universities of Posts and Telecommunications2015，22，6： | 3 |
| 9 | Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption显示文摘To further improve the efficiency of Fully homomorphic encryption(FHE), a leveled FHE scheme based on the Ring learning with errors(RLWE) problem is put forward by simultaneously applying both batch techniques available. Our scheme therefore allows double packing many plaintext values into each ciphertext to support single-instruction-multiple-data-type operations, which effectively reduces the ciphertext expansion ratio. An efficient evolutionary method for achieving arbitrary homomorphic permutation operations on a packed ciphertext is also provided by using several given key-switching hints.Further, a few new operations are introduced, with which not only to describe the key switching process in our batch setting clearly, but also to analyze the noise growth conveniently. | CHEN Hu HU Yupu LIAN Zhizhu | 2015 | Chinese Journal of Electronics2015，24，3： | 3 |
| 10 | Linear Span of the Optimal Frequency Hopping Sequences from Irreducible Cyclic Codes显示文摘Optimal set of the frequency hopping sequences can be derived from some irreducible cyclic codes.This paper determines the linear span of the frequency hopping sequences in the optimal set. The linear span is much less than the length of the frequency hopping sequences. In order to improve the linear span, we use two types of permutation polynomials, power permutation and binomial permutation, to transform the optimal set of the frequency hopping sequences. The transformed frequency hopping sequences have optimal Hamming correlation and larger linear span than the original frequency hopping sequences. Compared with the original frequency hopping sequences, the transformed optimal frequency hopping sequences have higher security to resist the cryptanalytic method. | GAO Juntao HU Yupu LI Xuelian | 2015 | Chinese Journal of Electronics2015，24，4： | 2 |
| 11 | Improved Impossible Differential Cryptanalysis of AES-128显示文摘 | WEI Yongzhuang HU Yupu | 2007 | Chinese Journal of Electronics2007，16，1： | 2 |
| 12 | Lattice-based certificateless encryption scheme显示文摘无证书的公钥密码学(CL-PKC ) 能在基于身份的公钥密码学(ID-PKC ) 在公钥基础结构(PKI ) 并且关键附带条件契约解决证书管理的问题。在 CL-PKC,关键产生中心(KGC ) 不知道所有用户的私人钥匙,并且他们的公钥不必被证明权威(CA ) 认证。然而,目前,很无证书的加密计划基于不在量环境是安全的大整数因式分解和分离对数,计算复杂性高。解决这些问题,我们基于格子建议一个新证书更少加密计划,更精确,使用与错误(LWE ) 学习的坚硬问题。与计划相比基于大整数因式分解和分离对数,大多数操作在我们的计划是 matrixvector 增加和内部产品,我们的途径有更低的计算复杂性。我们的计划能被证明是选择的 indistinguishability 密文攻击(IND-CPA ) 在随机的神谕模型固定。 | Mingming JIANG Yupu HU Hao LEI Baocang WANG Qiqi LAI | 2014 | Frontiers of Computer Science2014，8，5： | 2 |
| 13 | Attribute-based signatures on lattices显示文摘Because of its wide application in anonymous authentication and attribute-based messaging, the attribute-based signature scheme has attracted the public attention since it was proposed in 2008. However, most of the existing attribute-based signature schemes are no longer secure in quantum era. Fortunately, lattice-based cryptography offers the hope of withstanding quantum computers. And lattices has elevated it to the status of a promising potential alternative to cryptography based on discrete log and factoring, owing to implementation simplicity, provable security reductions and quantum-immune. In this paper, the first lattice attribute-based signature scheme in random oracle model is proposed, which is proved existential unforgeability and perfect privacy. Compared with the current attribute-based signature schemes, our new attribute-based signature scheme can resist quantum attacks and has much shorter public-key size and signature size. Furthermore, this scheme is extended into an attribute-based signature scheme on number theory research unit(NTRU) lattice, which is also secure even in quantum era and has much higher efficiency than the former. | Xie Jia Hu Yupu Gao Juntao Gao Wen Li Xuelian | 2016 | The Journal of China Universities of Posts and Telecommunications2016，23，4： | 2 |
| 14 | Impossible differential cryptanalysis of advanced encryption standard显示文摘Impossible differential cryptanalysis is a method recovering secret key, which gets rid of the keys that satisfy impossible differential relations. This paper concentrates on the impossible differential cryptanalysis of Advanced Encryption Standard (AES) and presents two methods for impossible differential cryptanalysis of 7-round AES-192 and 8-round AES-256 combined with time-memory trade-off by exploiting weaknesses in their key schedule. This attack on the reduced to 7-round AES-192 requires about 294.5 chosen plaintexts, demands 2129 words of memory, and performs 2157 7-round AES-192 encryptions. Furthermore, this attack on the reduced to 8-round AES-256 requires about 2101 chosen plaintexts, demands 2201 words of memory, and performs 2228 8-round AES-256 encryptions. | CHEN Jie HU YuPu ZHANG YueYu | 2007 | Science in China(Series F)2007，50，3： | 2 |
| 15 | Leveled Homomorphic Encryption in Certificateless Cryptosystem显示文摘To lower communication complexity, a Certificateless homomorphic encryption(CLHE) scheme based on the Learning with errors(LWE) problem is constructed by introducing a new technique called probabilistic encoding with weakly homomorphic property. This technique can conveniently convert an intended message into two elements in a ring, which will be respectively encrypted under both public keys of a user in certificateless cryptosystem.Upon knowing both elements simultaneously, the original message can be easily recovered. It is hidden perfectly by the probabilistic property of encoding. This CLHE removes evaluation keys by using the approximate eigenvector method given by Gentry et al., which makes it into a pure CLHE. It is proven to be semantic secure in the Random oracle model(ROM). The results indicate it is able to homomorphically evaluate any functions in a class functions with given multiplicative depth L. | CHEN Hu HU Yupu LIAN Zhizhu | 2017 | Chinese Journal of Electronics2017，26，6： | 1 |
| 16 | Generalized-slef shrinking generator显示文摘 | Hu Yupu Xiao Guozhen | 2004 | IEEE Trans on Inform Theory2004，150，4： | 1 |
| 17 | Certifi- cateless signcryption scheme in the standard model 显示文摘 | LIU ZHENHUA HU YUPU ZHANG XIANGSONG | 2010 | Information Sciences2010，180，3： | 1 |
| 18 | Generaliized self- shrinking generator显示文摘 | Hu Yupu Xiao Guozhen | 2004 | IEEE Trans on Inform Theory2004，50，4： | 1 |
| 19 | Generalized Self-shrinking Generator显示文摘 | Hu Yupu Xiao Guozhen | 2004 | IEEE Transactions on Information Theory2004，50，4： | 1 |
| 20 | Cer- tificateless signcryption scheme in the standard model显示文摘 | LIU Z henhua HU Yupu ZHANG Xiangsong | 2010 | Information Sciences2010，180，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员