Optimal Shadow Allocations of Secret Sharing Schemes Arisen from the Dynamic Coloring of Extended Neighborhood Coronas

Raúl M. Falcón, Nagaraj Mohanapriya and Venkitachalam Aparna
Additional contact information
Raúl M. Falcón: Department Applied Mathematics I, School of Architecture, Universidad de Sevilla, 41012 Sevilla, Spain
Nagaraj Mohanapriya: PG and Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore 641029, Tamil Nadu, India
Venkitachalam Aparna: PG and Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore 641029, Tamil Nadu, India

Mathematics, 2022, vol. 10, issue 12, 1-14

Abstract: Every t -dynamic proper n -coloring of a graph G describes a shadow allocation of any ( n , t + 1 ) -threshold secret sharing scheme based on G , so that, after just one round of communication, each participant can either reconstruct the secret, or obtain a different shadow from each one of his/her neighbors. Thus, for just one round of communication, this scheme is fair if and only if the threshold is either less than or equal to the minimum degree of G , or greater than or equal to its maximum degree. Despite that the dynamic coloring problem has widely been dealt with in the literature, a comprehensive study concerning this implementation in cryptography is still required. This paper delves into this topic by focusing on the use of extended neighborhood coronas for modeling communication networks whose average path lengths are small even after an asymptotic growth of their center and/or outer graphs. Particularly, the dynamic coloring problem is solved for any extended neighborhood corona with center path or star, for which we establish optimal shadow allocations of any (fair) threshold secret sharing scheme based on them. Some bounds are also established for the dynamic chromatic number of any extended neighborhood corona.

Keywords: dynamic coloring; extended neighborhood corona; threshold secret sharing scheme (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/12/2018/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/12/2018/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:12:p:2018-:d:836545

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().