RFID (Radio Frequency Identification) systems are emerging as one of the most pervasive computing technologies in history due to their low cost and their broad applicability. Latest technologies have brought costs down and standards are being developed. Actually, RFID is mostly used as a medium for numerous tasks including managing supply chains, tracking livestock, preventing counterfeiting, controlling building access, and supporting automated checkout. The use of RFID is limited by security concerns and delays in standardization. This paper presents some research done on RFID, the RFID applications and RFID data security.
The blockchain-based electronic voting (e-voting) system, offers universities a safe, easy-to-use platform that enhances accuracy and integrity. Despite that, it is challenging to integrate the blockchain-based e-voting system with current platforms and private data. Managing latency is another requirement during the blockchain transactions (votes/elections). In this work, we suggested a novel system that uses smart contracts on the consortium blockchain to address these constraints. The voters and electors in a university can vote and elect respecting the rules established in smart contracts. The miners validate transactions using proof of work (PoW) and proof of stake (PoS). Data integrity and voter validity are ensured via the SHA-256 hash algorithm and the ECDSA signature. The implementation results demonstrate that the suggested method works better than the state-of-the-art. exceeds the state-of-the-art in terms of gas cost and execution time.
1 July 2021 in International Journal of Information Security and Privacy
In RFID technology, communication is based on random numbers, and the numbers used there are pseudo-random too (PRN). As for the PRN, it is generated by the computational tool that creates a sequence of numbers that are generally not related. In cryptography, we usually need to generate the encrypted and decrypted keys, so that we can use the genetic algorithm (GA) to find and present those keys. In this paper, the authors use the GA to find the random keys based on GA operators. The results of this generation attempt are tested through five statistical tests by which they try to determine the keys that are mostly responsible for message-encryption.
In Content-Centric Networking (CCN), Routing is intrinsically more difficult than routing in the traditional IP networks. Strategic content replication techniques reduce response time and the amount of network resources (e.g. bandwidth and server load). Thus, more than one path can be followed to reach the same content. however, each router does not have all information of cached data in the network, which makes it difficult for nodes to know the shortest path to forward interests. CCN as a networking architecture needs to define concise methods to control traffic when multipath is used to access to the same object. In this paper we will make an attempt to model a simplified subset of the general phenomena of multipath traffic control that we suppose can be described using some of the tools provided by notions imported from Game Theory.