检索结果-南通市图书馆

Cross-domain data cloud storage auditing scheme based on certificateless cryptography

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2021年第6期28卷 36-47页

作者： Xu Yan Li Zheng Ding Long Xu Rui School of Computer Science and Technology Anhui UniversityHefei 230039China Anhui Engineering Laboratory of IoT Security Technologies Anhui UniversityHefei 230039China School of Computer University of Geosciences(Wuhan)Wuhan 430078China

With the development of Internet of things(IoT), more and more intelligent terminal devices outsource data to cloud servers(CSs). However, the CS is not fully trusted, and the heterogeneity among different domains makes it difficult for third-party auditor(TPA) to conduct an efficient integrity auditing of outsourced data. Therefore, the cross-domain data cloud storage auditing scheme based on certificateless cryptography is proposed, which can effectively avoid the big burden of certificate management or key escrow problems in identity-based cryptography. At the same time, TPA can effectively audit the integrity of outsourced data in different domains. Formal security proof and analysis show that the cloud storage auditing scheme satisfies the security and privacy requirements. Performance analysis demonstrates that the efficiency is acceptable.

关键词： cloud storage auditing certificateless cryptography cross-domain Internet of things(IoT)

A strongly secure pairing-free certificateless authenticated key agreement protocol under the CDH assumption

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第3期59卷 107-122页

作者： Haiyan SUN Qiaoyan WEN Wenmin LI State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Zhengzhou University of Light Industry

certificateless authenticated key agreement(CL-AKA) protocols have been studied a great deal since they neither suffer from a heavy certificate management burden nor have the key escrow problem. Recently, many efficient CL-AKA protocols without pairings have been built. However, these pairing-free CL-AKA protocols are either not proved in any formal security model or proved under the gap Diffie-Hellman(GDH)assumption, a non-standard and strong assumption. With available implementation technologies, pairings are needed to realize the GDH assumption, which means that these pairing-free CL-AKA protocols are not pure pairing-free. Furthermore, these protocols are insecure in the strengthened e CK(se CK) model, which encompasses the e CK model and considers leakages on intermediate results. In this paper, we present a pure pairing-free CL-AKA protocol, which is provably secure in the se CK model under the standard computational Diffie-Hellman(CDH) assumption. Compared with the existing CL-AKA protocols, the proposed protocol has advantage over them in security or efficiency.

关键词： CDH assumption se CK model pairing certificateless cryptography authenticated key agreement

certificateless universal designated verifier signature schemes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2007年第3期14卷 85-90,94页

作者： MING Yang SHEN Xiao-qin WANG Yu-min State Key Laboratory of Integrated Service Network Xidian UniversityXi'an 710071 China

Universal designated verifier signature schemes allows a signature holder to designate the signature to a desire designated verifier, in such a way that only designated verifier can verify this signature, but is unable to convince anyone else of this fact. The previous constructions of universal designated verifier signature rely on the underlying public key infrastructure, that needs both signers and verifiers to verify the authenticity of the public keys, and hence, the certificates are required. This article presents the first model and construction of the certificateless universal designated verifier signature scheme, in which the certificates are not needed. The proposed scheme satisfies all the requirements of the universal designated verifier signature in the certificateless system. Security proofs are provided for the scheme based on the random oracle model, assuming that the Bilinear diffie-hellman （BDH） problem is hard to solve.

关键词： certificateless cryptography universal designated verifier signature bilinear pairing

Pairing-Free certificateless Key-Insulated Encryption with Provable Security

在线全文

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2018年第1期16卷 50-56页

作者： Li-Bo He Dong-Jie Yan Hu Xiong Zhi-Guang Qin School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054

certificateless encryption attracts a lot of attention so far by eliminating the key escrow problem in identity-based encryption and public key certificates in the traditional public key cryptography. By considering the threat from the key exposure, it is desirable to incorporate the idea of key-insulated cryptosystem into the certificateless encryption. In this paper, we have designed an efficient certificateless keyinsulated encryption(CL-KIE) scheme to achieve this goal. By our approach, the computational performance of our scheme has been improved significantly in terms of reduction on running time and storage. We also gave the security proof of the new CL-KIE scheme against the chosen plaintext attacks(CPAs) in the random oracle, considering the assumption of the computational Diffie-Hellman(CDH) problem.

关键词： certificateless cryptography keyinsulated pairing-free random oracle

An Efficient certificateless Aggregate Signature Scheme Designed for VANET

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第5期63卷 725-742页

作者： Cui Li Gang Wu Lipeng Xing Feng Zhu Liang Zhao College of Information and Communication National University of Defense TechnologyXi’anChina Ansys Southpointe 2600 ANSYS Drive CanonsburgCommonwealth of Pennsylvania15317USA

The Vehicular Ad-hoc Network(VANET)is the fundamental of smart transportation system in the future,but the security of the communication between vehicles and vehicles,between vehicles and roadside infrastructures have become increasingly prominent.certificateless aggregate signature protocol is used to address this security issue,but the existing schemes still have many drawbacks in terms of security and efficiency:First,many schemes are not secure,and signatures can be forged by the attacker;Second,even if some scheme are secure,many schemes use a large number of bilinear pairing operation,and the computation overhead is large.At the same time,the length of the aggregated signature also increases linearly with the increase of user numbers,resulting in a large communication overhead.In order to overcome the above challenges,we propose a new certificateless aggregate signature scheme for VANET,and prove the security of the scheme under the random oracle model.The new scheme uses pseudonym to realize the conditional privacy protection of the vehicle’s information.The new scheme does not use bilinear pairing operation,and the calculation efficiency is high.At the same time,the length of the aggregate signature of the new scheme is constant,thereby greatly reducing the communication and storage overhead.The analysis results demonstrate that the new scheme is not only safer,but also superior in performance to the recent related schemes in computation overhead and communication cost.

关键词： Vehicular Ad-hoc network certificateless cryptography aggregate signature random oracle model

certificateless Encryption Scheme Secure in Standard Model

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2009年第4期14卷 452-459页

作者：张国艳王小云 School of Computer Science and Technology Shandong University Key Laboratory of Cryptologic Technology and Information Security of the Ministry of Education Shandong University Center for Advanced Study Tsinghua University

The scheme introduced by Hwang and Liu in 2008 is shown to be insecure against the key re- placement attack. A more practical attack model is introduced, and according to this model, an efficient cer- tificateless encryption scheme is presented which is IND-CCA secure against both Type I and Type II at- tackers without random oracle. This encryption scheme can defend against the malicious key generation center attack, and can reach Girault＇s trusted level 3 as in traditional public key infrastructure-based cryp- tography. This certificateless encryption scheme has a shorter public key than other schemes in the stan- dard model.

关键词： certificateless cryptography malicious key generation center key replacement attack IND-CCA secure

在线全文

学校读者我要写书评

暂无评论

一种可证安全的无证书环签密方案(英文)

China Communications 2011年第3期8卷 99-106页

作者：祁正华杨庚任勋益 College of Computer Science & Technology Nanjing University of Posts and Telecommunications

Ring signcryption enables a user to send a message confidentially and authentically to a specific receiver in an anonymous way.One of the main reasons for the slow adoption of identity-based cryptography is the inherent key escrow problem.In this paper a new certificateless ring signcryption scheme from pairings is presented.It is escrow free in that no KGC is able to decrypt ciphertexts itself.We then formally prove the security of the new scheme in the random oracle model IND-CCA2 and EUF-CMA.

关键词： ring signcryption certificateless cryptography bilinear pairing

Efficient certificateless Aggregate Signature Scheme

在线全文

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2012年第3期10卷 209-214页

作者： Yu-Chi Chen Gwoboa Homg Chao-Liang Liu Yuan-Yu Tsa Chi-Shiang Chan Department of Computer Science and Engineering National Chung-Hsing University Taichung Department of Applied Informatics and Multimedia Asia University Taichung

In ubiquitous computing, data should be able to be accessed from any location, and the correctness of data becomes vital during the communication. Suppose that many users sign different messages respectively, before forwarding or sending these messages, then the verifier must spend a lot of computing time to verify their signatures. Consequently, the aggregate signature scheme is an effective method of improving efficiency in this kind of systems, which provides the convenience for the verifier. In this paper, we propose a new certificateless aggregate signature scheme which is efficient in generating a signature and verification. This scheme is provably secure under the extended computational Diffie-Hellman assumption.

关键词： Aggregate signature certificatelessaggregate signature certificateless cryptography digitalsignature.