Learn More
A novel and interesting application of RFID was a banknote attached a tag to determine the authenticity of money and to stop counterfeits. At Financial Cryptography 2003, Juels and Pappu firstly proposed a practical RFID banknote protection scheme (RBPS) by using the optical and the electrical (RFID) contacts. RFID-enabled notes can be tracked by the legal(More)
—Recently, Wang introduced a novel (2, n) region incrementing visual cryptographic scheme (RIVCS), which can gradually reconstruct secrets in a single image with multiple security levels. In RIVCS, the secret image is subdivided into multiple regions in such a way that any t shadow images, where 2 ≤ t ≤ n, can be used to reveal the (t − 1)th region.(More)
A tag-collision problem (or missed reads) in Radio Frequency Identification (RFID) system is the event that a reader cannot identify the tag if many tags respond to a reader at the same time. The so-called M-ary (M=2, 4, 8, …) query tree protocols were proposed for tag collision arbitration. Mathys et al. showed that ternary (M=3) query tree will(More)
Many secure micropayment schemes have been proposed as the desire to support the low-value and the high-volume purchases of some e-commerce applications such as mobile commerce services or web-based interactive video services. However it seems that no one studies how to add the ability of returning changes in micropayment schemes. In this paper, we take the(More)
Recently, Rey proposed an efficient (2, <i>n</i>) matrix- based secret image sharing (MSIS) scheme based on simple binary matrix operations. However, the threshold property of Rey's (2, <i>n</i>)-MSIS scheme is compromised. Elsheh and Hamza showed a weakness that if the ranks of the singular matrices used in Rey's scheme are not low enough then one can(More)