Nested multipartite secret sharing
dc.authorscopusid | 24490607700 | |
dc.authorscopusid | 6603589033 | |
dc.contributor.author | Kaşkaloğlu, Kerem | |
dc.contributor.author | Özbudak,F. | |
dc.contributor.other | Mathematics | |
dc.date.accessioned | 2024-07-05T15:43:48Z | |
dc.date.available | 2024-07-05T15:43:48Z | |
dc.date.issued | 2011 | |
dc.department | Atılım University | en_US |
dc.department-temp | Kaskaloglu K., Department of Mathematics, Atilim University, Ankara, Turkey; Özbudak F., Department of Mathematics, Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey | en_US |
dc.description | IEEE Beijing Section; Pudong New Area Association for Computer; Pudong New Area Science and Technology Development Fund; Tongji University; Xiamen University | en_US |
dc.description.abstract | Quite 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.citation | 0 | |
dc.identifier.doi | 10.1109/CSAE.2011.5952805 | |
dc.identifier.endpage | 73 | en_US |
dc.identifier.isbn | 978-142448725-7 | |
dc.identifier.scopus | 2-s2.0-80051899073 | |
dc.identifier.startpage | 66 | en_US |
dc.identifier.uri | https://doi.org/10.1109/CSAE.2011.5952805 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14411/3657 | |
dc.identifier.volume | 4 | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Proceedings - 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 -- 86066 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | [No Keyword Available] | en_US |
dc.title | Nested multipartite secret sharing | en_US |
dc.type | Conference Object | en_US |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | 7c5c695f-055a-4ab0-8322-1c80e4df1360 | |
relation.isAuthorOfPublication.latestForDiscovery | 7c5c695f-055a-4ab0-8322-1c80e4df1360 | |
relation.isOrgUnitOfPublication | 31ddeb89-24da-4427-917a-250e710b969c | |
relation.isOrgUnitOfPublication.latestForDiscovery | 31ddeb89-24da-4427-917a-250e710b969c |