Extending Brickell–Davenport theorem to non-perfect secret sharing schemes

One important result in secret sharing is the Brickell–Davenport theorem: every ideal perfect secret sharing scheme defines a matroid that is uniquely determined by the access structure. We present a generalization of the Brickell–Davenport theorem to the general case, in which non-perfect schemes a...

Full description

Bibliographic Details

Published in:	Designs, codes, and cryptography Vol. 74; no. 2; pp. 495 - 510
Main Authors:	Farràs, Oriol, Padró, Carles
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2015
Subjects:	Circuits Coding and Information Theory Computer Science Cryptology Data Structures and Information Theory Discrete Mathematics in Computer Science Information and Communication Non-perfect secret sharing scheme 94A62 05B35 Secret sharing Matroid Polymatroid
ISSN:	0925-1022, 1573-7586
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!