ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Secret sharing schemes  (2)
  • Multiple secrets  (1)
Collection
Keywords
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    Ideal secret sharing schemes with multiple secrets (1996)
    Springer
    Journal of cryptology 9 (1996), S. 233-250 
    Details
    ISSN: 1432-1378
    Keywords: Ideal secret sharing schemes ; Multiple secrets ; Matroids
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00189262
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Construction for Multisecret Threshold Schemes (1996)
    Springer
    Designs, codes and cryptography 9 (1996), S. 287-303 
    Details
    ISSN: 1573-7586
    Keywords: Secret sharing schemes ; multiple secrets ; threshold schemes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A multisecret threshold scheme is a system that protects a number of secrets (or keys) among a group of participants, as follows. Given a set of n participants, there is a secret s K associated with each k–subset K of these participants. The scheme ensures that s K can be reconstructed by any group of t participants in K ( $$1 〈 t 〈 k$$ ). A lower bound has been established on the amount of information that participants must hold in order to ensure that any set of up to w participants $$(0 \leqslant w \leqslant n - k + t - 1)$$ cannot obtain any information about a secret with which they are not associated. In this paper, for parameters t=2 and w=n-k+t-1, we give a construction for multisecret threshold schemes that satisfy this bound.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1027380522085
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A construction for multisecret threshold schemes (1996)
    Springer
    Designs, codes and cryptography 9 (1996), S. 287-303 
    Details
    ISSN: 1573-7586
    Keywords: Secret sharing schemes ; multiple secrets ; threshold schemes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A multisecret threshold scheme is a system that protects a number of secrets (or keys) among a group of participants, as follows. Given a set of n participants, there is a secret s k associated with each k-subset K of these participants. The scheme ensures that s K can be reconstructed by any group of t participants in K (1 〈- t 〈- k). A lower bound has been established on the amount of information that participants must hold in order to ensure that any set of up to w participants K(1≤t≤k) cannot obtain any information about a secret with which they are not associated. In this paper, for parameters t=2 and w=n−k+t−1, we give a construction for multisecret threshold schemes that satisfy this bound.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00129770
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...