Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Maghsoud Parviz"'
Publikováno v:
Advances in Mathematics of Communications. 17:697-713
For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ff263e8831b3a69221ce81859d860d7
https://doi.org/10.3934/amc.2021017
https://doi.org/10.3934/amc.2021017
Publikováno v:
Theoretical Computer Science. 891:116-130
A group-characterizable (GC) random variable is induced by a finite group, called main group, and a collection of its subgroups. The notion extends directly to secret sharing schemes (SSSs). It is known that linear and abelian SSSs can be equivalentl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79522290a94f4c7479dfe106d72c2647
https://doi.org/10.1016/j.tcs.2021.08.032
https://doi.org/10.1016/j.tcs.2021.08.032
Publikováno v:
Designs, Codes and Cryptography. 89:2079-2096
In 1992, Frankel and Desmedt introduced a technique that enables one to reduce the secret space of an ideal homomorphic secret sharing scheme (IHSSS) into any of its characteristic subgroups. In this paper, we propose a similar technique to reduce th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1d95bdfc58bf80d5d96fa020711a5fa
https://doi.org/10.1007/s10623-021-00901-8
https://doi.org/10.1007/s10623-021-00901-8