共查询到20条相似文献,搜索用时 890 毫秒
1.
Ye Zhenjun & Meng Fanzhen . The Dept. of Math Physic North China Electronic Power Univ. Tianjin P.R.China . The Science School of Tianjin Univ. Tianjin P.R.China 《系统工程与电子技术(英文版)》2006,17(4):916-918
1. INTRODUCTION Secret sharing is an important method to realize the information safety and data encryption in the crypt- ography field. It is also a fundamental protocol and tool in the multi-party setting. Now it has been applied to many applications such as electronic election, dig- ital cash and so on. The concept of secret sharing was invented independently by Shamir and Blakley in 1979, which original motivation is to cope with the problem on the safety of key management. And the b… 相似文献
2.
Yanshuo ZHANG Zhuojun LIU 《系统科学与复杂性》2007,20(4):481-485
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. Secret sharing is useful in management of cryptographic keys. Based on identity, we analyze the secret sharing scheme among weighted participants. Then we present a dynamic scheme about secret sharing among weighted participants. At last, we analyze the secret sharing scheme among weighted participants, which can make all weighted participants verifiable and dynamic. 相似文献
3.
提出利用图像处理的抖动方法来对完全256级灰度图象的图视密码学处理的新方法,引入计算机图象处理的抖动技术,在二值图象的图视密码学的方案的基础上,提出了基于Bayer矩阵抖动方法的灰度图象图视密码学方案,优点是计算量小,可直接使用二值图象基本矩阵,像素扩展小,实验效果较好。 相似文献
4.
A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone
is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications
such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based
on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic
researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings
is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman
assumption, the authors prove that the proposed scheme is a secure PVSS scheme. 相似文献
5.
Gan Zhi & Chen Kefei. Computer Science Department Shanghai Jiaotong University Shanghai P.R. China 《系统工程与电子技术(英文版)》2005,16(1)
1.INTRODUCTION Thevisualsecretsharingschemeisoneofthesecret sharingschemes[1]inwhichthesecretinformationis animagethatconsistsofacollectionofblackand whitepixels[2].Thesharedimages,eachofwhich consistsofacollectionofblackandwhitepixels,are distributedtotheparticipants,andthesecretinfor mationcanberecovereddirectlybyprintingeach sharedimageontransparencyandstackingthemto gether.KogaandYamamotohaveproposedtheex tendedschemeforcolorandgray scaleimage[3].Be sidesthresholdscheme.arbitraryv… 相似文献
6.
A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out. 相似文献
7.
THRESHOLD SCHEMES WITH WEIGHTS 总被引:1,自引:0,他引:1
XIAOLiangliang LIUMulan 《系统科学与复杂性》2004,17(4):578-581
In this paper, we present the model of threshold schemes with weights as a natural generalization of Shamir's threshold scheme and show how to apply the model to construct secret sharing schemes by two examples. 相似文献
8.
9.
Cheng Yu 《系统工程与电子技术(英文版)》1996,(3)
APartialParallelAirportGateAssignmentSupportedbyaKnowledge-basedSystemCombinedwithMathematicalProgramming¥ChengYu(CenterforTr... 相似文献
10.
11.
针对现有的基于双线性对的安全机制都假设在整个Ad hoc网络生存期内系统都是安全的,而基于该假设的Ad hoc网络并不安全的问题。重新定义了Ad hoc网络的攻击者模型,对传统的主动秘密共享方案进行了扩充,提出了基于双线性对的Ad hoc网络主动秘密共享方案,周期性地更新系统私钥的影子和网络节点的私钥,以提高网络安全机制的安全性和鲁棒性,并对其安全性和鲁棒性进行证明。结论表明,基于双线性对的密码体制非常适合建立实用的、轻量级的Ad hoc网络的安全机制。 相似文献
12.
基于树状结构和移动Agent机制设计了一种新的秘密共事方案.分享者按其所在层次进行分组,每一组分享者可依据其持有的碎片恢复该组所共享的秘密.当每一组分享者均恢复出他们的秘密之后,这些新的秘密又可作为上一层分享者所持有的新的碎片,构成新一轮的秘密共享,由此形成秘密共享的树状结构.移动Agent机制将该结构动态化,从而使得秘密分享者在秘密恢复之前并不知道自己确切的分组,在更大程度上避免共享者的合谋,实现更安全的多阶段秘密共享. 相似文献
13.
提出了等级偏好占优关联系数的新概念, 在此基础上给出了多属性决策的等级偏好优序法. 等级偏好优序法克服了已有优序法的不足, 使各方案优劣的区分度更明显, 而且等级偏好优序法可以通过计算机编程进行实现, 从而可使等级偏好优序法在实际决策问题中发挥重要作用. 相似文献
14.
15.
采用典型多目标进化算法-NSGA-II对从任务角度进行抽象建模所得到的Agent联盟模型进行生成优化,并针对Agent联盟生成存在的特点,将Pareto最优概念与多目标优化相结合对NSGA-II算法进行改进,从而实现兼顾联盟收益、开销、时间约束等多个目标。仿真对比实验结果表明,算法运行一次可以获得多个Pareto最优解,为各个目标之间权衡分析提供了有效的工具,在满足性能要求下,可为联盟生成提供满足多个设计目标的全局优化方案,对联盟实际应用具有借鉴与应用价值。对联盟实际应用具有借鉴与应用价值。 相似文献
16.
Ren Yanying Zhang Wenjun & Yu SongyuInst. of Image Communication Information Processing Shanghai Jiaotong Univ. Shanghai P. R. China 《系统工程与电子技术(英文版)》2005,16(4)
1.INTRODUCTION DemandassignmentMACprotocolshavebeenusedin severalstandardizedwirelessnetworks.Itcaneffec tivelyutilizewirelessbandwidthofradiochannelsand supportlargenumbersofstations[1].Priorityaccess withshortdelayispreferredformultimediaapplica tions,suchasvoiceandvideotraffic.Longdelays andpoorservicequalitycouldoccurifthereisnopri oritybetweendifferenttypesoftraffic.Thepriority schemeinthereservationphaseofdemandassign mentMACprotocolisneeded,itcanhelprequestsof multimediatraffict… 相似文献
17.
基于一维细胞自动机和中国剩余定理提出了一个新的多秘密共享方案.该方案将多个秘密打包成一个大秘密,将其作为细胞自动机的一个初始配置;通过对细胞自动机进行反向迭代来重构所共享的秘密.分析表明,该方案实现简单,在计算上是安全的,并且是一个完善的方案. 相似文献
18.
企业中存在机会主义行为的原因及其影响 总被引:12,自引:0,他引:12
研究了经理行为中存在机会主义时的激励机制,并与不存在机会主义时的激励机制进行了比较.有且只有经理为风险中性时,所有者才能通过出租企业得到最大的利润,此时不存在机会主义行为.否则,机会主义行为的存在是不可避免的.该行为的存在使得所有者的所得少于不存在该行为时的所得,因此该行为是不利于所有者的行为.要从根本上消除该行为只能通过提高激励程度. 相似文献
19.