Multipartite secret sharing by bivariate interpolation

Tamir Tassa, Nira Dyn

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים


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

שפה מקוריתאנגלית
כותר פרסום המארחAutomata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings
מוציא לאורSpringer Verlag
מספר עמודים12
מסת"ב (מודפס)3540359079, 9783540359074
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2006
אירוע33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Venice, איטליה
משך הזמן: 10 יולי 200614 יולי 2006

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
כרך4052 LNCS
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349


כנס33rd International Colloquium on Automata, Languages and Programming, ICALP 2006

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Multipartite secret sharing by bivariate interpolation'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי