Please use this identifier to cite or link to this item:
Title: How to Build Robust Shared Control Systems
Authors: Anderson, R.
Ding, C. 
Helleseth, T.
Kløve, T.
Keywords: Cryptography
Geometric codes
Secret sharing
Issue Date: 1998
Citation: Anderson, 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.
Abstract: Previous 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.
Source Title: Designs, Codes, and Cryptography
ISSN: 09251022
Appears in Collections:Staff Publications

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

Google ScholarTM


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