Research note: An on-line secret sharing scheme for multi-secrets

Authors:
Ren-Junn Hwang;Chin-Chen Chang
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng Institute of Technology, Taoyuan, 335, Taiwan, ROC;Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, 621, Taiwan, ROC
Venue:
Computer Communications
Year:
1998

Citing 12
Cited 12

Fully dynamic secret sharing schemes

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secret sharing made short

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Contemporary Cryptology: The Science of Information Integrity

Contemporary Cryptology: The Science of Information Integrity
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Multi-Secret Sharing Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On-Line Secret Sharing

Proceedings of the 5th IMA Conference on Cryptography and Coding
Threshold Schemes with Disenrollment

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

A practical verifiable multi-secret sharing scheme

Computer Standards & Interfaces
An efficient threshold verifiable multi-secret sharing

Computer Standards & Interfaces
New efficient and practical verifiable multi-secret sharing schemes

Information Sciences: an International Journal
Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves

Computer Communications
A multisecret sharing scheme for color images based on cellular automata

Information Sciences: an International Journal
A verifiable multi-secret sharing scheme based on cellular automata

Information Sciences: an International Journal
Ideal secret sharing schemes with share selectability

ICICS'11 Proceedings of the 13th international conference on Information and communications security
A secure and efficient secret sharing scheme with general access structures

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

Wireless Personal Communications: An International Journal
Verifiable multi-secret sharing based on LFSR sequences

Theoretical Computer Science
A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure

Computers & Mathematics with Applications
Reversible secret image sharing with steganography and dynamic embedding

Security and Communication Networks

Quantified Score

Hi-index	0.25

Visualization

Abstract

An efficient, computationally secure on-line secret sharing scheme is proposed in this paper. It provides great capabilities for many practical applications. In this scheme, each participant shares many secrets with other participants by holding only one shadow. The shadows are as short as the shared secret. They are selected by the participants themselves. Each participant is allowed to check whether another participant provides the true information or not in the recovery phase. The shadows do not need to be changed when the shared secret is renewed, the access structure is altered, and/or old participants are deleted or new participants are added. The security of our scheme is the same as that of the RSA cryptosystem and Shamir's (r,n)-threshold scheme.