检索结果-南通市图书馆

An Efficient Proxy ring signature Without Bilinear Pairing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第3期28卷 514-520页

作者： ZHANG Yingying ZENG Jiwen School of Science Chongqing University of Posts and Telecommunications School of Mathematical Sciences Xiamen University School of Mathematics Science Xinjiang Normal University

Proxy ring signature is a proxy signature designed to protect the privacy of the proxy signer. In this paper, we propose a new proxy ring signature based on the Schnorr’s signature. Our scheme combines the idea of the Schnorr’s signature with the method of existing structure of proxy ring signature. In order to improve the performance, we eliminate the use of bilinear pairing operation. We only use the hash function in the signature verification phase. Because of above features, the proxy ring signature scheme we proposed is more efficient in computation. We also prove that our scheme is unforgeable against all kinds of adversaries in the random oracle model.

关键词： ring signature Proxy signature Proxy ring signature Random oracle

Revocable ring signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2007年第6期22卷 785-794页

作者：廖忻宏廖啟瑞穆怡 Willy Susilo 王石 Department of Computer Science City University of Hong KongHong KongChina Institute for Infocomm Research(I~2R) 21 Heng Mui Keng TerraceSingapore 119613 Centre for Computer and Information Security Research School of Computer Science and Software Engineering University of WollongongWoUongongNSW 2522Australia

Group signature allows the anonymity of a real signer in a group to be revoked by a trusted party called group manager. It also gives the group manager the absolute power of controlling the formation of the group. ring signature, on the other hand, does not allow anyone to revoke the signer anonymity, while allowing the real signer to form a group （also known as a ring） arbitrarily without being controlled by any other party. In this paper, we propose a new variant for ring signature, called Revocable ring signature. The signature allows a real signer to form a ring arbitrarily while allowing a set of authorities to revoke the anonymity of the real signer. This new variant inherits the desirable properties from both group signature and ring signature in such a way that the real signer will be responsible for what it has signed as the anonymity is revocable by authorities while the real signer still has the freedom on ring formation. We provide a formal security model for revocable ring signature and propose an efficient construction which is proven secure under our security model.

关键词： anonymity group signature revocability ring signature

Practical Constant-Size ring signature

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第3期33卷 533-541页

作者： Meng-Jun Qin Yun-Lei Zhao Zhou-Jun Ma Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai 201203 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710126 China State Key Laboratory of Cryptology State Cryptology Administration Beijing 100878 China

Bitcoin has gained its popularity for almost 10 years as a ＂secure and anonymous digital currency＂. However, according to several recent researches, we know that it can only provide pseudonymity rather than real anonymity, and privacy has been one of the main concerns in the system similar to Bitcoin. ring signature is a good method for those users who need better anonymity in cryptocurrency. It was first proposed by Rivest et al. based upon the discrete logarithm problem （DLP） assumption in 2006, which allows a user to sign a message anonymously on behalf of a group of users even without their coordination. The size of ring signature is one of the dominating parameters, and constant-size ring signature （where signature size is independent of the ring size） is much desirable. Otherwise, when the ring size is large, the resultant ring signature becomes unbearable for power limited devices or leads to heavy burden over the communication network. Though being extensively studied, currently there are only two approaches for constant-size ring signature. Achieving practical constant-size ring signature is a long-standing open problem since its introduction. In this work, we solve this open question. We present a new constant-size ring signature scheme based on bilinear pairing and accumulator, which is provably secure under the random oracle （RO） model. To the best of our knowledge, it stands for the most practical ring signature up to now.

关键词： ring signature constant size bilinear pairing accumulator

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

Feasibility analysis of two identity-based proxy ring signature schemes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2007年第2期13卷 207-209页

作者：王化群 Zhang Lijun Zhao Junxi School of Information Engineering Dalian Fisheries University Dalian 116023 P.R.China College of Telecommunications ＆ Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003 P.R.China College of Mathematics ＆ Physics Nanjing University of Posts and Telecommunications Nanjing 210003 P.R.China

Recently, proxy ring signature schemes have been shown to be useful in various applications, such as electronic polling, electronic payment, etc. Although many proxy ring signature schemes have been pro-posed, there are only two identity-based proxy ring signature schemes have been proposed until now, i. e., Cheng＇s scheme and Lang＇s scheme. It＇s unlucky that the two identity-based proxy ring signature schemes are unfeasible. This paper points out the reasons why the two identity-based proxy ring signature schemes are unfeasible. In order to design feasible and efficient identity-based proxy ring signature schemes from bilinear pairings, we have to search for other methods.

关键词： proxy signature ring signature proxy ring signatures identity-based cryptograph bilinear pairings

Identity-based ring signature scheme based on quadratic residues

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2009年第1期15卷 94-100页

作者：熊虎 School of Computer Science and Engineering University of Electronic Science and Technology of China

Identity-based （ID-based） ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive. Hence, ID-based ring signature without pairing is of great interest in the field of cryptography. In this paper, the authors firstly propose an ID-based ring signature scheme based on quadratic residues. The proposed scheme is proved to be existentially unforgeable against adaptive chosen message-and-identity attack under the random oracle model, assuming the hardness of factoring. The proposed scheme is more efficient than those which are constructed from bilinear pairings.

关键词： identity-based signature ring signature quadratic residue random oracle provable security

A new improved ID-based proxy ring signature scheme from bilinear pairings

在线全文

学校读者我要写书评

暂无评论

Journal of Harbin Institute of Technology(New Series) 2006年第6期13卷 688-691页

作者：郎为民杨宗凯程文青谭运猛 PLA Institute of Communications Command Dept. of Electronic and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Dept. of Electronic and Information Engineering Huazhong University of Science and Technology

ring signature and proxy signature are of vital importance to secure electronic commerce. Recently, the bilinear pairing such as Well pairing or Tate pairing on elliptic curves and hyperelliptic curves is playing an important role in security solutions. Several ID-based signature schemes have been put forward, many of which are based on bilinear pairings. In key management and moderate security demand scenarios, ID-based public key cryptosystem is more preferable than other public key infrastructure based systems. In this paper, an improved ID-based proxy ring signature scheme from bilinear pairings is proposed which combines the advantages of proxy signature and of ring signatures. Our scheme can guarantee the profits of the proxy signer via preventing the original signer form generating the proxy ring signature. Furthermore, bilinear pairings are introduced to minimize the computation overhead and to improve the related performance of our scheme. In contrast with Zhang＇s scheme, our scheme is a computational efficiency improvement for signature verification because the computational cost of bilinear pairings required is reduced from O（n） to O（ 1 ）. In addition, the proxy ring signature presented in this paper can perfectly satisfy all the security requirements of proxy ring signature, i. e. signer-ambiguity, non-forgeability, verification, non-deniability and distinguishability.

关键词： digital signature proxy signature ring signature identity-based cryptography bilinear pairings

A ring signature SCHEME OVER BRAID GROUPS

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2010年第4期27卷 522-527页

作者： Wei Yun Xiong Guohua Bao Wansu Zhang Xingkai Institute of Electronic Technology Information Engineering University Zhengzhou 450004 China Institute of Electronic Technology Beijing 100105 China Unit 96610 Beijing 102208 China

Quantum algorithms bring great challenges to classical public key cryptosystems, which makes cryptosystems based on non-commutative algebraic systems hop topic. The braid groups, which are non-commutative, have attracted much attention as a new platform for constructing quantum attack-resistant cryptosystems. A ring signature scheme is proposed based on the difficulty of the root extraction problem over braid groups, which can resist existential forgery against the adaptively cho-sen-message attack under the random oracle model.

关键词： Braid group ring signature Root extraction problem Random oracle model

A Conditionally Anonymous Linkable ring signature for Blockchain Privacy Protection

在线全文

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2023年第12期47卷 2851-2867页

作者： Quan Zhou Yulong Zheng Minhui Chen Kaijun Wei School of Mathematics and Information Science Guangzhou UniversityGuangzhou510006China School of Computer Science and Cyber Engineering Guangzhou UniversityGuangzhou510006China

In recent years,the issue of preserving the privacy of parties involved in blockchain transactions has garnered significant *** ensure privacy protection for both sides of the transaction,many researchers are using ring signature technology instead of the original signature ***,in practice,identifying the signer of an illegal blockchain transaction once it has been placed on the chain necessitates a signature technique that offers conditional *** illegals can conduct illegal transactions and evade the lawusing ring signatures,which offer perfect *** paper firstly constructs a conditionally anonymous linkable ring signature using the Diffie-Hellman key exchange protocol and the Elliptic Curve Discrete Logarithm,which offers a non-interactive process for finding the signer of a ring signature in a specific ***,this paper’s proposed scheme is proven correct and secure under Elliptic Curve Discrete Logarithm ***,compared to previous constructions,the scheme presented in this paper provides a non-interactive,efficient,and secure confirmation *** addition,this paper presents the implementation of the proposed scheme on a personal computer,where the confirmation process takes only 2,16,and 24ms for ring sizes of 4,24 and 48,respectively,and the confirmation process can be combined with a smart contract on the blockchain with a tested millisecond level of running *** conclusion,the proposed scheme offers a solution to the challenge of identifying the signer of an illegal blockchain transaction,making it an essential contribution to the field.

关键词： ring signature conditionally anonymity blockchain privacy protection