Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99304
DC FieldValue
dc.titleHow to Build Robust Shared Control Systems
dc.contributor.authorAnderson, R.
dc.contributor.authorDing, C.
dc.contributor.authorHelleseth, T.
dc.contributor.authorKløve, T.
dc.date.accessioned2014-10-27T06:02:44Z
dc.date.available2014-10-27T06:02:44Z
dc.date.issued1998
dc.identifier.citationAnderson, R.,Ding, C.,Helleseth, T.,Kløve, T. (1998). How to Build Robust Shared Control Systems. Designs, Codes, and Cryptography 15 (2) : 111-124. ScholarBank@NUS Repository.
dc.identifier.issn09251022
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99304
dc.description.abstractPrevious researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n, k, d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.
dc.sourceScopus
dc.subjectCryptography
dc.subjectDesigns
dc.subjectGeometric codes
dc.subjectSecret sharing
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleDesigns, Codes, and Cryptography
dc.description.volume15
dc.description.issue2
dc.description.page111-124
dc.description.codenDCCRE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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