article

A new multi-stage secret sharing scheme using one-way function

Authors:

Min-Shiang Hwang,

Wei-Pang YangAuthors Info & Claims

ACM SIGOPS Operating Systems Review, Volume 39, Issue 1

Pages 48 - 55

https://doi.org/10.1145/1044552.1044557

Published: 01 January 2005 Publication History

Abstract

He and Dawson proposed a multi-stage secret sharing scheme based on one-way function. In that scheme, many secrets are reconstructed stage-by-stage in the dealer's predetermined order, and only one secret shadow is kept by every participant. When all the secrets have been reconstructed, the dealer needs not redistribute fresh shadows to every participant. Later, Harn further improved the He-Dawson scheme to reduce the total number of public values. However, in this paper, we will show that both the He-Dawson scheme and Harn's scheme are one-time-use schemes and that many secrets cannot in fact be reconstructed stage-by-stage. At the same time, we shall also modify the He-Dawson scheme to improve the drawbacks above and show the improved scheme can be applied.

References

[1]

G. R. Blakley. Safeguarding cryptographic keys. In AFIPES 1797 Natl. Comput. Conf., volume 48, pages 165--172, New York, 1979.

[2]

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. In Advances in Cryptology, CRYPTO'93, pages 110--125, 1994.

Digital Library

[3]

C. C. Chang and R. J. Hwang. Efficient cheater identification method for threshold schemes. IEE Proc. Comput. Digit. Tech., 144(1):23--27, 1996.

[4]

Ting-Yi Chang, Chou-Chen Yang, and Min-Shiang Hwang. Threshold untraceable signature for group communications. IEE Proceedings - Communications, accepted (July 26, 2003) and to appear.

[5]

Ting-Yi Chang, Chou-Chen Yang, and Min-Shiang Hwang. Threshold signature for group communications without shared distribution center. Future Generation Computer Systems, accepted (June 20, 2003) and to appear.

Digital Library

[6]

Hung-Yu Chien, Jinn-Ke Jan, and Yuh-Min Tseng. A practical (t, n) multi-secret sharing scheme. IEICE TRANS. FUNDAMENTALS, E83-A(12):2762--2765, DECEMBER 2000.

[7]

L. Harn. Comment: Multistage secret sharing based on one-way function. Electronics Letters, 31(4):262, 1995.

[8]

L. Harn. Efficient sharing (broadcasting) of multiple secret. Proc. IEE-Comput. Digit. Tech., 142(3):237--240, May 1995.

[9]

L. Harn, T. Hwang, C. Laih, and J. Lee. Dynamic threshold scheme based on the definition of cross-product in a n-dimensional linear space. In Advances in Cryptology, Eurocrypt'89, pages 286--298, 1990.

Digital Library

[10]

J. He and E. Dawson. Multistage secret sharing based on one-way function. Electronics Letters, 30(19):1591--1592, 1994.

[11]

J. He and E. Dawson. Multisecret-sharing scheme based on one-way function. Electronics Letters, 31(2):93--95, 1995.

[12]

Min-Shiang Hwang, Chin-Chen Chang, and Kuo-Feng Hwang. An ElGamal-like cryptosystem for enciphering large messages. IEEE Transactions on Knowledge and Data Engineering, 14(2):445--446, 2002.

Digital Library

[13]

Min-Shiang Hwang, Cheng-Chi Lee, and Ting-Yi Chang. Broadcasting cryptosystem in computer networks using geometric properties of lines. Journal of Information Science and Engineering, 18(3):373--378, 2002.

[14]

Min-Shiang Hwang, Cheng-Chi Lee, and Eric Jui-Lin Lu. Cryptanalysis of the batch verifying multiple DSA-type digital signatures. Pakistan Journal of Applied Sciences, 1(3):287--288, 2001.

[15]

R. J. Hwang, W. B. Lee, and C. C. Chang. A concept of designing cheater identification methods for secret sharing. The Journal of Systems and Software, 46(1):7--11, 1999.

Digital Library

[16]

Wen-Ai Jackson, Keith M. Martin, and Christine M. O'Keefe. On sharing many secrets. Asiacrypt'94, pages 42--54, 1994.

Digital Library

[17]

National Institute of Satndards and Technology (NIST). The digital sinature standard proposed by NIST. Communications of the ACM, 35(7):36--40, 1992.

Digital Library

[18]

T. P. Pedersen. Non-interactive and information-theoretic verifiable secret sharing. In Advances in Cryptology, CRYPTO'91, pages 129--140, 1991.

Digital Library

[19]

T. P. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology, CRYPTO'91, pages 522--526, 1991.

[20]

A. Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, 1979.

Digital Library

[21]

H. U. Sun and S. P. Shieh. On dynamic threshold schemes. Information Processing Letters, 52(4):201--206, 1994.

Digital Library

[22]

T. C. Wu and T. S. Wu. Cheating detection and cheater identification in secret shairng schemes. IEE Proc. Comput. Digit. Tech., 142(5):367--369, 1995.

[23]

Chou-Chen Yang, Ting-Yi Chang, and Min-Shiang Hwang. A (t, n) multi-secret sharing scheme. Applied Mathematics And Computation, accepted (March 31, 2003) and to appear.

Cited By

Chattopadhyay ASaha SNag ANandi S(2024)Secret sharing: A comprehensive survey, taxonomy and applicationsComputer Science Review10.1016/j.cosrev.2023.10060851(100608)Online publication date: Feb-2024
https://doi.org/10.1016/j.cosrev.2023.100608
Kumar RPadhye S(2023)A Lattice-Based Single-Share Secret Sharing SchemeSN Computer Science10.1007/s42979-023-02274-24:6Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1007/s42979-023-02274-2
Kumar RPadhye S(2023)Cryptanalysis of Lattice-Based Threshold Changeable Multi-secret Sharing SchemeCryptology and Network Security with Machine Learning10.1007/978-981-99-2229-1_10(99-107)Online publication date: 18-Oct-2023
https://doi.org/10.1007/978-981-99-2229-1_10
Show More Cited By

Index Terms

A new multi-stage secret sharing scheme using one-way function

Recommendations

A Secret Sharing Scheme with the Changeable Threshold Value
IEEC '09: Proceedings of the 2009 International Symposium on Information Engineering and Electronic Commerce

In this paper, we investigate the problem of increasing the threshold value of the Shamir’s ( )–threshold scheme without the dealer’s helps, and present a new secret sharing scheme with the threshold value increasing. In this scheme, the dealer needs ...
A (t,n) multi-secret sharing scheme

In the (t,n) multi-secret sharing scheme, there are n participants in the system. At least t or more participants can easily pool their secrets shadows and reconstruct p secrets at the same time. Chien et al. [IEICE Trans. Fundamentals E83-A (2000) 2762]...
A simple (v, t, n)-fairness secret sharing scheme with one shadow for each participant
WISM'11: Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I

Secret sharing scheme is an important method to share secrets among all participants. Though there are many secret sharing schemes proposed, however, most of the schemes are unfair. For a fair secret sharing scheme, even if there are participants are ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review

ACM SIGOPS Operating Systems Review Volume 39, Issue 1

January 2005

93 pages

ISSN:0163-5980

DOI:10.1145/1044552

Issue’s Table of Contents

Copyright © 2005 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2005

Published in SIGOPS Volume 39, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
861
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chattopadhyay ASaha SNag ANandi S(2024)Secret sharing: A comprehensive survey, taxonomy and applicationsComputer Science Review10.1016/j.cosrev.2023.10060851(100608)Online publication date: Feb-2024
https://doi.org/10.1016/j.cosrev.2023.100608
Kumar RPadhye S(2023)A Lattice-Based Single-Share Secret Sharing SchemeSN Computer Science10.1007/s42979-023-02274-24:6Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1007/s42979-023-02274-2
Kumar RPadhye S(2023)Cryptanalysis of Lattice-Based Threshold Changeable Multi-secret Sharing SchemeCryptology and Network Security with Machine Learning10.1007/978-981-99-2229-1_10(99-107)Online publication date: 18-Oct-2023
https://doi.org/10.1007/978-981-99-2229-1_10
Eslamia KBahramiana M(2022)An isogeny-based quantum-resistant secret sharing schemeFilomat10.2298/FIL2210249E36:10(3249-3258)Online publication date: 2022
https://doi.org/10.2298/FIL2210249E
Mashhadi S(2020)Toward a formal proof for multi-secret sharing in the random oracle modelInformation Security Journal: A Global Perspective10.1080/19393555.2020.1766603(1-6)Online publication date: 21-May-2020
https://doi.org/10.1080/19393555.2020.1766603
Pilaram HEghlidos TToluee R(2020)An efficient lattice‐based threshold signature scheme using multi‐stage secret sharingIET Information Security10.1049/ise2.1200715:1(98-106)Online publication date: 28-Dec-2020
https://doi.org/10.1049/ise2.12007
Chanu ONeelima A(2020)A new multi-secret image sharing scheme based on DCTThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-019-01703-936:5(939-950)Online publication date: 1-May-2020
https://dl.acm.org/doi/10.1007/s00371-019-01703-9
Chen DLu WXing WWang N(2019)An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different StagesIEEE Access10.1109/ACCESS.2019.29290907(107104-107110)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2929090
Mashhadi S(2019)A CSA-Secure Multi-Secret Sharing Scheme in the Standard ModelJournal of Applied Security Research10.1080/19361610.2019.1696607(1-12)Online publication date: 3-Dec-2019
https://doi.org/10.1080/19361610.2019.1696607
Lin CYan XNiu QHu H(2019)Cheating immune multi-secret sharing without predefined order of secretsJournal of the Chinese Institute of Engineers10.1080/02533839.2018.1537806(1-5)Online publication date: 29-Jan-2019
https://doi.org/10.1080/02533839.2018.1537806
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents