Universally ideal secret sharing schemes (Preliminary version)

Amos Beimel, Benny Chor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


Given a set of parties {1,….n}, an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret sharing scheme for an access structure is a method for a dealer to distribute shares to the parties, such that only subsets in the access structure can reconstruct the secret. A secret sharing scheme is ideal if the domains of the shares are the same as the domain of the secrets. An access structure is universally ideal if there is an ideal secret sharing scheme for it over every finite domain of secrets. An obvious necessary condition for an access structure to be universally ideal is to be ideal over the binary and ternary domains of secrets. In this work, we prove that this condition is also sufficient. In addition, we give an exact characterization for each of these two conditions, and show that each condition by itself is not sufficient for universally ideal access structures.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1992 - 12th Annual International Cryptology Conference, Proceedings
EditorsErnest F. Brickell
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540573401
StatePublished - 1992
Externally publishedYes
Event12th Annual International Cryptology Conference, CRYPTO 1992 - Santa Barbara, United States
Duration: 16 Aug 199220 Aug 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume740 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th Annual International Cryptology Conference, CRYPTO 1992
Country/TerritoryUnited States
CitySanta Barbara

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Universally ideal secret sharing schemes (Preliminary version)'. Together they form a unique fingerprint.

Cite this