检索结果-南通市图书馆

id-based Fair Off-Line Electronic Cash System with Multiple Banks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2007年第3期22卷 487-493页

作者：王常吉汤庸李琴 Department of Computer Science Sun Yat-Sen University

id-based public key cryptography （id-PKC） has many advantages over certificate-based public key cryptography （CA-PKC）, and has drawn researchers＇ extensive attention in recent years. However, the existing electronic cash schemes are constructed under CA-PKC, and there seems no electronic cash scheme under id-PKC up to now to the best of our knowledge. It is important to study how to construct electronic cash schemes based on id-PKC from views on both practical perspective and pure research issue. In this paper, we present a simpler and provably secure id-based restrictive partially blind signature （RPBS）, and then propose an id-based fair off-line electronic cash （id-FOLC） scheme with multiple banks based on the proposed id-based RPBS. The proposed id-FOLC scheme with multiple banks is more efficient than existing electronic cash schemes with multiple banks based on group blind signature.

关键词： electronic cash restrictive partially blind signature id-based cryptography

identity-based strong designate verifier signature over lattices

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2014年第6期21卷 52-60页

作者： WANG Feng-he HU Yu-pu WANG Chun-xiao Department of the Mathematics and Physics Shandong Jianzhu University State Key Laboratory of Integrate Services Networks Xidian University

The notion of the identity-based（id-based） strong designate verifier signature（SDVS） was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors（LWE） problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution（SIS） problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than（3m＋n） lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature（SDVRS） scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.

关键词： SDVS lattice-based cryptography id-based cryptography Gaussian sample SIS problem LWE problem

Forgeability of Wang-Tang-Li's id-based Restrictive Partially Blind Signature Scheme

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2008年第2期23卷 265-269页

作者：刘胜利陈晓峰张方国 Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China State Key Laboratory of Information SecurityInstitute of SoftwareChinese Academy of Sciences Beijing 100080China Department of Computer Science School of Information Science and TechnologySun Yat-Sen University Guangzhou 510275China Department of Electronics and Communication Engineering School of Information Science and Technology Sun Yat-Sen UniversityGuangzhou 510275China

Restrictive partially blind signature （RPBS） plays an important role in designing secure electronic cash system Very recently, Wang, Tang and Li proposed a neW id-based restrictive partially blind signature （id-RPBS） and gave the security proof. In this paper, we present a cryptanalysis of the scheme and show that the signature scheme does not satisfy the property of unforgeability as claimed. More precisely, a user can forge a valid message-signature pair （id, msg, info＇, σ＇） instead of the original one （id, msg, info, σ）, where info is the original common agreed information and info＇≠info. Therefore, it will be much dangerous if Wang-Tang-Li＇s id-RPBS scheme is applied to the off-line electronic cash system. For example, a bank is supposed to issue an electronic coin （or bill） of $100 to a user, while the user can change the denomination of the coin （bill） to any value, say $100 000 000, at his will.

关键词： unforgeability restrictive partially blind signature id-based cryptography electronic cash

An Efficient Provable Secure id-based Proxy Signature Scheme based on CDH Assumption

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2006年第3期11卷 271-278页

作者：柴震川曹珍富陆荣幸 Dept.of Computer Science and Eng. Shanghai Jiaotong Univ. Shanghai 200030China

identity-based proxy signature enables an entity to delegate its signing rights to another entity in identity-based cryptosystem settings. However, few existing scheme has been proved secure in a formalized model, or acquired optimized performance. To achieve the goals of both proven security and high efficiency, this paper proposed an efficient identity-based proxy signature scheme. The scheme is constructed from bilinear pairing and proved secure in the random oracle model, using the oracle replay attack technique introduced by Pointehval and Stern. The analysis shows that the scheme needs less computation costs and has a shorter signature than the other schemes.

关键词： id-based cryptography proxy signature bilinear pairings provable security

Efficient Privacy Enhanced Software Registration with id-based Blind Signatures

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2008年第6期13卷 733-738页

作者： CHEN Wuping QIN Bo WU Qianhong ZHANG Huanguo School of Computer Wuhan University Wuhan 430072 Hubei China School of Science Xi'an University of Technology Xi'an 710043 Shaanxi China Department of Computer Engineering and Mathematics Rovira i Virgili University Tarragona E-43007 Catalonia Spain

In existing software registration schemes, the privacy of users is not taken into account and may be in the risks of abuses. In this paper, we proposed a novel software registration system which can greatly reduce unauthorized use of software while keeping the privacy of users. To the best of our knowledge, this is the first system that the privacy of users is guaranteed in software registration. Our system enjoys a modular design and can be implemented by any secure id-based partially blind signature scheme. Furthermore, the proposal allows flexible registration information definition. This feature makes our scheme flexible and practical for more software registration applications.

关键词： information security privacy enhanced technology software registration id-based cryptography blind signature

RING PROXY SIGNATURES

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2008年第1期25卷 108-114页

作者： Wei Baodian Zhang Fangguo Chen Xiaofeng Department of Electronics and Communication Engineering Sun Yat-Sen University Guangzhou 510275 China Department of Computer Science Sun Yat-Sen University Guangzhou 510275 China Guangdong.Key Laboratory of Information Security Technology Guangzhou 510275 China

Proxy signatures have been used to enable the transfer of digital signing power within some context and ring signatures can be used to provide the anonymity of a signer. By combining the functionalities of proxy signatures and ring signatures, this paper introduces a new concept, named ring proxy signature, which is a proxy signature generated by an anonymous member from a set of potential signers. The paper also constructs the first concrete ring proxy signature scheme based on the provably secure Schnorr's signatures and two id-based ring proxy signature schemes. The security analysis is provided as well.

关键词： Proxy signature Ring signature Ring proxy signature id-based cryptography Bilinear parings