On-line Secret Sharing

Christian Cachin

Cryptography and Coding '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 1025, pp. 190–198, Dec 1995.

We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants. These capabilities are gained by storing additional authentic (but not secret) information at a publicly accessible location.

BibTeX Citation

@inproceedings{Cachin95,
    author       = {Christian Cachin},
    title        = {On-line Secret Sharing},
    editor       = {Colin Boyd},
    booktitle    = {Cryptography and Coding~'95},
    pages        = {190--198},
    series       = {Lecture Notes in Computer Science},
    volume       = {1025},
    year         = {1995},
    month        = {12},
    publisher    = {Springer-Verlag},
}