Universally Ideal Secret Sharing Schemes (Preliminary Version)

@inproceedings{Beimel1992UniversallyIS,
  title={Universally Ideal Secret Sharing Schemes (Preliminary Version)},
  author={Amos Beimel and Benny Chor},
  booktitle={CRYPTO},
  year={1992}
}
Given a set of parties 11,. . , . n } . an access structure is a ruonotone colleclioii of subsets of tlic parlies. For a certain domain of secrets. a secret sharing scLcuie lor an access st ructure is a method for a dealer to distribute shares to the parties, such that oiily subsets in the a.ccess structure call reconstruct the secret. A secret sharing scheme is idcal if the domains of the shares are the same as the domain of the secrets. An access structure is universally ideal i f thcrc is an… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Nisan

  • N J. ICilian
  • Private communication,
  • 1990

Rudich

  • S J.C. Benaloh ancl
  • Privatc communication,
  • 1989

J

  • E. D. Karriin
  • \ V . Greene, and h1.E. Hcllnian. On secret…
  • 1983

Saleguarding cryptographic keys

  • G. R. Blakley
  • Iri Proc. A FIPS
  • 1979

Similar Papers

Loading similar papers…