Your browser doesn't support javascript.
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Mais filtros

Base de dados
Intervalo de ano de publicação
PLoS One ; 19(1): e0296781, 2024.
Artigo em Inglês | MEDLINE | ID: mdl-38261555


The incorporation of information and communication technologies in the power grids has greatly enhanced efficiency in the management of demand-responses. In addition, smart grids have seen considerable minimization in energy consumption and enhancement in power supply quality. However, the transmission of control and consumption information over open public communication channels renders the transmitted messages vulnerable to numerous security and privacy violations. Although many authentication and key agreement protocols have been developed to counter these issues, the achievement of ideal security and privacy levels at optimal performance still remains an uphill task. In this paper, we leverage on Hamming distance, elliptic curve cryptography, smart cards and biometrics to develop an authentication protocol. It is formally analyzed using the Burrows-Abadi-Needham (BAN) logic, which shows strong mutual authentication and session key negotiation. Its semantic security analysis demonstrates its robustness under all the assumptions of the Dolev-Yao (DY) and Canetti- Krawczyk (CK) threat models. From the performance perspective, it is shown to incur communication, storage and computation complexities compared with other related state of the art protocols.

Cartões Inteligentes de Saúde , Unionidae , Animais , Biometria , Comunicação , Sistemas Computacionais , Fontes de Energia Elétrica
PLoS One ; 19(1): e0296469, 2024.
Artigo em Inglês | MEDLINE | ID: mdl-38170722


This study presents a lightweight, secure audio steganography system for hiding text messages for transmission over the Internet, with the aim of addressing the current problems of high computational cost and insufficient security identified in earlier studies. We propose a two-phase functioning mechanism. Text characters are first transformed into ASCII code and stored in a vector, which is then divided into three sub-vectors. These sub-vectors are scrambled using two low-complexity operations, namely a forward-backward reading technique and an odd-even index. Two scrambling loops are performed, the first on the small sub-vectors the second on the vector as a whole. In the hiding phase, the speech signal samples are divided into 256 blocks using only 200 values per block, and low-complexity quadratic and the Hénon maps are used to hide the speech signal in a random manner. The conditional LSB is applied as a low-complexity algorithm to identify hidden bits, and a special hyperchaotic map algorithm is developed to randomly choose locations. The proposed approach provides good security for a scrambled text message, with high SNR and PSNR, small MSE and PESQ, a SSIM value of close to one (As indicated in Tables 1, 2, 3, and 4), a BER value of close to zero (as shown in table 8), NCC value near +1 (as shown in table 8), and an MOS value of near five (as described in table 6), as well as a low computational hiding cost.

Dislexia , Envio de Mensagens de Texto , Humanos , Fala , Segurança Computacional , Algoritmos