EXPERIMENTAL STUDY OF THE RELIABILITY OF BROADCAST ENCRYPTION SCHEMES WITH LOW-POWER ALGEBRAIC GEOMETRIC CODES
Abstract
Broadcast encryption is a data distribution protocol that solve the problem of distributing digital
products to authorized users and prevent unauthorized parties from accessing the data. It is widely
used in computer networks data protection, digital television and distributed storage. In broadcast
encryption schemes, data is distributed freely, but in encrypted form, and each legal user is given a
unique set of keys to decrypt it. However, broadcast encryption schemes are vulnerable to attacks
from coalitions of malicious users from among authorized users who are trying to create “pirated”
keys and gain unauthorized access to distributed data. Attacks of this kind can be handled in broadcast
encryption schemes by using error-correction codes that have special identifying properties, in
particular, frameproof (FP) and traceability (TA) properties. Previously, theoretical limits were obtained
for the power of a coalition of attackers, within which schemes based on identifying algebraic
geometric codes are applicable. The paper presents an information system for conducting experimental
studies of schemes reliability based on low-power identifying algebraic geometric codes, inparticular, for calculating identifying properties violation probabilities, including when exceeding
known theoretical limits. As an example of using the presented system, the results of a computational
experiment for two algebraic geometric codes are presented and analyzed. In conclusion, some open
questions are considered that are of interest for further research, in particular, the possibility of expanding
experimental studies to codes of arbitrary power.
References
Science. – SpringerVerlag, 1994. Vol. 773. – P. 480-491.
2. Chor B., Fiat A., Naor M. Tracing traitors, Advances in cryptology – CRYPTO’94. Springer
Berlin Heidelberg, 1994, pp. 257-270.
3. Staddon J.N., Stinson D.R., Wei R. Combinatorial properties of frameproof and traceability
codes, Information Theory, IEEE Transactions on, 2001, Vol. 47, No. 3, pp. 1042-1049.
4. Stinson D.R., Wei R. Combinatorial properties and constructions of traceability schemes and
frameproof codes, Information Theory, IEEE Transactions on, 2001, Vol. 47, No. 3,
pp. 1042--1049.
5. Silverberg A., Staddon J., Walker J.L. Applications of list decoding to tracing traitors // Information
Theory, IEEE Transactions on, 2003, Vol. 49, No. 5, pp. 1312-1318.
6. Fernandez M., Cotrina J., Soriano M., Domingo N. A Note about the Traceability Properties
of Linear Codes, Proc. 10th Int. Conf. on Information Security and Cryptology (ICISC’2007).
Seoul, Korea. November 29–30, 2007. Lecture Notes in Comp. Science, Vol. 4817. Berlin:
Springer, 2007, pp. 251–258.
7. Moreira J., Fernandez M. and Soriano M. A note on the equivalence of the traceability properties
of Reed-Solomon codes for certain coalition sizes, 2009 First IEEE International Workshop
on Information Forensics and Security (WIFS), London, 2009, pp. 36-40.
8. Kabatyanskiy G.A. Identifitsiruyushchie kody i ikh obobshcheniya [Identifying codes and their
generalizations], Problemy peredachi informatsii [Problems of information transmission],
2019, Vol. 55, No. 3, pp. 90-111.
9. Egorova E.E., Fernandes M., Kabatyanskiy G.A., Myao I. Sushchestvovanie i konstruktsii
mul'timediynykh kodov, sposobnykh nakhodit' polnuyu koalitsiyu pri atake usredneniya i
shume [The existence and construction of multimedia codes capable of finding a complete
coalition in the averaging attack and noise], Problemy peredachi informatsii [Problems of information
transmission], 2020, Vol. 56, No. 4, pp. 97-108.
10. Egorova E.E., Kabatyanskiy G.A. Razdelimye kody dlya zashchity mul'timedia ot nelegal'nogo
kopirovaniya koalitsiyami [Separable codes to protect multimedia from illegal copying by coalitions],
Problemy peredachi informatsii [Problems of information transmission], 2021,
Vol. 57, No. 2, pp. 178-198.
11. Goppa V.D. Algebraiko-geometricheskie kody [Algebraic-geometric codes], Izvestiya
Rossiyskoy akademii nauk. Seriya matematicheskaya [Proceedings of the Russian Academy of
Sciences. The series is mathematical], 1982, Vol. 46, No. 4, pp. 762-781.
12. Vleduts S.G., Nogin D.Yu., TSfasman M.A. Algebrogeometricheskie kody. Osnovnye
ponyatiya [Algebraogeometric codes. Basic concepts]. Moscow: MTSNMO, 2003.
13. Hoholdt T., van Lint J. H., Pellikaan R. Algebraic geometry codes, Handbook of coding theory,
1998, Vol. 1, No. Part 1, pp. 871-961.
14. Deundyak V.M. and Zagumennov D.V. On the Properties of Algebraic Geometric Codes as
Copy Protection Codes, Automatic Control and Computer Sciences, 2021, Vol. 55, No. 7,
pp. 795-808.
15. Deundyak V.M., Zagumennov D.V. O granitsakh moshchnosti zloumyshlennikov dlya
identifitsiruyushchikh algebrogeometricheskikh kodov na spetsial'nykh krivykh [On the limits of
the power of intruders for identifying algebra-geometric codes on special curves], Prikladnaya
diskretnaya matematika [Applied Discrete Mathematics], 2021, No. 53, pp. 55-74.
16. Magma Computational Algebra System. Available at: http://magma.maths.usyd.edu.au/magma/
(accessed 06 August 2022).
17. Gmurman V.E. Teoriya veroyatnostey i matematicheskaya statistika [Probability theory and
mathematical statistics]. 8th ed. Moscow: Vysshaya shkola, 2002, 479 p.
18. Guruswami V, Sudan M. Improved decoding of Reed-Solomon and algebraic-geometric codes,
Foundations of Computer Science. Palo Alto: IEEE, 1998, pp. 28-37.
19. Shokrollahi A., Wasserman H. List Decoding of Algebraic-Geometric Codes, IEEE Transactions
on Information Theory, 1999, Vol. 45, No. 2, pp. 432-437.
20. Fernandez M., Soriano M. Identification of Traitors in Algebraic-Geometric Traceability
Codes, IEEE Transactions on Signal Processing, 2004, Vol. 52, No. 10, pp. 3073-3077.
