Explore chapters and articles related to this topic
High-Performance Switch/Routers
Published in James Aweya, Designing Switch/Routers, 2023
SNMPv3 defines security models and security levels that address authentication, message integrity, and encryption. A security model defines a security strategy set up for a user and the group to which the user belongs. A security level defines the level of security permitted within the selected security model. A combination of the two determines the security mechanism to be used when exchanging SNMP messages. User-based Security Model (USM) and View-based Access Control Model (VACM) are two of the security models defined by SNMPv3.
SCAN-CogRSG: Secure Channel Allocation by Dynamic Cluster Switching for Cognitive Radio Enabled Smart Grid Communications
Published in IETE Journal of Research, 2022
In the SG system, a fully homomorphic encryption (FHE) algorithm was used for security [29]. The security was provided for smart meter reading by converting them into a ciphertext. Furthermore, the gateway aggregates the ciphertext from all smart meters. The main intent of this work was to secure the reading value from the attackers. FHE has the main drawback that is higher complexity for encryption and homomorphic operations. Joint authentication and encryption were performed by state estimation-based dynamic encryption and authentication (SEDEA) approach [30]. State estimation was performed based on the meter measurements gathered from the smart meters. From the aggregated measurements, the state was estimated by the control center. Based on the state estimated by the control center, the authentication was dynamically changed. Authentication and state estimation in the control center lead to a large number of attackers in the network since the data take time to reach the control center. A three-factor authentication scheme was proposed for enabling authentication between users and smart meters [31]. In three-factor authentication, bitwise XOR operations, elliptic curve cryptography (ECC), and one-way hash functions were performed for security. ECC and hash generation have high computational complexity and XOR operations are less secure. Thus, security level and complexity are the major issues in SG systems.
Reversible Data Hiding in Encrypted Images Based on Hybrid Cryptosystem
Published in IETE Technical Review, 2021
Besides, another category of RDH-EI methods [20–24] adopts homomorphic encryption by public-key cryptosystems with probabilistic and homomorphic properties. These properties are considered to be significant in the design of data embedding in RDH. In [22], Li and Li employ HS to the histogram of encrypted image, in which the histogram is expanded by applying the homomorphic multiplication based on the public-key cryptosystem and shifted by applying the homomorphic addition property to embed message. The advantage of this approach is that by ensuring the high security of the encryption, the embedding rate can be reached to 1 bit per pixel (bpp), and embedded message can be extracted accurately. In addition, although ciphertext is expanded and shifted, there is no data expansion during the process of RDH. However, the homomorphic encryption will result in up to 2 times data expansion, which means the size of encrypted image and marked encrypted image will be significantly larger than the original image. Compared with steam cipher, homomorphic encryption has higher security level, but the expansion rate is too high to cause difficulties in data transmission.
A fair offline electronic cash scheme with multiple-bank in standard model
Published in Journal of the Chinese Institute of Engineers, 2019
Yuxi Li, Fucai Zhou, Zifeng Xu
The computation costs are defined as follows: (1) The elliptic curve computation costs: ECe is exponentiation operation, ECm is the point scalar multiplication operation on elliptic curve, ECa is two points addition operation on elliptic curve, ECp is the pairing operation on elliptic curve. (2) Other computation costs: I is the computation cost of the inverse operation, M is the multiplication operation in a modulo, H is the computation cost of one-way hash function. Our scheme is based on elliptic curves. Compared with RSA, to reach the same security level, the key length is much shorter. For example, in elliptic curves, the key in 192 bits length has the same security level compared with the key in 1024 bits length in RSA.