Providing Anonymity in Unconditionally Secure Secret Sharing Schemes

Authors:
Mida Guillermo;Keith M. Martin;Christine M. O'Keefe
Affiliations:
Ateneo de Manila University, Information Technology Institute, Rockwell Center, Makati City, Philippines midarg@mathsci.math.admu.edu.ph;Information Security Group, Royal Holloway, University of London, Egham, Surrey TW20 0EX, U.K. keith.martin@rhul.ac.uk;Department of Pure Mathematics, The University of Adelaide, SA 5005, Australia cokeefe@maths.adelaide.edu.au
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 7
Cited 2

A combinatorial approach to threshold schemes

SIAM Journal on Discrete Mathematics
Some improved bounds on the information rate of perfect secret sharing schemes

Journal of Cryptology
An explication of secret sharing schemes

Designs, Codes and Cryptography
Anonymous secret sharing schemes

Discrete Applied Mathematics
A Linear Construction of Secret Sharing Schemes

Designs, Codes and Cryptography
How to share a secret

Communications of the ACM
How to (Really) Share a Secret

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology

A scalable mutual authentication and key distribution mechanism in a NEMO environment

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
On partial anonymity in secret sharing

EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the concept of anonymity in an unconditionally secure secret sharing scheme, proposing several types of anonymity and situations in which they might arise. We present a foundational framework and provide a range of general constructions of unconditionally secure secret sharing schemes offering various degrees of anonymity.