To cite this version:Nesrine Kaaniche, Ethmane El Moustaine, Maryline Laurent. A novel zero-knowledge scheme for proof of data possession in cloud storage applications. Abstract-Recent technological advances have given rise to the popularity and success of cloud storage. However, the prospect of outsourcing an increasing amount of data to a third party and the abstract nature of the cloud foster the proliferation of security and privacy challenges, namely, the remote data possession checking. This paper addresses this critical security concern, when storing sensitive data in a cloud storage service, and the need for users to trust commercial cloud providers. It proposes a deterministic Proof of Data Possession (PDP) scheme based on Interactive Proof System (IPS) and an original usage of the GPS scheme. Our approach has several advantages. First, it supports public verifiability which releases data owners from the burden of a periodical verification. Second, it provides constant communication complexity, where the exchanged messages between the storage server and the client are composed of constant number of group elements. Third, our solution is efficient and provably secure, as it is resistant to the fraudulence of the prover and the leakage of verified data.

Security and privacy are major threats for the RFID technology today. First, the RFID passive tags prevailing in most of the RFID applications are very limited in processing power, so they cannot perform complex computations. Second, there are no RFID authentication protocols that can support both scalability and privacy at low complexity cost. In this paper, we present an adaptation of NTRU public cryptosystem for low-cost RFID tags and new efficient asymmetrical challenge/response RFID mutual authentication protocol for low-cost RFID systems based on this NTRU's adaptation. Thanks to properties of the polynomial ring in which NTRU operates we have ensured that the tag encrypts challenges using only addition and right circular shifts. The proposed authentication protocol guarantees privacy, high scalability level and low implementation complexity. It takes advantages of NTRU and HMAC features, and is resistant to all the classical security attacks including replays, tracking, man in the middle attacks, etc.

No abstract

Security and privacy for RFID systems are very challenging topics. First, the RFID passive tags prevailing in most of the RFID applications are very limited in processing power, thus making most of the ordinary security mechanisms inappropriate. Second, tags do answer to any reader requests, for this the most innovative RFID proposed protocols are not suitable whether for privacy problems or the high cost of tags. So far, a variety of public-key identification/authentication protocols have been proposed, but none of them satisfy both the security and privacy requirements within the acceptable restricted resources. Girault described a storage-computation trade-off approach of the famous GPS scheme for low cost RFID tag using t coupons stored on tag, but for moderate security level, this approach is still beyond current capabilities of low-cost RFID tags as storage capacity is the most expensive part of the hardware. Moreover, as we demonstrate the GPS scheme cannot be private against active adversary. In this paper, we present a new private efficient storagesecurity trade-off of GPS public key scheme for low-cost RFID tags. The ideas are twofold. First, the coupons are stored only on the back-end and not on the tag, so the protocol is private, the number of coupons can be much higher than in Girault's approach, and consumed coupons can be easily replaced with new ones. Second, for authenticating to the reader, the tag only needs simple integer operations, so implemention can be done in less than 1000 gate equivalents (GEs). Our approach takes advantages of the GPS scheme, and is resistant to the classical security attacks including replays, tracking, man in the middle attacks, etc.