检索结果-南通市图书馆

Improvement on the Multihop Shareholder Discovery for threshold secret sharing in MANETs

Journal of Computer Science & Technology 2011年第4期26卷 711-721页

作者： Seleviawati Tarmizi Prakash Veeraraghavan Somnath Ghosh Department of Computer Science and Computer Engineering La Trobe University

The collaboration of at least a threshold number of secret shareholders in a threshold secret sharing scheme is a strict requirement to ensure its intended functionality. Due to its promising characteristics, such a scheme has been proposed to solve a range of security problems in mobile ad hoc networks. However, discovering a sufficient number of secret shareholders in such dynamic and unpredictable networks is not easy. In this paper, we propose a more efficient shareholder discovery mechanism compared to our previous work. The discovery process is performed in a multihop fashion to adapt to the mobile ad hoc network environment. We introduce batch extension that gradually extends the shareholders＇ collaboration boundary by more than one hop at a time around the service requestor, to find at least the threshold number of the unknown shareholders. Through the batch extension, reply aggregation is applicable, hence reducing the redundancy use of reply routes, decreasing the required packet transmission, and lessening the service delay, compared to the previously proposed mechanism. Our simulation results show that, with the appropriate batch size, the latest mechanism is more efficient with an insignificant increase of control overhead.

关键词： multihop shareholder discovery threshold secret sharing multihop secret sharing

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A(t, m, n)-Group Oriented secret sharing Scheme

引用

Chinese Journal of Electronics 2016年第1期25卷 174-178页

作者： MIAO Fuyou FAN Yuanyuan WANG Xingfu XIONG Yan Moaman Badawy School of Computer Science and Technology University of Science and Technology of China

Basic(t, n)-secret sharing(SS) schemes share a secret among n shareholders by allocating each a share. The secret can be reconstructed only if at least t shares are available. An adversary without a valid share may obtain the secret when more than t shareholders participate in the secret reconstruction. To address this problem, the paper introduces the notion and gives the formal definition of(t, m, n)-Group oriented secret sharing(GOSS); and proposes a(t, m, n)-GOSS scheme based on Chinese remainder theorem. Without any share verification or user authentication, the scheme uses Randomized components(RC) to bind all participants into a tightly coupled group, and ensures that the secret can be recovered only if all m(m ≥ t) participants in the group have valid shares and release valid RCs honestly. Analysis shows that the proposed scheme can guarantee the security of the secret even though up to m-1 RCs or t-1 shares are available for adversaries. Our scheme does not depend on any assumption of hard problems or one way functions.

关键词： threshold secret sharing Group oriented Randomized components Share protection Chinese remainder theorem

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm

引用

Frontiers of Computer Science 2020年第3期14卷 203-215页

作者： Yudi ZHANG Debiao HE Mingwu ZHANG Kim-Kwang Raymond CHOO Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China School of Computer Sciences Hubei University of TechnologyWuhan 430068China Department of Information Systems and Cyber Security and Department of Electrical and Computer Engineering University of Texas at San AntonioSan AntonioTX 78249USA

Mobile devices are widely used for data access,communications and ***,storing a private key for signature and other cryptographic usage on a single mobile device can be challenging,due to its computational ***,a number of(t,n)threshold secret sharing schemes designed to minimize private key from leakage have been proposed in the ***,existing schemes generally suffer from key reconstruction *** this paper,we propose an efficient and secure two-party distributed signing protocol for the SM2 signature *** latter has been mandated by the Chinese government for all electronic commerce *** proposed protocol separates the private key to storage on two devices and can generate a valid signature without the need to reconstruct the entire private *** prove that our protocol is secure under nonstandard ***,we implement our protocol using MIRACL Cryptographic SDK to demonstrate that the protocol can be deployed in practice to prevent key disclosure.

关键词： SM2 signature two-party signing wireless environment provable security threshold secret sharing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Security of account and privacy of transaction for bitcoin

引用

The Journal of China Universities of Posts and Telecommunications 2018年第5期25卷 20-30,48页

作者： Liu Zhenhua Yuan Dong Liu Yaohui Li Yuanyuan School of Mathematics and Statistics Xidian University

As a kind of cryptocurrency, bitcoin has attracted much attention with its decentralization. However, there is two problems in the bitcoin transactions ： the account security and transaction privacy. In view of the above problems, a new partially blind threshold signature scheme is proposed, which can both enhance the security of bitcoin account and preserve the privacy of transaction. Firstly, transaction amounts are encrypted by employing the homomorphic Paillier cryptosystem, and output address is disturbed by using one-time public key. Then the encrypted or disrupted transaction information is signed by multiple participants who are authorized by using threshold secret sharing. Compared with partially blind fuzzy signature scheme, the proposed scheme can fully preserve the transaction privacy. Furthermore, performance analysis shows that the proposed scheme is secure and effective in practical applications.

关键词： bitcoin account security threshold secret sharing transaction privacy one-time public key Paillier cryptosystem

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Verifiable secret sharing Scheme Based on Certain Projective Transformation

引用

American Journal of Computational Mathematics 2021年第2期11卷 175-188页

作者： Bin Li School of Mathematics Chengdu Normal University Chengdu China

The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero k-submatrix and theresidual vector of system of hyperplane intersecting line equations is proposed. Based on certain projective transformations in projective space, a verifiable (t, n)-threshold secret sharing scheme is designed by using the structure of solutions of linear equations and the difficulty of solving discrete logarithm problems. The results show that this scheme can verify the correctness of the subkey provided by each participant before the reconstruction of the master key, and can effectively identify the fraudster. The fraudster can only cheat by guessing and the probability of success is only 1/p. The design of the scheme is exquisite and the calculation complexity is small. Each participant only needs to hold a subkey, which is convenient for management and use. The analysis shows that the scheme in this paper meets the security requirements and rules of secret sharing, and it is a computationally secure and effective scheme with good practical value.

关键词： threshold secret sharing Projective Transformation Nonzero k–Submatrix Residual Vector of Equations

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：