检索结果-南通市图书馆

A New Revocable and Re-Delegable proxy signature and Its Application

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第2期33卷 380-399页

作者： Shengmin Xu Guomin Yang Yi Mu Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong Wollongong 2500 Australia

With the popularity of cloud computing and mobile Apps, on-demand services such as on-line music or audio streaming and vehicle booking are widely available nowadays. In order to allow efficient delivery and management of the services, for large-scale on-demand systems, there is usually a hierarchy where the service provider can delegate its service to a top-tier （e.g., countrywide） proxy who can then further delegate the service to lower level （e.g., region-wide） proxies. Secure （re-）delegation and revocation are among the most crucial factors for such systems. In this paper, we investigate the practical solutions for achieving re-delegation and revocation utilizing proxy signature. Although proxy signature has been extensively studied in the literature, no previous solution can achieve both properties. To fill the gap, we introduce the notion of revocable and re-delegable proxy signature that supports efficient revocation and allows a proxy signer to re-delegate its signing right to other proxy signers without the interaction with the original signer. We define the formal security models for this new primitive and present an efficient scheme that can achieve all the security properties. We also present a secure on-line revocable and re-delegate vehicle ordering system （RRVOS） as one of the applications of our proposed scheme.

关键词： revocation （re）delegation proxy signature

A proxy signature Scheme as Secure as Decisional Diffie-Hellman Problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第1期10卷 186-190页

作者： LURong-xing CAOZhen-fu DepartmentofComputerScienceandEngineering ShanghaiJiaotongUniversityShanghai200030China

Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.

关键词： proxy signature decisional Diffie-Heliman problem random oracle model

A Linear Homomorphic proxy signature Scheme Based on Blockchain for Internet of Things

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第8期136卷 1857-1878页

作者： Caifen Wang Bin Wu College of Big Data and Internet Shenzhen Technology UniversityShenzhen518118China School of Electronic and Information Engineering Lanzhou Jiaotong UniversityLanzhou730070China

The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing.One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results.Linearly homomorphic proxy signature(LHPS)is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right.Blockchain has the characteristics of tamper-proof and traceability,and is a new technology to solve data security.However,as far as we know,constructions of LHPS have been few and far between.In addition,the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology.Herein,we improve the security model of the LHPS scheme,and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered.Under the new model,we present a blockchain-based LHPS scheme.The security analysis shows that under the adaptive chosen message attack,the unforgeability of the proposed scheme can be reduced to the CDH hard assumption,while achieving the usual and homomorphic existential unforgeability.Moreover,comparedwith the previous LHPS scheme,the performance analysis shows that our scheme has the same key size and comparable computational overhead,but has higher security.

关键词： Homomorphic signature proxy signature security model provable security unforgeability

Cryptanalysis of efficient proxy signature schemes for mobile communication

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第10期53卷 2016-2021页

作者： SHIRASE Masaaki TAKAGI Tsuyoshi School of Systems Information Science Future University-Hakodate

In a proxy signature scheme, an original signer is allowed to delegate his signing power to a designated person, called the proxy signer and the proxy signer is able to sign the messages on behalf of the original signer. Recently, Lu, Dong and Cao proposed two proxy signature schemes for mobile communication (see Sci China Ser F-Inf Sci, 2008, 51(2): 183–195). Although they proved that their schemes are secure in the random oracle model, we disprove their claim and show that their schemes are not secure.

关键词： proxy signature proxy aggregate signature bilinear pairings forgery attack

Secure proxy signature scheme with fast revocation in the standard model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2009年第4期16卷 116-124页

作者： LIU Zhen-hua HU Yu-pu ZHANG Xiang-song MA Hua Applied Mathematics Department Xidian University Xi'an 710071 China Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China

proxy signature is an important cryptographic primitive and has been suggested in numerous applications, Tne revocation oI delegated rights is an essential issue of the proxy signature schemes. In this article, a security model of proxy signature schemes with fast revocation is formalized. Under the formal security framework, a proxy signature scheme with fast revocation based on bilinear pairings is proposed. A security mediator （SEM）, which is an on-line partially trusted server, is introduced to examine whether a proxy signer signs according to the warrant or he/she exists in the revocation list. Moreover, the proxy signer must cooperate with the SEM to generate a valid proxy signature, thus the proposed scheme has the property of fast revocation. The proposed scheme is provably secure based on the computational Diffie-Hellman （CDH） intractability assumption without relying on the random oracles, and satisfies all the security requirements for a secure proxy signature.

关键词： public key cryptography proxy signature proxy revocation security mediator bilinear pairings standard model

Designing efficient proxy signature schemes for mobile communication

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2008年第2期51卷 183-195页

作者： LU RongXing DONG XiaoLei CAO ZhenFu Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China

proxy signature is an active cryptographic research area, and a wide range of literatures can be found nowadays suggesting improvement and generalization of existing protocols in various directions. However, from the efficiency view, many proposed proxy signature schemes in these literatures are not satisfying and cannot fit to the mobile communication. Therefore, there is a desire to design efficient proxy signature schemes. Based on Boneh et al＇s pairing-based short signature, this paper presents two proxy signature schemes. One is proxy-protected signature scheme, and the other is proxy aggregate signature scheme. Since both of them can achieve high efficiency, it is believed that they are specially suitable for mobile communication environment.

关键词： proxy signature proxy protected signature proxy aggregate signature bilinear pairings provable secure,efficiency

Efficient ID-Based proxy Blind signature Scheme

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 105-108页

作者： ZHANG Qing WEN Qiaoyan CHEN Gengli School of Science Beijing University of Posts andTelecommunications Beijing 100876 China School of Computer Wuhan University Wuhan 430072Hubei China

In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting and e-payment. In this paper, we propose an identity-based proxy blind signature scheme which combines the advantages of proxy signature and of blind signature. Our scheme fulfills peffecdy the security requirements of a proxy blind signature. Comparing the previous scheme, our scheme needs less computational overhead and is more efficient.

关键词： proxy signature blind signature identity-based bilinear pairings

A Formal Model for the Security of proxy signature Schemes

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第1期10卷 275-278页

作者： GUChun-xiang ZHUYue-fei ZHANGYa-juan NetworkEngineeringDepartment InformationEngineeringUniversityZhengzhou450002HenanChina

This paper provides theoretical foundations for the secure proxy signatureprimitive. We pres-enta formal model for the security of proxy signature schemes, which defines thecapabilities of the adversary and the security goals to capture which mean for a prox-ysignaturescheme to be secure. Then, we present an example of proxy signature scheme that can be proven securein the standard model.

关键词： provable security digital signature proxy signature

A New ID-Based proxy Blind signature Scheme

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第3期10卷 555-558页

作者： LANGWei-min YANGZong-kai CHENGWen-qing TANYun-meng DepartmentofElectronicsandInformationEngineering.HuazhongUniversityofScienceandTechnology Wuhan430074Hubei.China DepartmentofElectronicsandInformationEngineering HuazhongUniversityofScienceandTechnologyWuhan430074HubeiChina／／People＇sLiberationArmyInstituteofCommunicationsCommandWuhan430010HubeiChina

An identity-based proxy blind signature scheme from bilinear pairings isintroduced, which combines the advantages of proxy signature and blind signature. Furthermore, ourscheme can prevent the original signer from generating the proxy blind signature, thus the profitsof the proxy signer are guaranteed. We introduce bilinear pairings to minimize computationaloverhead and to improve the related performance of our scheme. In addition, the proxy blindsignature presented is non-repudiable and it fulfills perfectly the security requirements of a proxyblind signature.

关键词： digital signature proxy signature blind signature identity-basedcryptography bilinear pairings