Nested multipartite secret sharing

dc.authorscopusid24490607700
dc.authorscopusid6603589033
dc.contributor.authorKaşkaloğlu, Kerem
dc.contributor.authorÖzbudak,F.
dc.contributor.otherMathematics
dc.date.accessioned2024-07-05T15:43:48Z
dc.date.available2024-07-05T15:43:48Z
dc.date.issued2011
dc.departmentAtılım Universityen_US
dc.department-tempKaskaloglu K., Department of Mathematics, Atilim University, Ankara, Turkey; Özbudak F., Department of Mathematics, Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkeyen_US
dc.descriptionIEEE Beijing Section; Pudong New Area Association for Computer; Pudong New Area Science and Technology Development Fund; Tongji University; Xiamen Universityen_US
dc.description.abstractQuite recently, Tassa introduced an ideal and perfect secret sharing scheme realizing conjunctive hierarchical threshold access structures motivated by the problem of sharing a private key among three employees of a bank, at least one of whom must be a department manager, for the purpose of signing an electronic funds transfer. We ask the natural question concerning What if there are two branches of banks that are needed to be involved in the signing process? In such a case, one might encounter the presence of two distinct hierarchies involved in the same access structure. In this paper, being motivated by such a sample scenario, we describe a new generalization, what we name nested multipartite access structures, which may involve the well-known compartmented or hierarchical access structures as substructures. The corresponding generic scheme we describe employs multivariate interpolation and is ideal, linear and perfect with probability 1 O(q1) on a finite field Fq. We describe the scheme in particular for the trivariate case as an example. Such an approach is hopefully useful not only for the initial motivating example, but also for a variety of interesting scenarios. In particular, we propose a non-nested generalization for the conventional compartmented access structures, which depicts a stronger way of controlling the additional t (t1 + + t m) participants. © 2011 IEEE.en_US
dc.identifier.citation0
dc.identifier.doi10.1109/CSAE.2011.5952805
dc.identifier.endpage73en_US
dc.identifier.isbn978-142448725-7
dc.identifier.scopus2-s2.0-80051899073
dc.identifier.startpage66en_US
dc.identifier.urihttps://doi.org/10.1109/CSAE.2011.5952805
dc.identifier.urihttps://hdl.handle.net/20.500.14411/3657
dc.identifier.volume4en_US
dc.language.isoenen_US
dc.relation.ispartofProceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011 -- 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011 -- 10 June 2011 through 12 June 2011 -- Shanghai -- 86066en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subject[No Keyword Available]en_US
dc.titleNested multipartite secret sharingen_US
dc.typeConference Objecten_US
dspace.entity.typePublication
relation.isAuthorOfPublication7c5c695f-055a-4ab0-8322-1c80e4df1360
relation.isAuthorOfPublication.latestForDiscovery7c5c695f-055a-4ab0-8322-1c80e4df1360
relation.isOrgUnitOfPublication31ddeb89-24da-4427-917a-250e710b969c
relation.isOrgUnitOfPublication.latestForDiscovery31ddeb89-24da-4427-917a-250e710b969c

Files

Collections