Frameproof codes, separable codes and B2 codes: bounds and constructions

View/Open
Cita com:
hdl:2117/396663
Document typeArticle
Defense date2023-11-10
PublisherSpringer
Rights accessOpen Access
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution 4.0 International
ProjectPRIVACIDAD Y SEGURIDAD EN BLOCKCHAINS PUBLICAS Y SUS APLICACIONES A LOS MERCADOS DE DATOS (AEI-PID2019-110224RB-I00)
CRIPTOGRAFIA PARA RETOS DIGITALES EMERGENTES: ESCENARIOS MULTI-USUARIO Y SEGURIDAD POST-CUANTICA (AEI-PID2019-109379RB-I00)
CRIPTOGRAFIA PARA RETOS DIGITALES EMERGENTES: ESCENARIOS MULTI-USUARIO Y SEGURIDAD POST-CUANTICA (AEI-PID2019-109379RB-I00)
Abstract
In this paper, constructions of frameproof codes, separable codes, and B2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes. The obtained bounds match all best known bounds in the literature. Our strategy allows us to present constructions of the aforementioned codes, by using the variable framework for the Lovász Local Lemma.
CitationFernandez, M.; Livieratos, J.; Martin, S. Frameproof codes, separable codes and B2 codes: bounds and constructions. "Cryptography and communications", 10 Novembre 2023, vol. 16, núm. 3, p. 481-506.
ISSN1936-2455
Publisher versionhttps://link.springer.com/article/10.1007/s12095-023-00682-y
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
s12095-023-00682-y.pdf | 422,3Kb | View/Open |