Multipartite Secret Sharing by Bivariate Interpolation

Given a set of participants that is partitioned into distinct compartments, a multipartite access structure is an access structure that does not distinguish between participants that belong to the same compartment. We examine here three types of such access structures – compartmented access structures with lower bounds, compartmented access structures with upper bounds, and hierarchical threshold access structures. We realize those access structures by ideal perfect secret sharing schemes that are based on bivariate Lagrange interpolation. The main novelty of this paper is the introduction of bivariate interpolation and its potential power in designing schemes for multipartite settings, as different compartments may be associated with different lines in the plane. In particular, we show that the introduction of a second dimension may create the same hierarchical effect as polynomial derivatives and Birkhoff interpolation were shown to do in [13]

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

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

[3]  Nira Dyn,et al.  Polynomial Interpolation to Data on Flats in Rd , 2000 .

[4]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[5]  Carles Padró,et al.  Ideal Multipartite Secret Sharing Schemes , 2007, EUROCRYPT.

[6]  Tamir Tassa,et al.  Hierarchical Threshold Secret Sharing , 2004, Journal of Cryptology.

[7]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[8]  Carles Padró,et al.  Secret sharing schemes with bipartite access structure , 2000, IEEE Trans. Inf. Theory.

[9]  Anna Gál,et al.  Combinatorial methods in boolean function complexity , 1995 .

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

[11]  Germán Sáez,et al.  New Results on Multipartite Access Structures , 2006, IACR Cryptol. ePrint Arch..

[12]  K. Chung,et al.  On Lattices Admitting Unique Lagrange Interpolations , 1977 .

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

[14]  Tamir Tassa,et al.  Characterizing Ideal Weighted Threshold Secret Sharing , 2005, TCC.

[15]  Tamir Tassa,et al.  Characterizing Ideal Weighted Threshold Secret Sharing , 2008, SIAM J. Discret. Math..

[16]  Moni Naor,et al.  Secure and Efficient Metering , 1998, EUROCRYPT.

[17]  Michael J. Collins.  A Note on Ideal Tripartite Access Structures , 2002, IACR Cryptol. ePrint Arch..

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.