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 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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing, The Proceedings of the Second Theory of Cryptography Conference, TCC 2005, MIT. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 600–619. Springer, Heidelberg (2005)
de Boor, C., Dyn, N., Ron, A.: Polynomial interpolation to data on flats in R d. Journal of Approximation Theory 105, 313–343 (2000)
Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 9, 105–113 (1989)
Chung, K.C., Yao, T.H.: On lattices admitting unique Lagrange interpolation. SIAM Journal on Numerical Analysis 14, 735–743 (1977)
M.J. Collins, A note on ideal tripartite access structures, available at http://eprint.iacr.org/2002/193/ (2002).
Fehr, S.: Efficient construction of the dual span program. In: Manuscript (May 1999)
Gál, A.: Combinatorial methods in Boolean function complexity, Ph.D. thesis, University of Chicago (1995)
Herranz, J., Sáez, G.: New results on multipartite access structures (2006), available at http://eprint.iacr.org/2006/048
Karchmer, M., Wigderson, A.: On span programs. In: The Proceedings of the 8th Structures in Complexity conference, pp. 102–111 (1993)
Padró, C., Sáez, G.: Secret sharing schemes with bipartite access structure. IEEE Transactions on Information Theory 46, 2596–2604 (2000)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Simmons, G.J.: How to (Really) Share a Secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390–448. Springer, Heidelberg (1990)
Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 473–490. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tassa, T., Dyn, N. (2006). Multipartite Secret Sharing by Bivariate Interpolation. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_25
Download citation
DOI: https://doi.org/10.1007/11787006_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35907-4
Online ISBN: 978-3-540-35908-1
eBook Packages: Computer ScienceComputer Science (R0)