检索结果-南通市图书馆

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Collusion-resistant convertible ring signature schemes

引用

Science China(Information Sciences) 2015年第1期58卷 134-149页

作者： HWANG Jung Yeon CHANG Ku-Young CHO Hyun Sook SONG Boyeon SUSILO Willy Electronics and Telecommunications Research Institute(ETRI) DaejeonKorea Korea Institute of Science and Technology Information (KISTI) DaejeonKorea Centre for Computer and Information Security Research School of Computer Science and Software EngineeringUniversity of WollongongAustralia

A ring signature scheme provides signer ambiguity by hiding a signer in a ring of arbitrary members appropriately. A convertible ring signature scheme is an extension of a ring signature scheme that authenticates a signer and proves that a real signer and no one else generated a ring signature. In this paper, we first show that the recent convertible ring signature scheme proposed by Jeong et al. is vulnerable to collusion ***, we present a formal security model for a convertible ring signature with collusion resistance. The security notion of a convertible ring signature is intrinsically different from that of an ordinary ring signature due to the conversion property. For our collusion resistance, we consider full key exposure, that is, even an adversary who knows all secret keys will not be able to break the collusion resistance. Finally, we construct a novel convertible ring signature scheme with collusion resistance and prove the security of the scheme in the presented security model. We also compare our scheme with the existing ring signature schemes in the literature to show its advantages.

关键词： authentication ring signature anonymity convertibility collusion-resistance

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A ring signature Suitable for Wireless Sensor Networks

引用

China Communications 2012年第12期9卷 1-7页

作者： Du Yuejin Wang Yongjian National Computer Network Emergency Response Center Technical Team/Coordination Center of China Beijing 100029 P. R. China Beijing University of Posts and Telecommunications Beijing 100876 P. R. China

Wireless Sensor Network （WSN） nodes are severely limited by their power, communication bandwidth, and storage space, and the traditional signature algorithm is not suitable for WSN environments. In this paper, we present a ring signature scheme designed for WSNs. In this scheme, all of the wireless sensor nodes are divided into several sub-groups and the sub-group nodes are used to generate the signature instead of the WSN cluster nodes. This scheme can effectively avoid the single node failure problem, and it also has a high availability. All nodes are flee to sign their own message, and the nodes that generate signatures can simultaneously calculate their own part of the signature, meeting the distributed parallel computing requirements. Compared with the traditional ring signature, this scheme reduces the energy consumption, and therefore is very suitable for WSNs.

关键词： wireless sensor network ring signature random oracle security analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Threshold ring signature Scheme Based on TPM

引用

China Communications 2012年第1期9卷 80-85页

作者： Gong Bei Jiang Wei Lin Li Li Yu Zhang Xing College of Computer Science Beijing University of Technology Beijing 100124 P. R. China Institute of Electronic Technology Information Engineering University Zhengzhou 450004 P. R. China State Key Laboratory of Information Security Institute of Sottware Chinese Academy of Sciences Beijing Beijing 100049 P. R. China Key Laboratory of Information and Network Security 3rd Research Institute Ministry of Public Security Shanghai 201204 P. R. China

The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we presented a Trusted Platform Module （TPM）-based threshold ring signature schen. Employing a reliable secret Share Distribution Center （SDC）, the proposed approach can authenticate the TPM-based identity rank of members of the ring but not track a specific member＇s identity. A subset including t members with the same identity rank is built. With the signing cooperation of t members of the subset, the ring signature based on Chinese remainder theorem is generated. We proved the anonymity and unforgeability of the proposed scheme and compared it with the threshold ring signature based on Lagrange interpolation polynomial. Our scheme is relatively simpler to calculate.

关键词： ring signature TPM threshold Chinese remainder theorem rank

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：