RESUMEN
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.'s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols.
Asunto(s)
Identificación Biométrica/métodos , Reconocimiento de Normas Patrones Automatizadas/métodos , Inteligencia Artificial , HumanosRESUMEN
Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique based on nonlinear combination polynomial arithmetic in order to solve this threat. It is hard to apply to the secret image sharing. In this paper, we propose a (t, n)-threshold nonlinear secret image sharing scheme with steganography concept. In order to achieve a suitable and secure secret image sharing scheme, we adapt a modified LSB embedding technique with XOR Boolean algebra operation, define a new variable m, and change a range of prime p in sharing procedure. In order to evaluate efficiency and security of proposed scheme, we use the embedding capacity and PSNR. As a result of it, average value of PSNR and embedding capacity are 44.78 (dB) and 1.74tâlog2 mâ bit-per-pixel (bpp), respectively.
Asunto(s)
Seguridad Computacional , Algoritmos , Comunicación , Difusión de la Información , Dinámicas no LinealesRESUMEN
This paper analyzes the amount and characteristics of municipal solid waste (MSW) according to the inhabitant density of population and the business concentration in 25 districts in Seoul. Further, the heat energy recovery and avoided CO(2) emissions of four incineration plants located in residential and commercial areas in Seoul are examined. The amount of residential waste per capita tended to increase as the density of inhabitants decreased. The amount of commercial waste per capita tended to increase as the business concentration increased. The examination of the heat energy recovery characteristics indicated that the four incineration plants produced heat energy that depended on residential or commercial areas based on population and business. The most important result regarding avoided CO(2) emissions was that commercial areas with many office-type businesses had the most effective CO(2) emission savings by combusting 1 kg of waste. Assuming the full-scale operation of the four incineration plants, the amount of saved CO(2) emissions per year was 444 Gg CO(2) and 57,006 households in Seoul can be provided with heat energy equivalent to 542,711 Nm(3) of LNG.