检索结果-南通市图书馆

GOMSS: A Simple Group Oriented(t, m, n) Multi-secret Sharing Scheme

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第3期26卷 557-563页

作者： miao fuyou WANG Li JI Yangyang XIONG Yan School of Computer Science and Technology University of Science and Technology of China

In most(t,n)-Multi-secret sharing((t,n)-MSS)schemes,an illegal participant,even without any valid share,may recover secrets when there are over t participants in secret *** address this problem,the paper presents the notion of Group oriented(t,m,n)-multi-secret sharing(or(t,m,n)-GOMSS),in which recovering each secret requires all m(n≥m≥t)participants to have valid shares and actually participate in secret *** an example,the paper then proposes a simple(t,m,n)-GOMSS *** the scheme,every shareholder has only one share;to recover a secret,m shareholders construct a Polynomial-based randomized component(PRC)each with the share to form a tightly coupled group,which forces the secret to be recovered only with all m valid *** a result,the scheme can thwart the above illegal participant *** scheme is simple as well as flexible and does not depend on conventional hard problems or one way functions.

关键词： Multi-secret sharing Shamirs scheme Tightly coupled group Polynomial-based randomized component(PRC)

Asynchronous Group Authentication

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第4期26卷 820-826页

作者： miao fuyou JIANG Huiwen JI Yangyang XIONG Yan School of Computer Science and Technology University of Science and Technology of China

Group authentication usually checks whether an individual user belongs to a pre-defined group each time but cannot authenticate all users at once without public key system. The paper proposes a Randomized component-based asynchronous(t, m, n) group authentication((t, m, n)-RCAGA) scheme. In the scheme, each user employs the share of(t, n)-threshold secret sharing as the token, constructs a Randomized component(RC) with the share and verifies whether all users belong to a pre-defined group at once without requiring all users to release randomized components simultaneously. The proposed scheme is simple and flexible because each group member just uses a single share as the token and the scheme does not depend on any public key system. Analyses show the proposed scheme can resist up to t-1 group members conspiring to forge a token, and an adversary is unable to forge a valid token or derive a token from a RC.

关键词： Randomized component(RC) Group au thentication Chinese remainder theorem Asynchronous

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 proactive secret sharing scheme based on Chinese remainder theorem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2021年第2期15卷 133-142页

作者： Keju MENG fuyou miao Yu NING Wenchao HUANG Yan XIONG Chin-Chen CHANG School of Computer Science and Technology University of Science and Technology of ChinaHefei230026China Department of Information Engineering and Computer Science Feng Chia UniversityTaichung40724China School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China

If an adversary tries to obtain a secret s in a(t,n)threshold secret sharing(SS)scheme,it has to capture no less than t shares instead of the secret s ***,if a shareholder keeps a fixed share for a long time,an adversary may have chances to filch some shareholders’*** a proactive secret sharing(PSS)scheme,shareholders are supposed to refresh shares at fixed period without changing the *** this way,an adversary can recover the secret if and only if it captures at least t shares during a period rather than any time,and thus PSS provides enhanced protection to long-lived *** existing PSS schemes are almost based on linear SS but no Chinese Remainder Theorem(CRT)-based PSS scheme was *** paper proposes a PSS scheme based on CRT for integer ring to analyze the reason why traditional CRT-based SS is not suitable to design PSS ***,an ideal PSS scheme based on CRT for polynomial ring is also *** scheme utilizes isomorphism of CRT to implement efficient share refreshing.

关键词： proactive secret sharing Chinese remainder theorem polynomial ring integer ring isomorphism

A Secure Distributed Authentication Scheme Based on CRT-VSS and Trusted Computing in MANET

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第2期23卷 284-290页

作者： WANG Xingfu LU Qiwei XIONG Yan miao fuyou HUANG Wenchao LIU Tao WU Xuangou School of Computer Science and Technology University of Science and Technology of China School of Computer and Information Anhui Polytechic University School of Computer Science Anhui University of Technology

With the rapid development of Mobile ad hoc network(MANET), secure and practical authentication is becoming increasingly important. There still exist several unsolved problems. It may suffer from cheating problems and Denial of services(Do S) attacks towards authentication service. Most existing schemes do not have satisfactory efficiency due to the exponential arithmetic complexity of Shamir’s scheme. We explore the property of Verifiable secret sharing(VSS) schemes with Chinese remainder theorem(CRT), then propose a secret key distributed storage scheme based on CRT-VSS and trusted computing techniques. We discuss the homomorphism property of CRT-VSS and design a secure distributed Elliptic curve-digital signature standard(ECCDSS) authentication scheme. We provide formal guarantees towards the scheme proposed in this paper.

关键词： Secret sharing Trusted computing Authentication Chinese remainder theorem

无线传感器网络中一种能量有效的簇头选举算法

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

计算机工程 2006年第24期32卷 104-106页

作者：熊焰吕天行苗付友王行甫中国科学技术大学计算机科学技术系合肥230027

在基于二层架构的无线传感器网络中,有效的簇头选举算法非常重要。一些现有的算法随机性很大,而另外一些只考虑了同构的情况,实用价值不大。该文提出了一种基于负载平衡的算法,该算法中簇头计算每个簇内成员预期做簇头后的生命期,然后... 详细信息

在基于二层架构的无线传感器网络中,有效的簇头选举算法非常重要。一些现有的算法随机性很大,而另外一些只考虑了同构的情况,实用价值不大。该文提出了一种基于负载平衡的算法,该算法中簇头计算每个簇内成员预期做簇头后的生命期,然后把生命期最大的两个簇员选作新的簇头和新的候选簇头。通过模拟,将该算法与随机选取算法的实现效果进行比较,发现该算法延长了网络生命期。

关键词：无线传感器网络二层架构簇头选举算法生命期

在线全文

学校读者我要写书评

暂无评论

基于整数规划的一般访问结构秘密共享方案

计算机工程 2019年第6期45卷 165-170页

作者：解扬苗付友白建峰中国科学技术大学计算机科学与技术学院

在利用整数规划实现一般访问结构的秘密共享时,为简化访问结构、保证所有的整数规划都有解,提出一种将整数规划以直接构造的方式应用于一般访问结构秘密共享的方案。通过构建整数规划将秘密隐藏于目标函数的解中,并将约束条件作为秘密... 详细信息

在利用整数规划实现一般访问结构的秘密共享时,为简化访问结构、保证所有的整数规划都有解,提出一种将整数规划以直接构造的方式应用于一般访问结构秘密共享的方案。通过构建整数规划将秘密隐藏于目标函数的解中,并将约束条件作为秘密份额发送给参与者。参与者可通过共享秘密份额重构整数规划,并利用解方程组的方法找到目标函数的正确解,以恢复秘密。分析结果表明,与借助(t,n)门限的方案相比,该方案能实现所有的访问结构,无须采用传统方式求解整数规划和推导最大拒绝集,降低了计算复杂度。

关键词：整数规划向量空间一般访问结构秘密共享目标函数约束条件

在线全文

学校读者我要写书评

暂无评论

理想型(t,k,n)紧耦合秘密共享构造

计算机工程与应用 2021年第3期57卷 125-129页

作者：白建峰苗付友中国科学技术大学计算机科学与技术学院合肥230027

在(t,n)门限秘密共享恢复过程中,任意多于t个的参与者可以恢复得到秘密。但是在实际的应用过程中,当参与者人数为k(t≤k≤n)时,只需获得t个参与者的份额(share)即可恢复秘密,即使其中的k-t个参与者不提供子份额。(t,k,n)紧耦合秘密共享... 详细信息

在(t,n)门限秘密共享恢复过程中,任意多于t个的参与者可以恢复得到秘密。但是在实际的应用过程中,当参与者人数为k(t≤k≤n)时,只需获得t个参与者的份额(share)即可恢复秘密,即使其中的k-t个参与者不提供子份额。(t,k,n)紧耦合秘密共享是指在(t,n)门限秘密共享中,当参与者人数为k时,k个参与者作为一个整体,其中的每个人均参与到秘密恢复中,任意的k-1个参与者无法获取秘密的任何信息。在现有的紧耦合秘密共享方案中,无论是基于中国剩余定理的紧耦合秘密共享方案或者是基于拉格朗日插值多项式的紧耦合秘密共享方案,均存在信息率不为1,导致效率低下的缺陷。将中国剩余定理推广到有限域上的多项式环上,利用多项式环上的中国剩余定理构造出理想型(t,k,n)紧耦合秘密共享方案。

关键词：秘密共享中国剩余定理紧耦合秘密共享多项式环

在线全文

学校读者我要写书评

暂无评论

分布式动态蜂窝QoS路由协议的NS2仿真

计算机工程 2006年第10期32卷 105-107页

作者：熊焰王海波苗付友王行甫中国科学技术大学计算机科学与技术系合肥230026

介绍了基于动态蜂窝的移动自组网QoS路由协议,在此基础上描述了该协议在网络仿真器NS2上的实现,并通过仿真实验比较了该协议与基于传统按需以及表驱动的QoS路由协议在包传输率与路由负载上的性能。仿真结果显示:基于动态蜂窝的QoS路由... 详细信息

介绍了基于动态蜂窝的移动自组网QoS路由协议,在此基础上描述了该协议在网络仿真器NS2上的实现,并通过仿真实验比较了该协议与基于传统按需以及表驱动的QoS路由协议在包传输率与路由负载上的性能。仿真结果显示:基于动态蜂窝的QoS路由协议明显提高了包传输率,减轻了路由负载。

关键词：移动自组网动态蜂窝服务质量