共查询到20条相似文献,搜索用时 0 毫秒
1.
On Matroid Characterization of Ideal Secret Sharing Schemes 总被引:3,自引:0,他引:3
Jovan Dj. Golic 《Journal of Cryptology》1998,11(2):75-86
A characterization of ideal secret sharing schemes with an arbitrary number of keys is derived in terms of balanced maximum-order
correlation immune functions. In particular, it is proved that a matroid is an associated matroid for a binary ideal secret
sharing scheme if and only if it is representable over the binary field. Access structure characterization of connected binary
ideal schemes is established and a general method for their construction is pointed out.
Received 16 April 1993 and revised 10 October 1996 相似文献
2.
利用矩阵特征值的特性,该文提出新的无可信中心的秘密共享方案。该方案无需可信中心的参与,每个参与者提供相同的秘密份额(列向量),在黑盒子中协同产生各自的秘密份额,从而避免可信中心的权威欺骗。所有参与者提供的列向量组成一个可逆矩阵 P ,可逆矩阵 P 和对角矩阵${Λ}$生成一个矩阵 M ,并将该矩阵正交化的单位特征向量,作为子密钥分发给各参与者。由于同一个集合的参与者所对应的特征值是相同的,该方案可以有效地防止成员之间的恶意欺诈行为。分析结果表明,该方案是可行的、安全的。 相似文献
3.
4.
5.
6.
7.
可公开验证的动态秘密分享机制 总被引:2,自引:2,他引:0
基于背包公钥密码体制,提出了一个公开可验证的动态秘密分享方式.此秘密分享方式中每个分享者的子秘密可以重复使用;特别地,它能在恢复秘密的过程中及时地检查出不诚实者. 相似文献
8.
基于椭圆曲线密码体制的动态秘密共享方案 总被引:15,自引:2,他引:15
文章给出了一个基于椭圆曲线公钥密码体制的动态秘密共享方案,有效地解决了共享秘密的动态更新,子密钥动态分配和欺诈问题,且易于实现,效率高。方案的安全性基于求解有限域上椭圆曲线离散对数的困难性。 相似文献
9.
对于m阶循环群G和给定的存取结构 A,利用适合A 的拟阵在环Zm上的良好表示,给出了 A 为G-理想同态的判别算法. 相似文献
10.
11.
12.
13.
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. 相似文献
14.
牛冬梅 《信息安全与通信保密》2009,(8):72-73
文献[2]中提出了一种基于异或(XOR)操作的彩色图像秘密共享(2,n)方案,简单易于实现,但恢复密图的效果较差。通过分析此方案,文章提出一个多分存的彩色图像秘密共享(2,n)方案,通过给用户增加分存图像的方法改善了恢复密图的质量。实验分析表明所提方案不仅取得了很好的恢复效果,而且保持了安全性和算法的简单性。 相似文献
15.
16.
Given a set of participants that is partitioned into distinct compartments, a multipartite access structure is an access structure
that does not distinguish between participants belonging to the same compartment. We examine here three types of such access
structures: two that were studied before, compartmented access structures and hierarchical threshold access structures, and
a new type of compartmented access structures that we present herein. We design ideal perfect secret sharing schemes for these
types of access structures that are based on bivariate interpolation. The secret sharing schemes for the two types of compartmented
access structures are based on bivariate Lagrange interpolation with data on parallel lines. The secret sharing scheme for
the hierarchical threshold access structures is based on bivariate Lagrange interpolation with data on lines in general position.
The main novelty of this paper is the introduction of bivariate Lagrange interpolation and its potential power in designing
schemes for multipartite settings, as different compartments may be associated with different lines or curves in the plane.
In particular, we show that the introduction of a second dimension may create the same hierarchical effect as polynomial derivatives
and Birkhoff interpolation were shown to do in Tassa (J. Cryptol. 20:237–264, 2007).
A preliminary version of this paper appeared in The Proceedings of ICALP 2006. 相似文献
17.
自A.Shamir和G.R.Blakley于1979年各自独立地提出“秘密共享”的思想及方法以后,现已出现了多种秘密共享方案。这些方案可适应不同的环境要求,然而,这些方案都是在域上建立的,当所面临问题的背景结构不构成域时会遇到麻烦。本文提出了一种新的秘密共享方案,该方案直接在整数环Z上实现,不需要对环Z作任何扩张,因而具有较高的有效性。其安全性基于Hash函数的安全性和大整数分解的难解性。 相似文献
18.
Ad-hoc networks are peer-to-peer self- organized networks that make possible the communication between nodes located in areas,
where communication infrastructure is absent or difficult to implement. For such networks, security is a crucial issue, since
the wireless medium is vulnerable to various attacks. A centralized solution can be easily compromised, leaving the nodes
exposed to threats originating from malicious users. In this paper, a security design for Ad-hoc networks is proposed and
studied, providing authentication to the nodes that follow the principles of threshold secret sharing. 相似文献
19.
具有传递性质的接入结构上的秘密分享方案的构造 总被引:8,自引:0,他引:8
引入了具有传递性质的接入结构的概念,并给出一种构造具有这类接入结构的秘密分享方案的通用方法,该方法简捷易行.对要分享的一个秘密,不管一个参与者属于多少个最小合格子集,他只需保存一个秘密份额.而且用于分享多个秘密时,不需要增加分享者额外的信息保存量.因而优于已有的其他许多方法.文中还给出了实例以说明如何具体地构造具有这类接入结构的秘密分享方案. 相似文献
20.
Let ℱ
n
be a monotone, nontrivial family of sets over {1, 2, …,n}. An ℱ
n
perfect secret-sharing scheme is a probabilistic mapping of a secret ton shares, such that:
Various secret-sharing schemes have been proposed, and applications in diverse contexts were found. In all these cases the
set of secrets and the set of shares are finite. 相似文献
• | The secret can be reconstructed from any setT of shares such thatT ∈ ℱ n . |
• | No subsetT ∉ ℱ n of shares reveals any partial information about the secret. |