Abstract
Traceability schemes that are applied to broadcast encryption can prevent unauthorized parties from accessing the distributed data. In a traceability scheme, a distributor broadcasts the encrypted data and gives each authorized user a unique key and identifying word from the selected error-correcting code for decrypting. The following attack is possible in these schemes: groups of c malicious users join into coalitions and gain illegal access to the data by combining their keys and identifying codewords to obtain a pirate key and codeword. To prevent this type of attack, classes of error-correcting codes with special c-FP and c-TA properties are used. In particular, c-FP codes are codes that make direct compromise of scrupulous users impossible and c-TA codes are codes that make it possible to identify one of the attackers. We are considering the problem of evaluating the lower and the upper boundaries on c, within which the L-construction algebraic geometric codes have the corresponding properties. In the case of codes on an arbitrary curve, the lower bound for the c-TA property was obtained earlier; in this paper, the lower bound for the c-FP property was constructed. In the case of curves with one infinite point, the upper bounds for the value of c are obtained for both c-FP and c-TA properties. During our work, we have proven an auxiliary lemma and the proof contains an explicit way to build a coalition and a pirate-identifying vector. Methods and principles presented in the lemma can be important for analyzing broadcast encryption schemes’ robustness. Also, the c-FP and c-TA boundaries’ monotonicity by subcodes are proven.
Similar content being viewed by others
REFERENCES
Stinson, D.R. and Wei, R., Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM J. Discrete Math., 1998, vol. 11, no. 1, pp. 41–53. https://doi.org/10.1137/S0895480196304246
Staddon, J.N., Stinson, D.R., and Wei, R., Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inf. Theory, 2001, vol. 47, no. 3, pp. 1042–1049. https://doi.org/10.1109/18.915661
Silverberg, A., Staddon, J., and Walker, J.L., Applications of list decoding to tracing traitors, IEEE Trans. Inf. Theory, 2003, vol. 49, no. 5, pp. 1312–1318. https://doi.org/10.1109/TIT.2003.810630
Kabatyansky, G.A., Traceability codes and their generalizations, Probl. Inf. Transm., 2019, vol. 55, no. 3, pp. 283–294. https://doi.org/10.1134/S0032946019030074
Deundyak, V.M. and Mkrtichyan, V.V., Research of applying bounds of the information protection scheme based on RS-codes, Diskretn. Anal. Issled. Oper., 2011, vol. 18, no. 3, pp. 21–38.
Deundyak, V.M., Yevpak, S.A., and Mkrtichyan, V.V., Analysis of properties of q-ary Reed–Muller error-correcting codes viewed as codes for copyright protection, Probl. Inf. Transm., 2015, vol. 51, no. 4, pp. 398–408. https://doi.org/10.1134/S0032946015040092
Zagumennov, D.V. and Mkrtichyan, V.V., On application of algebraic geometry codes of L-construction in copy protection, Prikl. Disretn. Mat., 2019, no. 44, pp. 67–93. https://doi.org/10.17223/20710410/44/6
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977.
Yevpak, S.A. and Mrktichyan, V.V., Applicability conditions for q-ary Reed–Muller codes in traitor tracing, Vladikavkaz. Mat. Zh., 2014, vol. 16, no. 2, pp. 38–45.
Høholdt, T., van Lint, J.H., and Pellikaan, G.R., Algebraic geometry codes, Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Elsevier, 1998, vol. 1, pp. 871–961.
Vladuts, S.G., Nogin, D.Yu., and Tsfasman, M.A., Algebrogeometricheskie kody. Osnovnye ponyatiya (Algebrogeometric Codes: Main Concepts), Moscow: MCCME, 2003.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by K. Gumerov
About this article
Cite this article
Deundyak, V.M., Zagumennov, D.V. On the Properties of Algebraic Geometric Codes as Copy Protection Codes. Aut. Control Comp. Sci. 55, 795–808 (2021). https://doi.org/10.3103/S014641162107021X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S014641162107021X