Proofs of Replicated Storage Without Timing Assumptions-Reference-Cited by-同舟云学术

Proofs of Replicated Storage Without Timing Assumptions

Published:2019 Issue: Volume: Page:355-380
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2019
language:
Short-container-title:

Author:

Damgård Ivan,Ganesh Chaya,Orlandi Claudio

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-26948-7_13

Reference27 articles.

1. Lecture Notes in Computer Science;H Abusalah,2017

2. Armknecht, F., Barman, L., Bohli, J.-M., Karame, G.O.: Mirror: enabling proofs of data replication and retrievability in the cloud. In: USENIX Security Symposium, pp. 1051–1068 (2016)

3. Lecture Notes in Computer Science;D Boneh,2018

4. Barsoum, A.F., Anwar Hasan, M.: On verifying dynamic multiple data copies over cloud servers. IACR Cryptology ePrint Archive 2011, p. 447 (2011)

5. Cecchetti, E., Fisch, B., Miers, I., Juels, A.: PIEs: public incompressible encodings for decentralized storage. Cryptology ePrint Archive, Report 2018/684 (2018). https://eprint.iacr.org/2018/684

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SoK: Decentralized Storage Network;High-Confidence Computing;2024-09

2. nPPoS: Non-interactive Practical Proof-of-Storage for Blockchain;Blockchain: Research and Applications;2024-07

3. Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation;Lecture Notes in Computer Science;2024

4. Web3: Exploring Decentralized Technologies and Applications for the Future of Empowerment and Ownership;Blockchains;2023-12-11

5. PoRt: Non-Interactive Continuous Availability Proof of Replicated Storage;Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing;2023-03-27