On-line secret sharing

46Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Cachin, C. (1995). On-line secret sharing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 190–198). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free