Search

The Internet of Things (IoT) is a future trend that uses the Internet to connect a variety of physical things with the cyber world. IoT technology is rapidly evolving, and it will soon have a significant impact on our daily lives. While the growing number of linked IoT devices makes our daily lives easier, it also puts our personal data at risk. In IoT applications, Radio Frequency Identification (RFID) helps in the automatic identification of linked devices, and the dataflow of the system forms a symmetry in communication between the tags and the readers. However, the security and privacy of RFID-tag-connected devices are the key concerns. The communication link is thought to be wireless or insecure, making the RFID system open to several known threats. In order to address these security issues, we propose a robust authentication framework for IoT-based RFID infrastructure. We use formal security analysis in the random oracle model, as well as information analysis to support the claim of secure communication. Regarding the desirable performance characteristics, we describe and analyze the proposed framework's performance and compare it to similar systems. According to our findings, the proposed framework satisfies all security requirements while also improving the communication. [ABSTRACT FROM AUTHOR]

In cryptography, security models play important roles to define the security with potential attacks. Following the security models, a scheme is analysed to be secure or insecure against those considered attacks. However, certificateless signatures (CLSs) are well-known notions to solve the key escrow problem of identity-based signatures, but the adversaries’ attack power is not well defined. In typical CLS setting, the full private key is composed of two parts that are respectively generated by two different parties, and therefore, the security models will be more complicate than other systems. In general, there are two types of adversaries in CLS, and further can be extended into many security levels due to attack power. In this paper, a comprehensive study focuses on the security models of CLSs. We not only consider two security issues, public key replacement, and strong unforgeability, but also revisit all feasible and potential adversaries’ abilities. According to the research results, we show the generalization of security models which consists of all cases of the adversaries. Finally, we give a security comparison with literature works. [ABSTRACT FROM PUBLISHER]

Certificateless public key cryptography (CL-PKC) is a cryptosystem solving the key escrow problem of identity-based cryptography. One of the applications of CL-PKC is certificateless aggregate signature (CLAS) that in practice can be used to efficiently verify concealed data aggregation in wireless sensor networks. CLAS is referred to as an extension of certificateless signature, which in particular performs verification for many signatures efficiently. Therefore, not only plenty of CLAS schemes have been proposed but also the security models of CLAS were introduced in the literature. Recently, some CLAS schemes are extended from specific certificateless signature (CLS) schemes. However, we found that two certificateless signature (CLS) and their corresponding CLAS schemes are not secure. In this paper, we simplify the relation of security definitions of CLS and CLAS. Then, a new CLAS scheme is proposed, which leads to the advantages of both certificateless cryptography and aggregate signature. Moreover, our scheme only depends on constant pairing operations to verify a large number of signatures per time, because pairing is a complicated operation with high cost in computations. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

User identification plays an important role for access control in networks. Recently, Hsu and Chuang proposed a user identification scheme for distributed computer networks, which can also provide key agreement and user anonymity. However, Tsai pointed out the weakness of Hsu-Chuang's scheme and proposed an improved scheme. In this paper, we present two attacks to examine that some user identification schemes have a serious security loophole. Finally, we propose a new user identification scheme, which is more secure than the existing schemes. [ABSTRACT FROM AUTHOR]

In visual cryptography (VC), cheating is an important security concern where dishonest participants will fool honest ones and make them accept a fake secret by providing fake shares. Share and blind authentications are two categories of cheating prevention, and the last one relies on the inherent robust of shares against cheating attacks. In the previous studies, cheating in VC only focuses on operating a 'pixel block' instead of a region of adjacent pixels. However, the well-known advantage of VC is to decode the secret image by using the human vision system (HVS), so it leads to a natural issue to reconsider cheating a region. In this paper, we formally address the binocular cheating attack (BCA) for a region to augment effectiveness of original cheating for a block. Finally, we demonstrate how to realize BCA by presenting non-trivial techniques against some blind authentication schemes, and further obtain implausible results. The BCA can also be applied to halftone secret. [ABSTRACT FROM AUTHOR]

Highlights: [•] This paper introduces a new notion of encrypted signal-based reversible data hiding (ESRDH). [•] The proposed ESRDH scheme allows multiple signal providers and data hiders. [•] The experimental results show that this scheme provides high payload and quality. [Copyright &y& Elsevier]

Abstract: Visual cryptography (VC), first presented by Naor and Shamir, is a variant of secret sharing, thus it also called visual secret sharing. It can be widely used in many applications such as encrypting large data efficiently. In the literature, the problem of cheating is under consideration in secret sharing. Recently, Horng et al. pointed out that cheating is possible in k-out-of-n VC schemes, and presented two kinds of the cheating prevention schemes for protecting honest participants. One of them is the authentication based cheating prevention scheme. In this paper, we analyze the definition of cheating prevention and propose a new authentication based cheating prevention scheme. This scheme is constructed with Naor–Shamir’s VC scheme. Finally, we give the security analysis to prove that the proposed scheme is immune to cheating. [Copyright &y& Elsevier]