共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
可防止欺诈的动态秘密分享方案 总被引:25,自引:0,他引:25
基于有限域上离散对数难解问题提出一个计算安全的动态秘密分享方案 ,本方案有效地解决了密钥的翻新与复用问题 ,其效率高且实用 ,特别是能检测伪子密 ,防止欺诈 ,且数据利用率较高。 相似文献
3.
4.
一个可防止欺诈的秘密分享方案 总被引:10,自引:0,他引:10
本文利用认证码构造一种可防止欺诈的秘密分享方案,此方案不仅可防止非法者的假冒,也可阻止子密合法拥有者的欺诈,特别是可防止某些子密合法拥有者形成团伙对另一合法者的欺诈,且数据利用率较高。 相似文献
5.
一个可防止欺诈的秘密分享方案 总被引:1,自引:0,他引:1
本文利用认证码构造一种可防止欺诈的秘密分享方案。此方案不仅可防止非法者的假冒,也可防止子密合法拥有者的欺诈,特别是可防止某些子密合法拥有者形成团伙对另一合法者的欺诈,且数据利用率较高。 相似文献
6.
7.
针对一般秘密共享方案或可验证秘密共享方案存在的缺点,结合椭圆曲线上双线性对性质扣运用双线性Diffie-Hellman问题,构造了一个基于双线性对的无可信中心可验证秘密共享方案。在该方案中,共享秘密S是素数阶加法群G。上的一个点,在秘密分发过程中所广播的承诺C,是与双线性有关的值。利用双线性对的双线性就可以实现共享秘密的可验证性,有效地防止参与者之间的欺诈行为,而不需要参与者之间执行复杂的交互式证明,因而该方案避免了为实现可验证性而需交互大量信息的通信量和计算量,通信效率高,同时该方案的安全性等价于双线性Diffie-Hellman假设的困难性。 相似文献
8.
9.
10.
11.
Yu-Chi Chen Du-Shiau Tsai Gwoboa Horng 《Journal of Visual Communication and Image Representation》2012,23(8):1225-1233
Visual cryptography (VC), first presented by Naor and Shamir, is a variant of secret sharing, thus it also called visual secret sharing. It can be widely used in many applications such as encrypting large data efficiently. In the literature, the problem of cheating is under consideration in secret sharing. Recently, Horng et al. pointed out that cheating is possible in k-out-of-n VC schemes, and presented two kinds of the cheating prevention schemes for protecting honest participants. One of them is the authentication based cheating prevention scheme. In this paper, we analyze the definition of cheating prevention and propose a new authentication based cheating prevention scheme. This scheme is constructed with Naor–Shamir’s VC scheme. Finally, we give the security analysis to prove that the proposed scheme is immune to cheating. 相似文献
12.
《Journal of Visual Communication and Image Representation》2014,25(7):1543-1557
Visual secret sharing, or the so-called visual cryptography, is a well-known scheme that encrypts a secret image into several meaningless share images, usually printed on transparencies, and decrypts as stacking some or all share images by the human visual system. More and more researches about visual secret sharing and its applications have been recently proposed. Unfortunately, the cheating attack in which malicious participants cheat the honest one(s) by forging a fake share image has existed. Since 2006, some cheating prevention schemes have been proposed but suffered from one or more disadvantages as follows: (1) maintaining extra share images used to verify the integrity of a share image prior to stacking, (2) introducing extra pixel expansion, (3) raising heavy computation cost, and (4) giving ambiguous cheating detection. In this paper, a multi-factor cheating–preventing scheme, aiming at exploiting the hybrid codebook to hide the additional verification images into the share images, has been proposed without suffering the above-mentioned deficiencies. Two-factor cheating–detection exploits the design of verification to both share images and stacked results to deter attackers’ cheating. The experimental results demonstrate the proposed scheme is feasible. 相似文献
13.
14.
In this paper, we propose a new approach for rational secret sharing in game theoretic settings. The trusted center is eliminated in the secret reconstruction phase. Every player doesn’t know current round is real round or fake round. The gain of following the protocol is more than the gain of deviating, so rational player has an incentive to abide the protocol. Finally, every player can obtain the secret fairly. Our scheme is verifiable and any player’s cheating can not work. Furthermore the proposed scheme is immune to backward induction and satisfies resilient equilibrium. No player of the coalition C can do better, even if the whole coalition C cheats.Our scheme can withstand the conspiracy attack with at most m-1 players. 相似文献
15.
16.
Authentication theory and hypothesis testing 总被引:3,自引:0,他引:3
Maurer U.M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2000,46(4):1350-1356
By interpreting message authentication as a hypothesis testing problem, this paper provides a generalized treatment of information-theoretic lower bounds on an opponent's probability of cheating in one-way message authentication. We consider the authentication of an arbitrary sequence of messages, using the same secret key shared between sender and receiver. The adversary tries to deceive the receiver by forging one of the messages in the sequence. The classical two types of cheating are considered, impersonation and substitution attacks, and lower bounds on the cheating probability for any authentication system are derived for three types of goals the adversary might wish to achieve. These goals are: (1) that the fraudulent message should be accepted by the receiver, or, in addition, (2) that the adversary wishes to know or (3) wants to even choose the value of the plaintext message obtained by the legitimate receiver after decoding with the secret key 相似文献
17.
提出一种基于椭圆曲线加密的非交互式零知识证明协议,并基于该证明协议提出一个可公开验证的密钥共享方案.在该方案中,密钥和密钥份额被嵌入椭圆曲线的点上,任何人均可对密钥和密钥份额进行验证,只有合法参与者集合可恢复出密钥,但无法知道密钥的具体内容;这样有效阻止了攻击者窃取密钥,也防止了数据的误发和成员之间的欺诈,更有利于密钥的复制与更新. 相似文献
18.
19.
1 Introduction(k ,n) thresholdschemesare proposedbyBlakley[1 ] andShamir[2 ] respectively .Assoonastheywereproposed ,theywerepaidattentiontobe causeoftheirimportantusesinmanyaspectssuchaskeymanagementinsecrecycommunication ,securitycalculation ,datasecurity ,securitymanagementoffinancenet,etc .[3~ 1 0 ] A (k,n) thresholdsecrecysharingschemeisasfollows:Dividingagivensecretsintonsharessuchthat( 1 )knowingkormoresharesonecanobtains;and( 2 )knowingk- 1orfewsharesonecannotde termines.LetP ={P… 相似文献