Abstract—
The topical problem of the key distribution in a community for providing secure communication among its participants is studied. To solve this problem, key predistribution systems can be considered, where each user receives some key information they can later use to calculate independently from the system’s other participants required shared secret keys for conferences they participate in. These key distribution systems can be based on different structures, such as error-correcting codes and combinatorial designs. The weakness of such systems is the risk of collusive attacks, when abusers within the system can form a coalition and use their key information to try and calculate shared secret keys of other users. But the system guarantees the secrecy of keys provided that the number of abusers in the coalition does not exceed a threshold defined by the system structure. In this paper, we consider a key distribution system that is based on combinatorial designs, in particular, on Hadamard 3‑designs, and guarantees the secrecy of communication in case of coalitions of less than three users. New notions of combinatorial span and combinatorial rank of a subset of Hadamard code are introduced that are required for studying the system’s resilience to collusive attacks. In addition, some combinatorial properties of Hadamard codes are analyzed. The probability of a successful collusive attack against an arbitrary conference is calculated for the constructed key distribution system, depending on the capacity of the coalition of abusers.
Similar content being viewed by others
REFERENCES
Schneier, B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley & Sons, Inc., 1993.
Diffie, W. and Hellman, M., New directions in cryptography, IEEE Trans. Inf. Theory, 1976, vol. 22, no. 6, pp. 644–654.
Needham, R.M. and Schroeder, M.D., Using encryption for authentication in large networks of computers, Commun. ACM, 1978, vol. 21, no. 12, pp. 993–999.
Matsumoto, T. and 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, pp. 185–193.
Blom, R., An optimal class of symmetric key generation systems, Workshop on the Theory and Applications of Cryptographic Techniques, 1985, pp. 335–338.
Blundo, C., Mattos, L.A.F., and Stinson, D.R., Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings, 1996, pp. 387–400.
Sidelnikov, V.M., Teoriya kodirovaniya (Coding Theory), Moscow: Fizmatlit, 2008.
Mitchell, C.J. and Piper, F.C., Key storage in secure networks, Discrete Appl. Math., 1988, vol. 21, no. 3, pp. 215–228.
Tarannikov, Yu.V., Kombinatornye svoystva diskretnykh struktur i prilozheniya k kriptologii (Combinatorial Properties of Discrete Structures and Applications to Cryptology), Moscow: MTsNMO, 2011.
Stinson, D.R., On some methods for unconditionally secure key distribution and broadcast encryption, Des. Codes Cryptogr., 1997, vol. 3, no. 12, pp. 215–243.
Stinson, D.R. and Trung, T.V., Some new results on key distribution patterns and broadcast encryption, Des. Codes Cryptogr., 1998, vol. 14, pp. 261–279.
Martin, K.M., The combinatorics of cryptographic key establishment, London Math. Soc. Lect. Note Ser., 2007, vol. 346, pp. 223–273.
Deundyak, V.M. and Taran, A.A., On the application of Hamming codes in a key distribution system for conferences in multi-user communication systems, Vestn. Voronezh. Gos. Univ., Ser.: Sist. Anal. Inf. Tekhnol., 2015, vol. 3, pp. 43–50.
Deundyak, V.M. and Taran, A.A., On the probability of successful attacks on conference keys in multilinear key distribution systems, Izv. Vuzov Sev.-Kavk. Reg. Tekhn. Nauki, 2018, vol. 1, pp. 10–17.
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Elsevier, 1977.
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.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
CONFLICT OF INTEREST
The authors declare that they have no conflicts of interest.
ADDITIONAL INFORMATION
Vladimir M. Deundyak, orcid.org/0000-0001-8258-2419, PhD.
Alexey A. Taran, orcid.org/0000-0002-1357-9360, graduate student.
Additional information
Translated by S. Kuznetsov
About this article
Cite this article
Deundyak, V.M., Taran, A.A. A Key Distribution System Based on Hadamard Designs. Aut. Control Comp. Sci. 54, 584–593 (2020). https://doi.org/10.3103/S0146411620070068
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411620070068