Cryptographic scheme for group passwords distribution in steganographic systems
This paper proposes a new scheme of passwords distribution for user groups via a hidden communication channel. The previously known models explicitly demonstrated the presence of passwords and cannot be used in any hidden communication channel. The considered model assumes the presence of a coordina...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2019-03-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/1184 |
| _version_ | 1797759590630162432 |
|---|---|
| author | Ivan V. Nechta |
| author_facet | Ivan V. Nechta |
| author_sort | Ivan V. Nechta |
| collection | DOAJ |
| description | This paper proposes a new scheme of passwords distribution for user groups via a hidden communication channel. The previously known models explicitly demonstrated the presence of passwords and cannot be used in any hidden communication channel. The considered model assumes the presence of a coordinator who regulates the composition of the groups and is the source of the overwhelming proportion of messages. The composition of the groups is not known in advance and may change during transmission messages. It is assumed that the data transmitted in a container will consist of two parts: a service part, which contains information about groups and passwords, and a useful part, which contains the target message that encrypted with a group-password. The scheme is based on the Kronecker-Capelli theorem. To find a group password the subscriber-receiver, is included in the group, calculates the product of the roots of a joint system of linear algebraic equations. This system consists of n equations and contains n+1variables. For an outside subscriber, who is not included in the group, the system of equations has not a single solution. A subscriber in the group is able to calculate one variable by a predefined formula. Consequently, the system of equations for such subscriber has the unique solution. The paper describes the processes of changing a composition of groups: creating, adding a participant, removing. The removing users from a group is realized by reuniting members of the old group. The scheme provides the possibility of combining previously created subgroups into large group without significant overhead costs. The proposed scheme can be used in practice by some organization to manage its branches when communicating via hidden data transmission channels. |
| first_indexed | 2024-03-12T18:46:37Z |
| format | Article |
| id | doaj.art-529aecd0df92465a99e198386e557ace |
| institution | Directory Open Access Journal |
| issn | 2074-7128 2074-7136 |
| language | English |
| last_indexed | 2024-03-12T18:46:37Z |
| publishDate | 2019-03-01 |
| publisher | Joint Stock Company "Experimental Scientific and Production Association SPELS |
| record_format | Article |
| series | Безопасность информационных технологий |
| spelling | doaj.art-529aecd0df92465a99e198386e557ace2023-08-02T07:32:48ZengJoint Stock Company "Experimental Scientific and Production Association SPELSБезопасность информационных технологий2074-71282074-71362019-03-01261879710.26583/bit.2019.1.091134Cryptographic scheme for group passwords distribution in steganographic systemsIvan V. Nechta0Siberian state university of telecommunications and information sciencesThis paper proposes a new scheme of passwords distribution for user groups via a hidden communication channel. The previously known models explicitly demonstrated the presence of passwords and cannot be used in any hidden communication channel. The considered model assumes the presence of a coordinator who regulates the composition of the groups and is the source of the overwhelming proportion of messages. The composition of the groups is not known in advance and may change during transmission messages. It is assumed that the data transmitted in a container will consist of two parts: a service part, which contains information about groups and passwords, and a useful part, which contains the target message that encrypted with a group-password. The scheme is based on the Kronecker-Capelli theorem. To find a group password the subscriber-receiver, is included in the group, calculates the product of the roots of a joint system of linear algebraic equations. This system consists of n equations and contains n+1variables. For an outside subscriber, who is not included in the group, the system of equations has not a single solution. A subscriber in the group is able to calculate one variable by a predefined formula. Consequently, the system of equations for such subscriber has the unique solution. The paper describes the processes of changing a composition of groups: creating, adding a participant, removing. The removing users from a group is realized by reuniting members of the old group. The scheme provides the possibility of combining previously created subgroups into large group without significant overhead costs. The proposed scheme can be used in practice by some organization to manage its branches when communicating via hidden data transmission channels.https://bit.mephi.ru/index.php/bit/article/view/1184group passwords, steganography, cryptography. |
| spellingShingle | Ivan V. Nechta Cryptographic scheme for group passwords distribution in steganographic systems Безопасность информационных технологий group passwords, steganography, cryptography. |
| title | Cryptographic scheme for group passwords distribution in steganographic systems |
| title_full | Cryptographic scheme for group passwords distribution in steganographic systems |
| title_fullStr | Cryptographic scheme for group passwords distribution in steganographic systems |
| title_full_unstemmed | Cryptographic scheme for group passwords distribution in steganographic systems |
| title_short | Cryptographic scheme for group passwords distribution in steganographic systems |
| title_sort | cryptographic scheme for group passwords distribution in steganographic systems |
| topic | group passwords, steganography, cryptography. |
| url | https://bit.mephi.ru/index.php/bit/article/view/1184 |
| work_keys_str_mv | AT ivanvnechta cryptographicschemeforgrouppasswordsdistributioninsteganographicsystems |