Efficient (n, t, n) secret sharing schemes

Authors:
Yan-Xiao Liu;Lein Harn;Ching-Nung Yang;Yu-Qing Zhang
Affiliations:
Key Lab of Computer Networks and Information Security of Ministry of Education, Xidian University, China;CSEE Department, University of Missouri-Kansas City, USA;Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan;Key Lab of Computer Networks and Information Security of Ministry of Education, Xidian University, China and National Computer Network Intrusion Protection Center, GUCAS, China
Venue:
Journal of Systems and Software
Year:
2012

Citing 13
Cited 0

Security of ramp schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
A protocol to set up shared secret schemes without the assistance of mutually trusted party

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to share a secret

Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A practical verifiable multi-secret sharing scheme

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

Information Sciences: an International Journal
Verifiable secret sharing and achieving simultaneity in the presence of faults

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A practical scheme for non-interactive verifiable secret sharing

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A threshold cryptosystem without a trusted party

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Perfectly-secure MPC with linear communication complexity

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Strong (n,t,n) verifiable secret sharing scheme

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Harn and Lin introduced a notion of strong t-consistency of a (t, n) secret sharing scheme and proposed a strong (n, t, n) verifiable secret sharing (VSS). In this paper, we propose a strong (n, t, n) VSS which is more efficient than Harn and Lin's VSS. Using the same approach, we propose a (n, t, n) multi-secret sharing scheme (MSS) to allow shareholders to share n-t+1 secrets. Also, the proposed (n, t, n) MSS can be modified to include the verifiable feature. All proposed schemes are unconditionally secure and are based on Shamir's (t, n) secret sharing scheme.