Gongliang Chen

A New Ultralightweight RFID Authentication Protocol with Permutation

One of the key problems in RFID is security and privacy. The implementation of authentication protocols is a flexible and effective way to solve this problem. This letter proposes a new ultralightweight RFID authentication protocol with permutation (RAPP). RAPP avoids using unbalanced OR and AND operations and introduces a new operation named permutation. The tags only involve three operations: bitwise XOR, left rotation and permutation. In addition, unlike other existing ultralightweight protocols, the last messages exchanged in RAPP are sent by the reader so as to resist de-synchronization attacks. Security analysis shows that RAPP achieves the functionalities of the authentication protocol and is resistant to various attacks. Performance evaluation illustrates that RAPP uses fewer resources on tags in terms of computation operation, storage requirement and communication cost.

Provably secure E-cash system with practical and efficient complete tracing

E-cash system can guarantee the anonymity of the user, but it also can be misused illegally. So the idea of fair E-cash was introduced, i.e., the anonymity of the user can be revoked when a crime is involved in fair E-cash system. However, it is still an unsolved problem to design a practical and efficient fair E-cash scheme, since there are some problems of the impracticality or the incompleteness in the tracing design of existing schemes. First we discuss the principal reasons of it. The reason of impractical tracing is that many schemes have respective unsolved problems in designing the practical tracing. We solve one kind of the problems, then present the practical tracings in various situations, including the bank’s double-spending tracing without the trusted third party (TTP), the TTP’s unconditional tracing and the bank’s loss-coin tracing without TTP, which we call complete tracing. For some schemes, the reason of incomplete tracing is that the unsolved efficiency problems result in the incomplete design of tracing, whereas for other schemes, the reason of incomplete tracing is that the unconditional tracing and the anonymous spending are contradicting properties of E-cash. Considering that, the TTP can be divided into multiple parties, and the TTP is also removable in our system. Moreover, for solving the efficiency problem of practical tracing, we use a nested structure of signature of knowledge in payment protocol, which is proved to be a secure application. Then we provide the detailed security proofs of all security properties of our E-cash scheme and analyze our system efficiency and system functions comparing with the recent schemes.

An Effective Temporary ID Based Query Tree Algorithm for RFID Tag Anti-collision

This paper proposes an effective temporary ID based query tree algorithm (TID QTA) for RFID tag anti-collision. Tags with 96-bit UID are mainly concerned. In TID QTA, a 16-bit sequence is selected from tag ID as its TID and query tree algorithm is implemented based on TID. If two tags have the same TID, they will renew their TIDs by selecting another 16 bits from their IDs. The simulation results show that the average number of transmitted bits for one tag identification in TID QTA is the fewest among QTA and its variants.

Quavium - A New Stream Cipher Inspired by Trivium

This paper is concerned with an extensive form of stream cipher Trivium. Trivium is extended to a scalable form by the coupling connection of Trivium-like shift registers. The characteristic polynomial of k Trivium-like shift registers in coupling connection is proved to have a factor of (1+ x ) k . So k -order primitive polynomials are defined in this paper. As the main contribution, a new stream cipher Quavium is proposed based on 4-round Trivium-like shift registers and k -order primitive polynomials. Quavium can also be used with 3 rounds. Experimental results show that Quavium is nearly as fast as Trivium and 3-round Quavium has a better performance.

A provably secure and practical fair E-cash scheme

By analyzing some current fair E-cash schemes, we find they are not always “fair” or “practical”. So we present a new scheme based on group signature with the problems solved. In our improved E-cash system, bank performs “double-spending owner tracing” and trusted authority performs “unconditional owner tracing” and “unconditional coin tracing” when necessary. Then we provide security proofs of our scheme under standard assumptions.

Practical Traceable E-cash System with Loss Register

Trusted third party is customer-tracer and E-coin-tracer in many E-cash schemes based on group signature, but it is not always the case in reality. In our improved E-cash system, bank traces double-spender and trusted authority traces E-coin and E-coin owner when necessary. Another contribution of this paper is that customer can register his lost E-coin with bank, that is overlooked in all former E-cash schemes. Then we prove the security of our scheme.