Towards Privacy-assured and Lightweight On-chain Auditing of Decentralized Storage
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Title of host publication | Proceedings - 2020 IEEE 40th International Conference on Distributed Computing Systems |
Subtitle of host publication | ICDCS 2020 |
Publisher | Institute of Electrical and Electronics Engineers, Inc. |
Pages | 201-211 |
ISBN (electronic) | 9781728170022 |
ISBN (print) | 9781728170039 |
Publication status | Published - Nov 2020 |
Publication series
Name | |
---|---|
ISSN (Print) | 1063-6927 |
ISSN (electronic) | 2575-8411 |
Conference
Title | 40th IEEE International Conference on Distributed Computing Systems (ICDCS 2020) |
---|---|
Location | Virtual |
Place | Singapore |
Period | 29 November - 1 December 2020 |
Link(s)
Abstract
How to audit outsourced data in centralized storage like cloud is well-studied, but it is largely under-explored for the rising decentralized storage network (DSN) that bodes well for a billion-dollar market. To realize DSN as a usable service in a fully decentralized manner, the blockchain comes in handy — to record and verify audit trails in forms of proof of storage, and based on that, to enforce fair payments with necessary dispute resolution.
Leaving the audit trails on the blockchain offers transparency and fairness, yet it 1) sacrifices privacy, as they may leak information about the data under audit, and 2) overwhelms on-chain resources, as they may be practically large in size and expensive to verify. Prior auditing designs in centralized settings are not directly applicable here. A handful of proposals targeting DSN cannot satisfactorily address these issues either.
We present an auditing solution that addresses on-chain privacy and efficiency, from a synergy of homomorphic linear authenticators with polynomial commitments for succinct proofs, and the sigma protocol for provable privacy. The solution results in, per audit, 288-byte proof written to the blockchain, and constant verification cost. It can sustain long-term operation and easily scale to thousands of users on Ethereum.
Leaving the audit trails on the blockchain offers transparency and fairness, yet it 1) sacrifices privacy, as they may leak information about the data under audit, and 2) overwhelms on-chain resources, as they may be practically large in size and expensive to verify. Prior auditing designs in centralized settings are not directly applicable here. A handful of proposals targeting DSN cannot satisfactorily address these issues either.
We present an auditing solution that addresses on-chain privacy and efficiency, from a synergy of homomorphic linear authenticators with polynomial commitments for succinct proofs, and the sigma protocol for provable privacy. The solution results in, per audit, 288-byte proof written to the blockchain, and constant verification cost. It can sustain long-term operation and easily scale to thousands of users on Ethereum.
Bibliographic Note
Research Unit(s) information for this publication is provided by the author(s) concerned.
Citation Format(s)
Towards Privacy-assured and Lightweight On-chain Auditing of Decentralized Storage. / Du, Yuefeng; Duan, Huayi; ZHOU, Anxin et al.
Proceedings - 2020 IEEE 40th International Conference on Distributed Computing Systems: ICDCS 2020. Institute of Electrical and Electronics Engineers, Inc., 2020. p. 201-211 9355771.
Proceedings - 2020 IEEE 40th International Conference on Distributed Computing Systems: ICDCS 2020. Institute of Electrical and Electronics Engineers, Inc., 2020. p. 201-211 9355771.
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review