By Topic

Public verifiable proof of storage protocol from lattice assumption

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Xu ; Wuhan Nat. Lab. for Optoelectron., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Dan Feng ; Jingning Liu

Proof of storage (PoS) is an interactive protocol allowing a client to verify that the server possesses the original data without retrieving it. All of the existed PoS protocols are based on the hardness of factoring or discrete-log problems, which cannot resist quantum attacks. In this paper, we first propose a linearly homomorphic signature scheme(LHHS) from lattice assumption, and generate HTVs from LHSS. Then we construct the first lattice-based PoS protocol from the new HTVs. Our PoS protocol is public verifiable and can be proved unforgeable in random oracle model assuming that SIS problem is hard. Complexity analysis shows that the mainly computation cost in LPoS are occur in Encode phase. The communication cost in prove and verify phases is independent to the scale of the file. The client or the verifier only needs to store the verifiable tags rather than the original file blocks.

Published in:

Intelligent Control, Automatic Detection and High-End Equipment (ICADE), 2012 IEEE International Conference on

Date of Conference:

27-29 July 2012