In order to enhance shared control of the secret among multiple RFID tags and to ensure secure communication through an insecure channel, we present in this paper a new idea of threshold RFID system. We extend well-kn...
详细信息
In order to enhance shared control of the secret among multiple RFID tags and to ensure secure communication through an insecure channel, we present in this paper a new idea of threshold RFID system. We extend well-known Vaudenay's RFID privacy model (Vaudenay in Adv Cryptolo 68-87, 2007) to make the RFID system acceptable for threshold secret sharing system among n tags. To show its implementation and to resist tag compromising attack, we design an efficient threshold RFID authentication protocol based on physical unclonable functions. It is a method of distributing a secret s among a set of n RFID tags in such a way that any set of t(t < n) or more tags will recover the shared secret s only after successful mutual authentication while the secret will remain uncertain if any of them will be unauthorized tag or a group of t - 1 or less tags have given their information. In order to enhance tag anonymity, we use dynamic security parameters which are updated after each successful run of mutual authentication session. Furthermore, via analyzing security and privacy formally and informally, we demonstrate that our scheme achieves destructive privacy and withstand against various known attacks.
The objective of self-healing key distribution is to enable group users to recover session keys by themselves, without requesting additional transmissions from the group manager (GM), even when they miss some broadcas...
详细信息
The objective of self-healing key distribution is to enable group users to recover session keys by themselves, without requesting additional transmissions from the group manager (GM), even when they miss some broadcast messages. one major benefit of the self-healing key distribution mechanism is the reduction of energy consumption due to the elimination of such additional transmission. Also in some applications, e.g., uni-directional broadcast channel from the GM, the self-healing key distribution mechanism seems to be the ideal solution. Desired features of self-healing key distribution schemes include energy awareness, short broadcast message, efficient users addition, revocation and so on. A primary challenge is managing the trade-off between providing an acceptable level of security and conserving scarce resources in particular energy which is critical for wireless network operations. Over a decade, a great number of self-healing key distribution schemes have been proposed for establishing a group key amongst a dynamic group of users over an unreliable, or lossy, network. In this paper a comprehensive survey is conducted on the state-of-the-art in the field of self-healing key distribution. First, we clarify the security requirements of self-healing key distribution scheme for their special application environment. Then, we present a classification of self-healing key distribution schemes according to different cryptographic primitives, and give an insight to their features and goals. Furthermore, we consider several problems, namely authentication on broadcast messages, sponsorization and mutual-healing, related to the robustness of self-healing key distribution schemes. At last, we delineate their similarities and differences and outline several future research directions.
In this paper, we propose a new chaotic neural network called the Merkle-Damgaard (CNN-MD) iterative structure, which we designed from the perspective of resisting attacks, such as length extension, second original im...
详细信息
In this paper, we propose a new chaotic neural network called the Merkle-Damgaard (CNN-MD) iterative structure, which we designed from the perspective of resisting attacks, such as length extension, second original image, Joux multiple collision, and intermediate encounter attacks. A new chaotic hashfunction based on the CNN-MD is presented. First, CNN is used as the compression function of CNN-MD, which ensures both the unidirectionality of data compression and the sensitivity of the hash value. Furthermore, the multi-input single-output construction of the CNN can achieve highly efficient data compression. In addition, in the process of group encryption of data, we use the value padding of coupled lattice mapping to improve the alignment of the plaintext of the MD algorithm. This new alignment can enhance the hashfunction's collision resistance and the CNN-MD sensitivity. Experimental and theoretical analyses show that our proposed hashing algorithm can resist attacks, such as second original image, brute force, and multiple collision attacks, better than MD5, SHA-1, and SHA-2 algorithms. In terms of speed, our proposed hashing algorithm can successfully handle existing commercial scenarios better than MD5, SHA-1, SHA3, and other methods. Therefore, the hash algorithm proposed in this study can be applied to existing e-commerce scenarios. (c) 2021 Elsevier Ltd. All rights reserved.
Medication errors can cause substantial harm to patients. Automated patient medication system with RFID technology is purposely used to reduce the medication error, to improve the patient safety, to provide personaliz...
详细信息
Medication errors can cause substantial harm to patients. Automated patient medication system with RFID technology is purposely used to reduce the medication error, to improve the patient safety, to provide personalized patient medication and identification and also to provide counterfeit protection to the patients. In order to enhance medication safety for patients we propose a new dynamic ID based lightweight RFID authentication protocol. Due to low storage capacity and limited computational and communicational capacity of tags, only pseudo random number generator function, one way hash function and bitwise Xor operation are used in our authentication protocol. The proposed protocol is practical, secure and efficient for health care domain.
Providing efficient security method to support the distribution of multimedia multicast is a challenging issue, since the group membership in such applications requires dynamic key generation and updation which takes ...
详细信息
ISBN:
(纸本)9783642192623
Providing efficient security method to support the distribution of multimedia multicast is a challenging issue, since the group membership in such applications requires dynamic key generation and updation which takes more computation time. Moreover, the key must be sent securely to the group members. In this paper, we propose a new Key Distribution Protocol that provides more security and also reduces computation complexity. To achieve higher level of security, we use Euler's Totient function phi(n) and gcd(phi(n))in the key distribution protocol. Therefore, it increases the key space while breaking the re-keying information. Two major operations in this scheme are joining and leaving operations for managing group memberships. An N-ary tree is used to reduce number of multiplications needed to perform the member leave operation. Using this tree, we reduce the computation time when compared with the existing key management schemes.
Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and t...
详细信息
Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.
The Internet of Things (IoT) is a rising development and is an organization of all gadgets that can be gotten to through the web. As a central advancement of the IoT, wireless sensor networks (WSN) can be used to accu...
详细信息
The Internet of Things (IoT) is a rising development and is an organization of all gadgets that can be gotten to through the web. As a central advancement of the IoT, wireless sensor networks (WSN) can be used to accumulate the vital environment parameters for express applications. In light of the resource limitation of sensor devices and the open idea of remote channel, security has become an enormous test in WSN. Validation as an essential security service can be used to guarantee the authenticity of data access in WSN. The proposed three factor system using one way hash function is depicted by low computational cost, and limit overhead, while achieving all other benefits. Keys are made from secret key for meeting for improving the security. We differentiated the arrangement's security and execution with some lightweight plans. As shown by the examination, the proposed plan can give more prominent security incorporates low overhead of correspondence. Encryption and unscrambling is done using numerical thoughts and by using the possibility of hashfunction. Mathematical thoughts are lightweight and update the security up by a staggering degree by diminishing the chances of cryptanalysis. When contrasted with different calculations, the proposed calculation gives better execution results.
暂无评论