共查询到19条相似文献,搜索用时 203 毫秒
1.
2.
3.
门限体制是秘密共享体制中最基本的一类,其特点是简洁而实用.本文讨论了门限体制的拟阵结构,得到理想的多密门限体制存在的条件. 相似文献
4.
对于m阶循环群G和给定的存取结构 A,利用适合A 的拟阵在环Zm上的良好表示,给出了 A 为G-理想同态的判别算法. 相似文献
5.
6.
7.
8.
基于椭圆曲线密码体制,提出了一个新的可公开验证的多秘密共享方案。该方案中,参与者和分发者可同时产生各参与者的秘密份额,可同时防止分发者和参与者进行欺骗。在秘密恢复过程中,任何个体都能验证参与者是否拥有有效的子秘密,秘密恢复者可验证参与者是否提供了正确的秘密份额。每个参与者只需要维护一个秘密份额,就可以实现对多个秘密的共享。方案的安全性是基于椭圆曲线密码体制以及(t,n)门限秘密共享体制的安全性。 相似文献
9.
10.
11.
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. 相似文献
12.
Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is
divided into several parts and all participants in the same part play an equivalent role. In this work, the characterization
of ideal multipartite access structures is studied with all generality. Our results are based on the well-known connections
between ideal secret sharing schemes and matroids and on the introduction of a new combinatorial tool in secret sharing, integer polymatroids . 相似文献
13.
Strongly ideal secret sharing schemes 总被引:1,自引:0,他引:1
We define strongly ideal secret sharing schemes to be ideal secret sharing schemes in which certain natural requirements are
placed on the decoder. We prove an information-theoretic characterization of perfect schemes, and use it to determine which
access structures can be encoded by strongly ideal schemes. We also discuss a hierarchy of secret sharing schemes that are
more powerful than strongly ideal schemes. 相似文献
14.
Secure communication has become more and more important for system security. Since avoiding the use of encryption one by one can introduce less computation complexity, secret sharing scheme (SSS) has been used to design many security protocols. In SSSs, several authors have studied multipartite access structures, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Access structures realized by threshold secret sharing are the simplest multipartite access structures, i.e., unipartite access structures. Since Asmuth–Bloom scheme based on Chinese remainder theorem (CRT) was presented for threshold secret sharing, recently, threshold cryptography based on Asmuth–Bloom secret sharing were firstly proposed by Kaya et al. In this paper, we extend Asmuth–Bloom and Kaya schemes to bipartite access structures and further investigate how SSSs realizing multipartite access structures can be conducted with the CRT. Actually, every access structure is multipartite and, hence, the results in this paper can be seen as a new construction of general SSS based on the CRT. Asmuth–Bloom and Kaya schemes become the special cases of our scheme. 相似文献
15.
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 相似文献
16.
具有传递性质的接入结构上的秘密分享方案的构造 总被引:8,自引:0,他引:8
引入了具有传递性质的接入结构的概念,并给出一种构造具有这类接入结构的秘密分享方案的通用方法,该方法简捷易行.对要分享的一个秘密,不管一个参与者属于多少个最小合格子集,他只需保存一个秘密份额.而且用于分享多个秘密时,不需要增加分享者额外的信息保存量.因而优于已有的其他许多方法.文中还给出了实例以说明如何具体地构造具有这类接入结构的秘密分享方案. 相似文献
17.
Ideal secret sharing schemes with multiple secrets 总被引:6,自引:0,他引:6
We consider secret sharing schemes which, through an initial issuing of shares to a group of participants, permit a number of different secrets to be protected. Each secret is associated with a (potentially different) access structure and a particular secret can be reconstructed by any group of participants from its associated access structure without the need for further broadcast information. We consider ideal secret sharing schemes in this more general environment. In particular, we classify the collections of access structures that can be combined in such an ideal secret sharing scheme and we provide a general method of construction for such schemes. We also explore the extent to which the results that connect ideal secret sharing schemes to matroids can be appropriately generalized.The work of the second and third authors was supported by the Australian Research Council. 相似文献
18.
On the classification of ideal secret sharing schemes 总被引:13,自引:0,他引:13
In a secret sharing scheme a dealer has a secret key. There is a finite set P of participants and a set of subsets of P. A secret sharing scheme with as the access structure is a method which the dealer can use to distribute shares to each participant so that a subset of participants can determine the key if and only if that subset is in . The share of a participant is the information sent by the dealer in private to the participant. A secret sharing scheme is ideal if any subset of participants who can use their shares to determine any information about the key can in fact actually determine the key, and if the set of possible shares is the same as the set of possible keys. In this paper we show a relationship between ideal secret sharing schemes and matroids.This work was performed at the Sandia National Laboratories and was supported by the U.S. Department of Energy under Contract No. DE-AC04-76DP00789. 相似文献
19.
Secret sharing schemes from three classes of linear codes 总被引:1,自引:0,他引:1
Yuan J. Ding C. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(1):206-212
Secret sharing has been a subject of study for over 20 years, and has had a number of real-world applications. There are several approaches to the construction of secret sharing schemes. One of them is based on coding theory. In principle, every linear code can be used to construct secret sharing schemes. But determining the access structure is very hard as this requires the complete characterization of the minimal codewords of the underlying linear code, which is a difficult problem in general. In this paper, a sufficient condition for all nonzero codewords of a linear code to be minimal is derived from exponential sums. Some linear codes whose covering structure can be determined are constructed, and then used to construct secret sharing schemes with nice access structures. 相似文献