Designated Attribute-Based Proofs for RFID Applications
نویسندگان
چکیده
Recent research has shown that using public-key cryptography for RFID tags is not only necessary in order to meet privacy requirements, but also now practically feasible. This has led to the development of new protocols like the Randomized Schnorr [6] identification. This protocol ensures that the identity of a tag only becomes known to the intended reader, and not to any eavesdropping party. In this paper we generalize that protocol by introducing an attributebased identification scheme. The proposed scheme preserves the designation of verification (i.e., only a legitimate reader is able to learn the identity of a tag) while it allows tags to prove any subset of their attributes to eligible readers. The proposed scheme is proven to be secure and narrow-strong private.
منابع مشابه
RSPAE: RFID Search Protocol based on Authenticated Encryption
Search protocols are among the main applications of RFID systems. Since a search protocol should be able to locate a certain tag among many tags, not only it should be secure against RFID threats but also it should be affordable. In this article, an RFID-based search protocol will be presented. We use an encryption technique that is referred to as authenticated encryption in order to boost the ...
متن کاملEnhancing privacy of recent authentication schemes for low-cost RFID systems
Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important for end-users. To this aim, different RFID authentication protocols have been proposed, which have tried to provide security and privacy of RFID users. In this paper, we a...
متن کاملDesignated Attribute Proofs with the Camenisch–Lysyanskaya Signature
An attribute-based credential (ABC), an authentic personal electronic piece of information to perform transactions, offers a secure and privacy-preserving method to authorize user transactions. One of the most important techniques to realize ABCs is the Camenisch–Lysyanskaya signature. In this paper we extend its underlying cryptographic algorithms with the designation property. As a result, th...
متن کاملAnonymous Coexistence Proofs for RFID Tags
In a world with RFID carriers everywhere, the coexistence proof of multiple RFID-tagged objects shown at the same time and the same place can become a very useful mechanism and be adopted in many application areas such as computer forensics, evi-dences in law, valuables security, and warning or notification systems, etc. In order to support the correctness of derived proofs, it is necessary to ...
متن کاملWide Strong Private RFID Identification based on Zero-Knowledge
We present the first wide-forward-insider and wide-strong RFID identification protocols that are based on zero-knowledge. Until now these notions have only been achieved by schemes based on IND-CCA2 encryption. We discuss why wideforward-insider privacy is sufficient for most practical applications. Rigorous proofs in the standard model are provided for the security and privacy properties of ou...
متن کامل