1. Adelaide Research & Scholarship
  2. Schools and Disciplines
  3. School of Mathematical Sciences
  4. Mathematical Sciences publications
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/23828
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarwick, S.-
dc.contributor.authorJackson, W.-
dc.contributor.authorMartin, K.-
dc.contributor.authorO'Keefe, C.-
dc.date.issued2006-
dc.identifier.citationAustralasian Journal of Combinatorics, 2006; 36:123-132-
dc.identifier.issn1034-4942-
dc.identifier.issn2202-3518-
dc.identifier.urihttp://hdl.handle.net/2440/23828-
dc.description.abstractWe consider the problem of changing the parameters of an established ideal (k, n)-threshold scheme without the use of secure channels. We identify the parameters (k',n') to which such a scheme can be updated by means of a broadcast message and then prove a lower bound on the size of the relevant broadcast. The tightness of this bound is demonstrated by describing an optimal procedure for updating the parameters of an ideal scheme.-
dc.description.urihttp://ajc.math.auckland.ac.nz/volume_contents.php3?vol=36-
dc.language.isoen-
dc.publisherCentre for Discrete Mathematics and Computing-
dc.titleOptimal updating of ideal threshold schemes-
dc.typeJournal article-
dc.relation.grantARC-
pubs.publication-statusPublished-
dc.identifier.orcidBarwick, S. [0000-0001-9492-0323]-
dc.identifier.orcidJackson, W. [0000-0002-0894-0916]-
Appears in Collections:Aurora harvest 6
Mathematical Sciences publications

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.