Strongly secure ramp secret sharing schemes for general access structures

Iwamoto, Mitsugu; Yamamoto, Hirosuke

doi:10.1016/j.ipl.2005.09.012

Cited by 35 publications

(42 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Eventually, in (t, L, n) threshold ramp SSSs (RSSSs) introduced by Blackley [13], the secret cannot be reconstructed from t − L or less shares (vs. t − 1 or less in above SSSs), with 1 ≤ ≤ L−1 shares being allowed to leak information about the secret. Thus, RSSSs propose a tradeoff between security and efficiency (measured by entropy) [55]. Let H(d) and H(e i ) i=1,··· ,n be the entropy of the secret and its shares, respectively.…”

Section: Group 1: Classical Secret Sharing Schemesmentioning

confidence: 99%

“…Let H(d) and H(e i ) i=1,··· ,n be the entropy of the secret and its shares, respectively. In SSSs, H(e i ) ≥ H(d), while in RSSSs, H(e i ) = H(d) ÷ L. [55] also introduces the notion of strong and weak RSSSs, and shows that Shamir-based SSSs may be weak. Yet, most of the following RSSSs still extend Shamir's SSS.…”

Section: Group 1: Classical Secret Sharing Schemesmentioning

confidence: 99%

“…Next, u 1 , · · · , u max(m,t) , · · · , u w+n are reconstructed from t shares with the cellular automaton. Finally, all secrets are regenerated by Equation 55. [48].…”

Section: Group 4: Data-verifiable Secret Sharing Schemesmentioning

confidence: 99%

See 2 more Smart Citations

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud technologies. Various approaches, i.e., data encryption, anonymization, replication and verification, help enforce different facets of data security. Secret sharing is a particularly interesting cryptographic technique. Its most advanced variants indeed simultaneously enforce data privacy, availability and integrity, while allowing computation on encrypted data. The aim of this paper is thus to wholly survey secret sharing schemes with respect to data security, data access and costs in the pay-as-yougo paradigm.

show abstract

Section: Group 1: Classical Secret Sharing Schemesmentioning

confidence: 99%

Section: Group 1: Classical Secret Sharing Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

show abstract

“…However, we can modify the proposed scheme to strongly secure one that avoids such flaw of weakly secure schemes along with the technique proposed in [10]. Namely, the strongly secure CSCs can be obtained by applying Hilbert matrix to a vector of sub-keys to construct new sub-keys, the detail of which is omitted due to the space limitation.…”

Section: Key Construction Algorithmmentioning

confidence: 99%

A new model of Client-Server Communications under information theoretic security

Iwamoto

Omino

Komano

et al. 2014

2014 IEEE Information Theory Workshop (ITW 2014)

Self Cite

View full text Add to dashboard Cite

A new model for a Client-Server Communication (CSC) system satisfying information theoretic security is proposed, and its fundamental properties are discussed. Our CSC allows n users to upload their respective messages to a server securely by using symmetric key encryptions with their own keys, and all ciphertexts are decrypted by the server.If we require all messages to be perfectly secure in CSC against the corrupted clients and adversaries without any keys, it is proved that a one time pad or more inefficient encryption must be used for each communication link between a client and the server. This means that, in order to realize more efficient CSC, it is necessary to leak out some information of each message. Based on these observations, we introduce a new model for such a secure CSC formally, and discuss its fundamental properties. In addition, we propose the optimal construction of CSC under several constraints on security parameters called security rates.978-1-4799-5999-0/14/$31.00 ©2014 IEEE

show abstract

“…ramp SS, a share set is said to be forbidden if it has no information about secret, while it is said to be intermediate if it is neither qualified nor forbidden [5,14].…”

mentioning

confidence: 99%

Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields

Matsumoto¹

2019

Advances in Mathematics of Communications

View full text Add to dashboard Cite

The first construction of strongly secure quantum ramp secret sharing by Zhang and Matsumoto had an undesirable feature that the dimension of quantum shares must be larger than the number of shares. By using algebraic curves over finite fields, we propose a new construction in which the number of shares can become arbitrarily large for fixed dimension of shares.Keywords algebraic curve · quantum secret sharing · non-perfect secret sharing · ramp secret sharing · strong security PACS 03.67.Dd Mathematics Subject Classification IntroductionSecret sharing (SS) scheme encodes a secret into multiple shares being distributed to participants, so that only qualified sets of shares can reconstruct the secret perfectly [13]. The secret and shares are traditionally classical information [13], but now quantum secret and quantum shares can also be used [3,4,11].In perfect SS, if a set of shares is not qualified, that is, it cannot reconstruct the secret perfectly, then the set has absolutely no information about the secret. It is wellknown that the share sizes in perfect SS must be larger than or equal to that of the secret, both in classical and quantum cases. To overcome this inefficiency of storing shares, the ramp classical SS was proposed [1,8,14], which reduces the share sizes at the cost of allowing partial information leakage to non-qualified sets of shares. In

show abstract

Strongly secure ramp secret sharing schemes for general access structures

Cited by 35 publications

References 12 publications

Secret sharing for cloud data security: a survey

Secret sharing for cloud data security: a survey

A new model of Client-Server Communications under information theoretic security

Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields

Contact Info

Product

Resources

About