Book ChapterDOI
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
Koji Okada,Kaoru Kurosawa +1 more
- pp 33-41
Reads0
Chats0
TLDR
A general lower bound on ¦V i ¦ is presented, which includes the previous lower bounds for perfect SSs and nonperfect SSs as special cases and the optimum size of V i for a certain access hierarchy is determined.Citations
More filters
Book ChapterDOI
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
TL;DR: Wang et al. as discussed by the authors proposed a new (k,n)-threshold secret sharing scheme, which uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret.
Journal Article
Some basic properties of general nonperfect secret sharing schemes
Wakaha Ogata,Kaoru Kurosawa +1 more
TL;DR: It is shown that a compact NSS has some special access hierarchy and it is closely related to a matroid, which means that it meets the equalities of both the bounds and the entropy type bound.
Book ChapterDOI
Attacks on the HKM/HFX Cryptosystem
Xuejia Lai,Rainer A. Rueppel +1 more
TL;DR: The HKM / HFX cryptosystem is proposed for standardization at the ITU Telecommunication Standardization Sector Study Group 8 and is designed to provide authenticity and confidentiality of FAX messages at a commercial level of security.
Journal ArticleDOI
Strongly secure ramp secret sharing schemes for general access structures
TL;DR: In this article, it was shown that for any feasible general access structure, a strong ramp secret sharing (SS) scheme can be constructed from a partially decryptable ramp SS scheme, which can be considered as a kind of SS scheme with plural secrets.
Journal ArticleDOI
A Fast ( k , L , n )-Threshold Ramp Secret Sharing Scheme
TL;DR: This paper proposes a new (k, L, n)-threshold ramp secret sharing scheme which uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret at a low computational cost and shows that the fast ramp scheme is able to reduce each bit-size of shares by allowing some degradation of security similar to the existing ramp schemes based on Shamir's threshold scheme.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
Journal ArticleDOI
Secret sharing scheme realizing general access structure
TL;DR: This paper shows that by providing the trustees with several information data concerning the distributed information of the (k, n) threshold method, any access structure can be realized.
Book ChapterDOI
Generalized secret sharing and monotone functions
Josh Benaloh,Jerry Leichter +1 more
TL;DR: This paper will present general methods for constructing secret sharing schemes for any given secret sharing function using the set of monotone functions and tools developed for simplifying the latter set can be applied equally well to the former set.
Journal ArticleDOI
On secret sharing systems
TL;DR: A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a deterministic version of Blakley's probabilistic method.