Please use this identifier to cite or link to this item:
|Title:||Identity-based key-exposure resilient cloud storage public auditing scheme from lattices||Authors:||Zhang, Xiaojun
|Keywords:||Science::Mathematics||Issue Date:||2018||Source:||Zhang, X., Wang, H. & Xu, C. (2018). Identity-based key-exposure resilient cloud storage public auditing scheme from lattices. Information Sciences, 472, 223-234. https://dx.doi.org/10.1016/j.ins.2018.09.013||Journal:||Information Sciences||Abstract:||With the rapid development of cloud auditing services, key exposure has been highlighted as a serious security issue. Using the exposed private key of a client, cloud servers can forge previous auditing proofs to cheat auditors. To date, a few pairing-based cloud storage auditing schemes addressing key exposure have been proposed. However, they are not secure from quantum attacks, and they rely on public key infrastructure (PKI), which involves complex certificate management. In this paper, we propose an efficient identity-based key-exposure resilient public auditing scheme from lattice assumptions in cloud storage. Our scheme is not only quantum-resistant, but eliminates the need to establish a PKI. We employ lattice basis delegation technique to update a client's private key flexibly, keeping the private key size constant. Based on the hardness of lattice assumptions, we prove the forward security of storage correctness guarantee against malicious cloud servers in detail, and that the proposed scheme preserves privacy against curious auditors. Furthermore, we conduct a performance comparison to demonstrate that our scheme is much more efficient and practical for post-quantum secure cloud storage.||URI:||https://hdl.handle.net/10356/151363||ISSN:||0020-0255||DOI:||10.1016/j.ins.2018.09.013||Rights:||© 2018 Elsevier Inc. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Updated on Oct 16, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.