Book ChapterDOI
On-Line Secret Sharing
Christian Cachin
- pp 190-198
Reads0
Chats0
TLDR
A new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret, which provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly.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 locationread more
Citations
More filters
Proceedings ArticleDOI
Verifiable secret redistribution for archive systems
TL;DR: A new verifiable secret redistribution protocol for threshold sharing schemes that forms a key component of a proposed archival storage system that enables the dynamic addition or removal of shareholders, and also guards against mobile adversaries.
Patent
Systems and methods for distributing and securing data
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: In this paper, a robust computational secret sharing scheme that provides for the efficient distribution and subsequent recovery of a private data is disclosed, where a cryptographic key may be randomly generated and then shared using a secret sharing algorithm to generate a collection of key shares.
Proceedings ArticleDOI
Robust computational secret sharing and a unified account of classical secret-sharing goals
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: In this article, the authors give a unified account of classical secret sharing goals from a modern cryptographic vantage, including perfect, statistical, and computational secret sharing; static and dynamic adversaries; schemes with or without robustness; schemes where a participant recovers the secret and those where an external party does so.
Journal ArticleDOI
Space efficient secret sharing for implicit data security
Abhishek Parakh,Subhash Kak +1 more
TL;DR: This paper presents a k-threshold computational secret sharing technique that distributes a secret S into shares of size |S |k-1, where |S| denotes the secret size, and can be looked upon as a new information dispersal scheme that provides near optimal space efficiency.
Journal ArticleDOI
Research note: An on-line secret sharing scheme for multi-secrets
Ren-Junn Hwang,Chin-Chen Chang +1 more
TL;DR: An efficient, computationally secure on-line secret sharing scheme that provides great capabilities for many practical applications and is the same as that of the RSA cryptosystem and Shamir's (r,n)-threshold scheme.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Journal ArticleDOI
Password authentication with insecure communication
TL;DR: A method of user password authentication is described which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system.
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.