loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Changlu Lin 1 ; Lein Harn 2 and Dingfeng Ye 3

Affiliations: 1 Graduate University of Chinese Academy of Sciences / Fujian Normal University / Beijing Municipal Commission of Education, China ; 2 University of Missouri-Kansas City, United States ; 3 Graduate University of Chinese Academy of Sciences, China

Keyword(s): Secret sharing, Verifiable secret sharing, Secret sharing homomorphism, t-consistency, Informationtheoretically secure.

Related Ontology Subjects/Areas/Topics: Cryptographic Techniques and Key Management ; Information and Systems Security ; Public Key Crypto Applications

Abstract: In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n, t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide a master secret jointly and divide each selected secret for others. A verifiable secret sharing (VSS) allows each shareholder to verify that all shares are t-consistent (i.e. every subset of t of the n shares defines the same secret). In this paper, we show that (t,n)-VSS and (n, t,n)-VSS proposed by Pedersen can only ensure that all shares are t-consistent; but shares may not satisfy the security requirements of secret sharing scheme. Then, we introduce a new notion of strong VSS. A strong VSS scheme can ensure that (a) all shares are t-consistent, and (b) all shares satisfy the security requ irements of secret sharing scheme. We propose two simple ways to convert Pedersen’s VSS schemes into strong VSS schemes, which are information-theoretically secure. We also prove that our proposed VSS schemes satisfy the strong verifiable property. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.226.254.255

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lin, C.; Harn, L. and Ye, D. (2009). INFORMATION-THEORETICALLY SECURE STRONG VERIFIABLE SECRET SHARING. In Proceedings of the International Conference on Security and Cryptography (ICETE 2009) - SECRYPT; ISBN 978-989-674-005-4; ISSN 2184-3236, SciTePress, pages 233-238. DOI: 10.5220/0002222402330238

@conference{secrypt09,
author={Changlu Lin. and Lein Harn. and Dingfeng Ye.},
title={INFORMATION-THEORETICALLY SECURE STRONG VERIFIABLE SECRET SHARING},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2009) - SECRYPT},
year={2009},
pages={233-238},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002222402330238},
isbn={978-989-674-005-4},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2009) - SECRYPT
TI - INFORMATION-THEORETICALLY SECURE STRONG VERIFIABLE SECRET SHARING
SN - 978-989-674-005-4
IS - 2184-3236
AU - Lin, C.
AU - Harn, L.
AU - Ye, D.
PY - 2009
SP - 233
EP - 238
DO - 10.5220/0002222402330238
PB - SciTePress