Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma
IEEE Transactions on Information Theory · 2023-11 · 69 (11) · 7049-7069
DOI: 10.1109/tit.2023.3282452 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2023-11. Verfasst von Marcel Fernández und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 37 Literaturangaben. Gefördert von: TCO-pRIvacy and SEcurity in public BLOCKchains and their application to datamarketplaces (RISEBLOCK), Ministerio de Asuntos Económicos y Transformación Digitalb, Ministerio de Ciencia e Innovación.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- TCO-pRIvacy and SEcurity in public BLOCKchains and their application to datamarketplaces (RISEBLOCK), Ministerio de Asuntos Económicos y Transformación Digitalb
- Ministerio de Ciencia e Innovación
Zitieren
APA
Fernández, M., Livieratos, J., & Martín, S. (2023). Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma. IEEE Transactions on Information Theory, 69(11), 7049-7069. https://doi.org/10.1109/tit.2023.3282452
Vancouver
Fernández M, Livieratos J, Martín S. Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma. IEEE Transactions on Information Theory. 2023;69(11):7049-7069. doi:10.1109/tit.2023.3282452
BibTeX
@article{Fernndez2023,
author = {Fernández, Marcel and Livieratos, John and Martín, Sebastià},
title = {Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma},
journal = {IEEE Transactions on Information Theory},
year = {2023},
volume = {69},
number = {11},
pages = {7049--7069},
doi = {10.1109/tit.2023.3282452}
}
EUVIMED