Product counterfeiting is an on-going problem in supply chains and retail environments, Recently an anti-counterfeiting protocol to address this issue via cost-effective use of auto-identification technologies such as radio-frequency identification (RFID) was proposed by researchers.Yet the use case of re-selling the same product was not been fully addressed which might cause serious problem for the exciting and proposed schemes and transactions. This paper proposes an extended RFID-based anti-counterfeiting to address the use case of the original buyer reselling the same item to a second buyer. The extended scheme will be followed by a formal security analysis to show that the proposed protocol satisfies the requirements of security correctness and is resistant to compromise through security attacks.

Counterfeiting and theft have always been problems that incur high costs and results in considerable losses for the international markets. In this research paper, we will address the issue of counterfeiting while using RFID technology in retailer systems or other industries by presenting a new anti-counterfeiting and anti-theft system for the retailer market. This system will address the two above mentioned issues and provide a solution that can save the retailer systems millions of dollars yearly. This proposed system will achieve the objective of preventing or minimising the counterfeiting and theft of tagged products. At the same time, it will provide a strong indication for suspiciously sold or obtained items. Furthermore, we conducted a security analysis to prove the correctness of our protocol on the basis of the strand spaces.

Counterfeiting electronic components is a serious problem for the security and reliability of any electronic systems. Unfortunately, the number of counterfeit components has increased considerably after the introduction of horizontal semiconductor supply chain. In this paper, we propose a new method for detecting recycled Flash memory, a major target of the counterfeiters due to its ubiquitous usage. Proposed method is based on measurement of change in Flash array characteristics (such as erase time, program time, fail bit count, etc.) with its usage. We find that erase time is the best metric to distinguish a used Flash chip from a fresh one for the following reasons: (1) erase time shows minimal variation among different fresh memory blocks/chip and (2) erase time increases significantly with usage. We verify our method for a wide range of commercial off the shelf Flash chips from several vendors, technology nodes, storage density and storage type (single-bit per cell and multi-bit per cell). The minimum detectable chip usage varies from 0.05% to 3.0% of its total lifetime depending on the exact details of the chip.

Information encryption and anti-counterfeiting play an important role in many aspects of daily life, such as in minimizing economic losses, protecting secure communication and public security, and so on. Owing to the high information capacity and ease of operation, luminescent materials for advanced information encryption and anti-counterfeiting are essential to meet the increasing demand on encryption security. Herein, we summarize two emerging luminescent materials for information encryption and anti-counterfeiting, the AIE materials and room-temperature phosphorescent materials. At last, we discuss the opportunities and anticipations of these two information encryption and anti-counterfeiting materials.

Semi-supervised consensus clustering is a promising strategy to compensate for the subjectivity of clustering and its sensitivity to design factors, with various techniques being recently proposed to integrate domain knowledge and multiple clustering partitions. In this article we present a new approach that makes double use of domain knowledge, namely to build the initial partitions as well as to combine them. In particular, we show how to model and integrate must-link and cannot-link constraints into the objective function of a generic consensus clustering (??) framework that maximizes the similarity between the consensus partition and the input partitions, which have, in turn, been enriched with the same constraints. In addition, borrowing from the theory of functional dependencies, the integrated framework exploits the notions of deductive closure and minimal cover to take full advantage of the logical implication between constraints. Using standard UCI benchmarks, we found that the resulting algorithm, termed ??? (double-Constrained Consensus Clustering), was more effective than plain ?? at combining base constrained partitions. We then argue that ??? is especially well-suited to profiling counterfeit e-commerce websites, because constraints can be acquired by leveraging specific domain features, and demonstrate its potential for detecting affiliate marketing programs. Taken together, our experiments suggest that ??? makes the process of clustering more robust and able to withstand changes in clustering algorithms, datasets, and features, with a remarkable improvement of average performance.