Families of threshold schemes

Chris Charnes, Josef Pieprzyk, Rei Safavi-Naini

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

2 Citations (Scopus)

Abstract

The notion of families of ideal threshold schemes (ITS) is introduced, their properties and applications are investigated. We consider secret sharing schemes whose parameters can be adjusted. Our model is a threshold scheme family (TSF) whose threshold scheme parameters can be modified dynamically. Some applications of this model includes schemes which have disenrollment capability, and a scheme to resist cheating.

Original languageEnglish
Title of host publicationProceedings of 1994 IEEE International Symposium on Information Theory
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages499-499
Number of pages1
ISBN (Print)0780320158, 9780780320154
DOIs
Publication statusPublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Other

Other1994 IEEE International Symposium on Information Theory, ISIT 1994
CountryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint Dive into the research topics of 'Families of threshold schemes'. Together they form a unique fingerprint.

Cite this