Zobrazeno 1 - 10
of 11
pro vyhledávání: '"N. Shenets"'
Autor:
N. N. Shenets
Publikováno v:
Automatic Control and Computer Sciences. 56:947-956
Autor:
N. N. Shenets, A. S. Petushkov
Publikováno v:
Automatic Control and Computer Sciences. 55:1029-1038
Autor:
N. Shenets
Publikováno v:
Nonlinear Phenomena in Complex Systems. 23:54-65
It is not a secret that one-factor authentication protocols suffer from many attacks nowadays. So there exist numerous solutions that use two or more authentication factors. The most popular is two-factor authentication via mobile network where the P
Autor:
N. N. Shenets
Publikováno v:
Automatic Control and Computer Sciences. 53:857-864
This paper presents the results of the study aimed at improving the security of FANET. A new security infrastructure is developed based on the use of secret sharing and authenticated encryption. Its efficiency is experimentally proved using the FANET
Autor:
N. N. Shenets
Publikováno v:
Automatic Control and Computer Sciences. 51:936-946
We have proposed a new method for authentication and secret key establishment in ad-hoc networks through public channels based only on verifiable homomorphic threshold secret sharing. The secrecy of the method has been analyzed in standard assumption
Autor:
N. N. Shenets, E. E. Trukhina
Publikováno v:
Automatic Control and Computer Sciences. 51:972-977
In this work the Password Authenticated Connection Establidhment (PACE) protocol, which is used in Europenian smartcard enviroments, is considered. Protocol modifications have been proposed that can enhance its execution speed without decreasing its
Autor:
N. N. Shenets
Publikováno v:
Automatic Control and Computer Sciences. 49:798-802
The paper deals with modular secret sharing schemes for certain non-threshold access structures. It is shown that based on compositions of ideal threshold modular schemes it is possible to build an ideal scheme for compartment access structures, as w
Publikováno v:
SYNASC
We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the rin
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.