Abstract
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 belonging to the same compartment. We examine here three types of such access structures: two that were studied before, compartmented access structures and hierarchical threshold access structures, and a new type of compartmented access structures that we present herein. We design ideal perfect secret sharing schemes for these types of access structures that are based on bivariate interpolation. The secret sharing schemes for the two types of compartmented access structures are based on bivariate Lagrange interpolation with data on parallel lines. The secret sharing scheme for the hierarchical threshold access structures is based on bivariate Lagrange interpolation with data on lines in general position. The main novelty of this paper is the introduction of bivariate Lagrange interpolation and its potential power in designing schemes for multipartite settings, as different compartments may be associated with different lines or curves 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 Tassa (J. Cryptol. 20:237–264, 2007).
Article PDF
Similar content being viewed by others
References
A. Beimel, T. Tassa, E. Weinreb, Characterizing ideal weighted threshold secret sharing. SIAM J. Discrete Math., to appear. A preliminary version appeared in The Proceedings of the Second Theory of Cryptography Conference, TCC 2005, February 2005 (MIT), pp. 600–619
C. de Boor, N. Dyn, A. Ron, Polynomial interpolation to data on flats in ℝd. J. Approx. Theory 105, 313–343 (2000)
E.F. Brickell, Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105–113 (1989)
K.C. Chung, T.H. Yao, On lattices admitting unique Lagrange interpolation. SIAM J. Numer. Anal. 14, 735–743 (1977)
M.J. Collins, A note on ideal tripartite access structures. Available at http://eprint.iacr.org/2002/193/ (2002)
O. Farràs, J. Martí-Farré, C. Padró, Ideal multipartite secret sharing schemes, in Advances in Cryptology—EUROCRYPT 2007. LNCS, vol. 4515 (Springer, Berlin, 2007), pp. 448–465
S. Fehr, Efficient construction of the dual span program. Manuscript, May 1999
A. Gál, Combinatorial methods in Boolean function complexity. Ph.D. thesis, University of Chicago (1995)
J. Herranz, G. Sáez, New results on multipartite access structures. IEE Proc. Inf. Secur. 153, 153–162 (2006)
M. Karchmer, A. Wigderson, On span programs, in The Proceedings of the 8th Structures in Complexity Conference (1993), pp. 102–111
E.D. Karnin, J.W. Greene, M.E. Hellman, On secret sharing systems. IEEE Trans. Inf. Theory 29, 35–41 (1983)
M. Naor, B. Pinkas, Secure and efficient metering, in Advances in Cryptology—EUROCRYPT 98. LNCS, vol. 1403 (Springer, Berlin, 1998), pp. 576–590
C. Padró, G. Sáez, Secret sharing schemes with bipartite access structure. IEEE Tran. Inf. Theory 46, 2596–2604 (2000)
J. Schwartz, Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701–717 (1980)
A. Shamir, How to share a secret. Commun. ACM 22, 612–613 (1979)
G.J. Simmons, How to (really) share a secret, in Advances in Cryptology—CRYPTO 88. LNCS, vol. 403 (Springer, Berlin, 1990), pp. 390–448
T. Tassa, Hierarchical threshold secret sharing. J. Cryptol. 20, 237–264 (2007). An earlier version appeared in The Proceedings of the First Theory of Cryptography Conference, TCC 2004, February 2004 (MIT, Cambridge), pp. 473–490
R. Zippel, Probabilistic algorithms for spare polynomials, in Proceedings of Symbolic and Algebraic Computation, EUROSAM 79 (Marseille, 1979), pp. 216–226
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ronald Cramer
A preliminary version of this paper appeared in The Proceedings of ICALP 2006.
Rights and permissions
About this article
Cite this article
Tassa, T., Dyn, N. Multipartite Secret Sharing by Bivariate Interpolation. J Cryptol 22, 227–258 (2009). https://doi.org/10.1007/s00145-008-9027-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-008-9027-9