Multipartite secret sharing by bivariate interpolation

Tamir Tassa, Nira Dyn

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish
Pages (from-to)227-258
Number of pages32
JournalJournal of Cryptology
Issue number2
StatePublished - Apr 2009


  • Bivariate interpolation
  • Compartmented access structures
  • Hierarchical threshold access structures
  • Monotone span programs
  • Multipartite access structures
  • Secret sharing


Dive into the research topics of 'Multipartite secret sharing by bivariate interpolation'. Together they form a unique fingerprint.

Cite this