Strong security of linear ramp secret sharing schemes with general access structures

Abstract A secret sharing scheme is a cryptographic technique to protect a secret from loss and leakage by dividing it into shares. A ramp secret sharing scheme can improve efficiency in terms of the information ratio by allowing partial information about the secret which is composed of several sub-secrets to leak out. The notion of strong security has been introduced to control the amount of information on every subset of the sub-secrets that unauthorized sets can obtain. However, there have been proposed few methods to construct strongly secure schemes for general access structures. Furthermore, all existing methods need strong assumptions, which lead to a loss of efficiency and a limitation of access structures. In this paper, we show that any ramp secret sharing scheme which is linear over a sufficiently large field can be transformed into a strongly secure scheme with the same access structure preserving the information ratio. Since our method only requires linearity, our strongly secure schemes can realize arbitrary access structures and achieve smaller information ratio than the previous schemes.

[1]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[2]  Chaoping Xing,et al.  Coding Theory: A First Course , 2004 .

[3]  Kaoru Kurosawa,et al.  Nonperfect Secret Sharing Schemes and Matroids , 1994, EUROCRYPT.

[4]  Umberto Martínez-Peñas,et al.  Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes , 2016, IEEE Transactions on Information Theory.

[5]  S. Tsujii,et al.  Nonperfect Secret Sharing Schemes , 1992, AUSCRYPT.

[6]  Carles Padró,et al.  On the optimization of bipartite secret sharing schemes , 2012, Des. Codes Cryptogr..

[7]  Richard A. Brualdi,et al.  Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley , 1983 .

[8]  Noboru Kunihiro,et al.  Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes , 2019, 2019 IEEE Information Theory Workshop (ITW).

[9]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[10]  Ryutaroh Matsumoto.  Strong Security of the Strongly Multiplicative Ramp Secret Sharing Based on Algebraic Curves , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Nishiara Mikihiko,et al.  Strongly Secure Secret Sharing Scheme with Ramp Threshold based on Shamir's Polynomial Interpolation Scheme , 2009 .

[12]  Germán Sáez,et al.  New results and applications for multi-secret sharing schemes , 2014, Des. Codes Cryptogr..

[13]  Mitsugu Iwamoto,et al.  Strongly secure ramp secret sharing schemes for general access structures , 2005, Inf. Process. Lett..

[14]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[15]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Carles Padró,et al.  Ideal Multipartite Secret Sharing Schemes , 2007, Journal of Cryptology.

[17]  Carles Padró,et al.  On the Information Ratio of Non-perfect Secret Sharing Schemes , 2017, Algorithmica.

[18]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[19]  Giovanni Di Crescenzo,et al.  Multi-Secret Sharing Schemes , 1994, CRYPTO.

[20]  Toru Fujiwara,et al.  Optimal Uniform Secret Sharing , 2019, IEEE Transactions on Information Theory.

[21]  Hirosuke Yamamoto,et al.  Secret sharing system using (k, L, n) threshold scheme , 1986 .

[22]  Barbara Masucci.  Sharing Multiple Secrets: Models, Schemes and Analysis , 2006, Des. Codes Cryptogr..

[23]  Douglas R. Stinson,et al.  Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[24]  Tomohiko Uyematsu,et al.  Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight , 2012, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[25]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[26]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[27]  Marten van Dijk,et al.  A General Decomposition Construction for Incomplete Secret Sharing Schemes , 1998, Des. Codes Cryptogr..

[28]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[29]  Suresh C. Kothari,et al.  Generalized Linear Threshold Scheme , 1985, CRYPTO.

[30]  Ryutaroh Matsumoto,et al.  Optimal multiple assignment scheme for strongly secure ramp secret sharing schemes with general access structures , 2015 .

[31]  Mitsugu Iwamoto,et al.  Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[32]  Kaoru Kurosawa,et al.  Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes , 1994, ASIACRYPT.