Access structures for finding characteristic-dependent linear rank inequalities
Kybernetika (2023)
- Volume: 59, Issue: 2, page 198-208
- ISSN: 0023-5954
Access Full Article
top
Abstract
topHow to cite
topPeña-Macias, Victor. "Access structures for finding characteristic-dependent linear rank inequalities." Kybernetika 59.2 (2023): 198-208. <http://eudml.org/doc/299055>.
@article{Peña2023,
abstract = {Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are then used for getting lower bounds on information ratios of some access structures in linear secret sharing.},
author = {Peña-Macias, Victor},
journal = {Kybernetika},
keywords = {secret sharing; cryptography; access structures; matroids; complementary spaces; linear rank inequalities; entropy},
language = {eng},
number = {2},
pages = {198-208},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Access structures for finding characteristic-dependent linear rank inequalities},
url = {http://eudml.org/doc/299055},
volume = {59},
year = {2023},
}
TY - JOUR
AU - Peña-Macias, Victor
TI - Access structures for finding characteristic-dependent linear rank inequalities
JO - Kybernetika
PY - 2023
PB - Institute of Information Theory and Automation AS CR
VL - 59
IS - 2
SP - 198
EP - 208
AB - Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are then used for getting lower bounds on information ratios of some access structures in linear secret sharing.
LA - eng
KW - secret sharing; cryptography; access structures; matroids; complementary spaces; linear rank inequalities; entropy
UR - http://eudml.org/doc/299055
ER -
References
top- Blasiak, A., Kleinberg, R., Lubetzky, E., , Ib: IEEE Symposium on Foundations of Computer Science 2011, pp. 609-618. MR2932737DOI
- Brickell, E. F., Davenport, D. M., , J. Cryptology (1991), 4, 123-134. DOI
- Dougherty, R., Freiling, C., Zeger, K., , IEEE Trans. Inform. Theory 61 (2015), 5, 2488-2509. MR3342292DOI
- Farràs, O., Kaced, T., Martín, S., Padró, C., , IEEE Transactions on Information Theory 66 (2020), 11, 7088-7100. MR4173629DOI
- Jafari, A., Khazaei, S., On Abelian secret sharing: Duality and separation., IACR Cryptol. ePrint Archive (2019), 575. MR4317850
- Martín, S., Padró, C., Yang, A., , IEEE Trans. Inform. Theory 2 (2016), 1, 599-609. MR3448000DOI
- Padró, C., Lecture notes in secret sharing., Cryptology ePrint Archive: Report (2012), 674.
- Peña-Macias, V., Sarria, H., , J. Inform. Optim. Sci. 42 (2021), 2, 345-369. DOI
- Peña-Macias, V., Sarria, H., , Rev. Acad. Colomb. Cienc. Ex. Fis. Nat. 43 (2019), 169, 76-5-770. MR4048871DOI
- Shen, A., Hammer, D., Romashchenko, A. E., Vereshchagin, N. K., , J. Computer Systems Sci. 60 (2000), 442-464. MR1785025DOI
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.