Unconditionally-Secure Robust Secret Sharing with Minimum Share Size

Jhanwar, Mahabir Prasad

doi:10.1007/978-3-642-39884-1_9

Cited by 13 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the description of (the random variable of) the public parameters is omitted below since existing works using public parameters such as Ref. [20] do not explicitly describe the public parameter in the security definition. Definition 5 (Security of (k 1 …”

Section: K N)-tr-ss (See Definition 1) D) Reconstruct With Time-sigmentioning

confidence: 99%

“…To achieve an optimal construction, we use the technique in Ref. [20]: In the phase Share, the dealer computes public parameters, and the public parameters are broadcasted to participants or else stored on a publicly accessible authenticated bulletin board. Although we have to disclose k 2 −k 1 elements in a finite field as a public parameter, each share can consist of only one element.…”

Section: Optimal (But Restricted * 8 ) Constructionmentioning

confidence: 99%

“…In Ref. [20], Jhanwar and SafaviNaini used this technique for reducing share sizes, and consequently they succeeded in constructing optimal share sizes. We note that although similar techniques that the dealer broadcasts several coefficients of the polynomial such as Refs.…”

Section: Optimal (But Restricted * 8 ) Constructionmentioning

confidence: 99%

“…Robust Timed-release Secret Sharing Schemes. Robust secret sharing schemes [11], [15], [20], [26] are secret sharing schemes secure against malicious modification of shares. Technically, suppose that at most ω (< n/2) participants are allowed to modify their own shares so that a reconstructor recovers a secret s , which is different from the original secret s, from all n shares.…”

Section: Extensionsmentioning

confidence: 99%

“…This technique is reasonable since public parameters are sometimes used in the context of secret sharing schemes such as Ref. [20].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Information-theoretically Secure Timed-release Secret Sharing Schemes

Watanabe

Shikata

2016

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:In modern cryptography, the secret sharing scheme is an important cryptographic primitive, and it is used in various situations. In this paper, timed-release secret sharing (TR-SS) schemes with information-theoretic security is first studied. TR-SS is a secret sharing scheme with the property that more than a threshold number of participants can reconstruct a secret by using their shares only when the time specified by a dealer has come. Specifically, in this paper we first introduce models and formalization of security for two kinds of TR-SS based on the traditional secret sharing scheme and information-theoretic timed-release security. We also derive tight lower bounds on the sizes of shares, time-signals, and entities' secret-keys required for each TR-SS scheme. In addition, we propose direct constructions for the TR-SS schemes. Each direct construction is optimal in the sense that the construction meets equality in each of our bounds, respectively. As a result, it is shown that timed-release security can be realized without any additional redundancy on the share size.

show abstract

Section: K N)-tr-ss (See Definition 1) D) Reconstruct With Time-sigmentioning

confidence: 99%

Section: Optimal (But Restricted * 8 ) Constructionmentioning

confidence: 99%

Section: Optimal (But Restricted * 8 ) Constructionmentioning

confidence: 99%