检索结果-南通市图书馆

Lattice-based linearly homomorphic signature scheme over binary field

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2013年第11期56卷 238-246页

作者： wang FengHe HU YuPu wang baocang Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Department of Mathematics and Physics Shandong Jianzhu University

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 *** homomorphism is achieved through the homomorphism of the lattice-based hash function used in the proposed signature *** is shown that the proposed scheme satisfes the privacy *** 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 ***,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.

关键词： linearly homomorphic signature lattice short integer solution problem pre-image sampling function

Efficient Ring Signature Scheme Without Random Oracle from Lattices

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第2期28卷 266-272页

作者： GAO Wen HU Yupu wang baocang CHEN Jiangshan wang Xin College of Electrical and Information Engineering Shaanxi University of Science and Technology State Key Laboratory of Integrated Service Networks Xidian University School of Mathematics and Statistics Minnan Normal University School of Computer Science Shaanxi Normal University

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.

关键词： Lattice-based cryptography Digital signature Ring signature

Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2014年第3期8卷 469-477页

作者： Qiqi LAI Yuan CHEN Yupu HU baocang wang Mingming JIANG State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 China

Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.

关键词： symmetric encryption key-dependent message,challenge function universal hash function ideal cipher model

WARX: efficient white-box block cipher based on ARX primitives and random MDS matrix

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第3期65卷 196-210页

作者： Jun LIU Vincent RIJMEN Yupu HU Jie CHEN baocang wang State Key Laboratory of Integrated Service Networks Xidian University Interuniversity Microelectronics Centre & Computer Security and Industrial Cryptography Group Department of Informatics University of Bergen

White-box cryptography aims to provide secure cryptographic primitives and implementations for the white-box attack model, which assumes that an adversary has full access to the implementation of the cryptographic algorithms. Real-world applications require highly efficient and secure white-box schemes,whereas the existing proposals cannot meet this demand. In this paper, we design a new white-box block cipher based on addition/rotation/XOR(ARX) primitives and random maximal distance separable(MDS)matrix, white-box ARX(WARX), aiming for efficient implementations in both black-and white-box *** implementation of WARX in the black-box model is nine times faster than SPNbox-16 from ASIACRYPT’16, and the implementation in the white-box model is more efficient than SPNbox-16 and WEM from CT-RSA’17. Moreover, the security of WARX in both black-and white-box models is analyzed, which ensures its practical applicability. The design of WARX shows that ARX primitives and random linear layer can improve the efficiency of a white-box block cipher. This article may inspire more provably secure and efficient white-box block ciphers and help to narrow the gap between provably secure white-box schemes from academia and highly applicable schemes in great demand from industry.

关键词： white-box cryptography block cipher design addition/rotation/XOR efficiency improvement

Lattice-based certificateless encryption scheme

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2014年第5期8卷 828-836页

作者： Mingming JIANG Yupu HU Hao LEI baocang wang Qiqi LAI State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 China Security and Privacy Lab CRDU Huawei Technologies Co. LTD. Beijing 100095 China

Certificateless public key cryptography （CL- PKC） can solve the problems of certificate management in a public key infrastructure （PKI） and of key escrows in identity-based public key cryptography （ID-PKC）. In CL- PKC, the key generation center （KGC） does not know the private keys of all users, and their public keys need not be cer- tificated by certification authority （CA）. At present, however, most certificateless encryption schemes are based on large in- teger factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate- less encryption scheme based on lattices, more precisely, us- ing the hardness of the learning with errors （LWE） problem. Compared with schemes based on large integer factoriza- tion and discrete logarithms, the most operations are matrix- vector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks （IND-CPA） secure in the random oracle model.

关键词： lattice-based cryptography LWE identity-based encryption (IBE) post-quantum cryptography certifi-cateless encryption

PEPFL:A framework for a practical and efficient privacy-preserving federated learning

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2024年第2期10卷 355-368页

作者： Yange Chen baocang wang Hang Jiang Pu Duan Yuan Ping Zhiyong Hong State Key Laboratory of Integrated Service Networks Xidian UniversityXi'an710071China School of Information Engineering Xuchang UniversityXuchang461000China School of Telecommunications Engineering Xidian UniversityXi'an710071China Secure Collaborative Intelligence Laboratory Ant GroupHangzhou310000China Facility of Intelligence Manufacture Wuyi UniversityJiangmen529020China

As an emerging joint learning model,federated learning is a promising way to combine model parameters of different users for training and inference without collecting users’original ***,a practical and efficient solution has not been established in previous work due to the absence of efficient matrix computation and cryptography schemes in the privacy-preserving federated learning model,especially in partially homomorphic *** this paper,we propose a Practical and Efficient Privacy-preserving Federated Learning(PEPFL)***,we present a lifted distributed ElGamal cryptosystem for federated learning,which can solve the multi-key problem in federated ***,we develop a Practical Partially Single Instruction Multiple Data(PSIMD)parallelism scheme that can encode a plaintext matrix into single plaintext for encryption,improving the encryption efficiency and reducing the communication cost in partially homomorphic *** addition,based on the Convolutional Neural Network(CNN)and the designed cryptosystem,a novel privacy-preserving federated learning framework is designed by using Momentum Gradient Descent(MGD).Finally,we evaluate the security and performance of *** experiment results demonstrate that the scheme is practicable,effective,and secure with low communication and computation costs.

关键词： Federated learning Partially single instruction multiple data Momentum gradient descent ElGamal Multi-key Homomorphic encryption

Improved lattice-based ring signature schemes from basis delegation

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2016年第3期23卷 11-17,28页

作者： Gao Wen Hu Yupu wang baocang Xie Jia State Key Laboratory of Integrated Service Networks Xidian University

Ring signature enables the members to sign anonymously without a manager, it has many online applications, such as e-voting, e-money, whistle blowing etc. As a promising post-quantum candidate, lattice-based cryptography attracts much attention recently. Several efficient lattice-based ring signatures have been naturally constructed from lattice basis delegation, but all of them have large verification key sizes. Our observation finds that a new concept called the split- small integer solution （SIS） problem introduced by Nguyen et al. at PKC＇I 5 is excellent in reducing the public key sizes of lattice-based ring signature schemes from basis delegation. In this research, we first define an extended concept called the extended split-SIS problem, and then prove that the hardness of the extended problem is as hard as the approximating shortest independent vectors problem （SIVP） problem within certain polynomial factor. Moreover, we present an improved ring signature and prove that it is anonymous and unforgeable against the insider corruption. Finally, we give two other improved existing ring signature schemes from lattices. In the end, we show the comparison with the original scheme in terms of the verification key sizes. Our research data illustrate that the public key sizes of the proposed schemes are reduced significantly.

关键词： lattice-based ring signature scheme anonymous unforgeable

在线全文

学校读者我要写书评

暂无评论

New Weak Keys in RSA

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1529-1532页

作者： wang baocang LIU Shuanggen HU Yupu Key Laboratory of Computer Network and Information Security Ministry of Edueation Xidian University Xi＇an 710071 Shaanxi China College of Computer Information Engineering Jiangxi Normal University Nanchang 330022 Jiangxi China

The security of the RSA system with the prime pairs of some special form is investigated. A new special-purpose algorithm for factoring RSA numbers is proposed. The basic idea of the method is to factor RSA numbers by factoring a well-chosen quadratic polynomial with integral coefficients. When viewed as a general-purpose algorithm, the new algorithm has a high computational complexity. It is shown thai the RSA number n = pq can be easily factored if p and q have the special form of p = as＋b, q=cs＋d, where a, b, c, d are relatively small numbers. Such prime pairs （p, q） are the weak keys of RSA, so when we generate RSA modulus, we should avoid using such prime pairs （p, q）.

关键词： integer factorization RSA number public key cryptosystem special-purpose algorithm

Verifiable Auditing Protocol with Proxy Re-Encryption for Outsourced Databases in Cloud

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2018年第2期23卷 120-128页

作者： GAO Ziyuan wang baocang LIU Hequn LU Ke ZHAN Yu State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 Shaanxi China Key Laboratory of Cognitive Radio and InformationProcessing of Ministry of Education Guilin University ofElectronic Technology Guilin 541004 Guangxi China

As a new computing paradigm, outsourcing computing provides inexpensive, on-demand, convenient storage and computing services for cloud clients. For the security of outsourcing databases to the cloud, it is important to allow the user to verify the query results returned by the cloud server. So far, tremendous efforts have been carried out to study secure outsourcing computing. The existing scheme supports that the user can detect the correctness and completeness of the query results even if the cloud server returns an empty set. However, since the data owner performs the database encryption operations and uploads the encrypted database to the cloud server, they require the user to request the data owner to decrypt the query results. In this paper, we propose a new scheme, which can accurately verify the search results. Meanwhile, the users can decrypt the query results independently. Furthermore, the proposed scheme supports a large number of data owners to upload their encrypted database to the cloud server, and it can efficiently verify the query results. Besides, we can prove that our proposed solution can achieve the desired security properties.

关键词： outsourcing computing verifiable auditing proxyre-encryption bilinear aggregate signature