Geodesic
Key distribution system based on Hadamard designs
Modelirovanie i analiz informacionnyh sistem, Tome 26 (2019) no. 2, pp. 229-243.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of key distribution in a community for providing secure communication between its participants is studied. To solve this problem, key predistribution systems can be used, in which each user receives some key information that can later be used to independently calculate required shared secret keys for conferences they participate in. Such key distribution systems can be based on different structures, such as error-correcting codes and combinatorial designs. The drawback of such systems is the possibility of collusive attacks, when traitors within the system can form a coalition and use their key information to try to calculate shared secret keys of other users. But the secrecy of keys is guaranteed by the system when the number of traitors in the coalition does not exceed a threshold defined by the system structure. In this paper, a key distribution system is based on combinatorial designs and, in particular, on Hadamard 3-design that guarantees the secrecy of communications in the presence of coalitions with less than three users. New notions of combinatorial span and combinatorial rank of a subset of Hadamard code that are required for the study of the resilience of the system to collusive attacks are introduced. The probability of successful collusive attack on an arbitrary conference against the cardinality of coalition is calculated for this system.
Keywords: key distribution systems, combinatorial designs, collusive attacks. 
@article{MAIS_2019_26_2_a3,
     author = {V. M. Deundyak and A. A. Taran},
     title = {Key distribution system based on {Hadamard} designs},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {229--243},
     publisher = {mathdoc},
     volume = {26},
     number = {2},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a3/}
}
TY  - JOUR
AU  - V. M. Deundyak
AU  - A. A. Taran
TI  - Key distribution system based on Hadamard designs
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2019
SP  - 229
EP  - 243
VL  - 26
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a3/
LA  - ru
ID  - MAIS_2019_26_2_a3
ER  - 
%0 Journal Article
%A V. M. Deundyak
%A A. A. Taran
%T Key distribution system based on Hadamard designs
%J Modelirovanie i analiz informacionnyh sistem
%D 2019
%P 229-243
%V 26
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a3/
%G ru
%F MAIS_2019_26_2_a3
V. M. Deundyak; A. A. Taran. Key distribution system based on Hadamard designs. Modelirovanie i analiz informacionnyh sistem, Tome 26 (2019) no. 2, pp. 229-243. http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a3/

[1] Schneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley Sons, Inc., 1993 | MR

[2] Diffie W., Hellman M., “New Directions in Cryptography”, IEEE Transactions in Information Theory, 22:6 (1976), 644–654 | DOI | MR | Zbl

[3] Needham R. M. Schroeder M. D., “Using Encryption for Authentication in Large Networks of Computers”, Communications of the ACM, 21:12 (1978), 993–999 | DOI | Zbl

[4] Matsumoto T., Imai I., “On the Key Predistribution System: A Practical Solution to the Key Distribution Problem”, CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques (1987), 185–193

[5] Blom R., “An Optimal Class of Symmetric Key Generation Systems”, Workshop on the Theory and Applications of Cryptographic Techniques (1985), 335–338

[6] Blundo C., Mattos L. A. F., Stinson D. R., “Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution”, Annual International Cryptography Conference, Lecture Notes in Computer Science, 1109, 1996, 387–400 | DOI | MR | Zbl

[7] Sidelnikov V. M., Teoriya kodirovaniya, Fizmatlit, 2008 (in Russian)

[8] Mitchell C. J., Piper F. C., “Key Storage in Secure Networks”, Discrete Applied Mathematics, 21:3 (1988), 215–228 | DOI | MR | Zbl

[9] Tarannikov Yu. V., Kombinatornye svoystva diskretnykh struktur i prilozheniya k kriptologii, MTsNMO, 2011 (in Russian)

[10] Stinson D. R., “On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption”, Designs, Codes and Cryptography, 3:12 (1997), 215–243 | DOI | MR | Zbl

[11] Stinson D. R., Trung T. V., “Some New Results on Key Distribution Patterns and Broadcast Encryption”, Designs, Codes and Cryptography, 14 (1998), 261–279 | DOI | MR | Zbl

[12] Martin K M., “The Combinatorics of Cryptographic Key Establishment”, London Mathematical Society Lecture Note Series, 346, 2007, 223–273 | MR | Zbl

[13] Deundyak V. M., Taran A. A., “O primenenii kodov Khemminga v sisteme raspredeleniya klyuchey dlya konferentsy v mnogopolzovatelskikh sistemakh svyazi”, Vestnik VGU. Seriya: Sist. analiz i inform. tekhnologii, 3 (2015), 43–50 (in Russian)

[14] Deundyak V. M., Taran A. A., “O veroyatnosti provedeniya uspeshnykh atak na klyuchi konferentsy v polilineynykh sistemakh raspredeleniya klyuchey”, Izvestiya vuzov. Sev.-Kavk. Region. Tekhn. Nauki, 1 (2018), 10–17 (in Russian)

[15] MacWilliams F. J., Sloane N. J. A., The Theory of Error-Correcting Codes, North-Holland Mathematical Library, 16, Elsevier, 1977 | MR

[16] Silverberg A., Staddon J., Walker J. L., “Applications of List Decoding to Tracing Traitors”, IEEE Transactions on Information Theory, 49:5 (2003), 1312–1318 | DOI | MR | Zbl