How to Build Robust Shared Control Systems

Authors:
Ross Anderson;Cunsheng Ding;Tor Helleseth;Torleiv Klove
Affiliations:
Computer Laboratory, Cambridge University, Pembroke Street, Cambridge, CB2 3QG, U.K.;Department of Information Systems and Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260;-;Department of Informatics, University of Bergen, HIB, N-5020 Bergen, Norway
Venue:
Designs, Codes and Cryptography
Year:
1998

Citing 6
Cited 5

Designs and their codes

Designs and their codes
Why cryptosystems fail

Communications of the ACM
The Ω key management service

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
On sharing secrets and Reed-Solomon codes

Communications of the ACM
How to share a secret

Communications of the ACM
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology

Secret Sharing Schemes with Nice Access Structures

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Covering and secret sharing with linear codes

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Secret sharing schemes from binary linear codes

Information Sciences: an International Journal
The optimal linear multi-secret sharing scheme for non-threshold access structure(student contribution)

Proceedings of the 4th international conference on Security of information and networks
Secret Sharing Schemes with Nice Access Structures

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previous researchers have designedshared control schemes with a view to minimising the likelihoodthat 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 thepolice can identify conspirators after the fact. This requirementleads 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 codeswhose dual [n,k,d] codes have d andn as their only nonzero weights are suitable. Wedetermine their access structures and analyse their properties.We have found almost all of them, and established some relationsamong codes, designs and secret-sharing schemes.