Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Li Li 0077

dblp:53/2189-77 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-9204-1480ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 33% Storage systems · 33% Hardware reliability and fault tolerance · 33%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.412020
Proofs of Physical Reliability for Cloud Storage Systems · IEEE Trans. Parallel Distributed Syst. 2020
Hardware reliability and fault tolerance
fault tolerance verification
0.412020
Proofs of Physical Reliability for Cloud Storage Systems · IEEE Trans. Parallel Distributed Syst. 2020
Storage systems
storage reliability
0.412020
Proofs of Physical Reliability for Cloud Storage Systems · IEEE Trans. Parallel Distributed Syst. 2020
Cryptographic protocols and secure computation › verifiable storage › proof of storage
proof of retrievability
0.112020
Proofs of Physical Reliability for Cloud Storage Systems · IEEE Trans. Parallel Distributed Syst. 2020

Methods — techniques the papers use, named apart from their topics

timing test · 0.9storage integrity verification · 0.9
YearPublicationVenuePosition
2020 Proofs of Physical Reliability for Cloud Storage Systems
abstract
Cloud service providers (CSPs) promise to reliably store repositories outsourced by clients. Unfortunately, once files have left the client's control, he has no means to verify their redundant storage. In this article, we develop Proof of Physical Reliability (PoPR) auditing mechanisms that prove that a CSP stores an outsourced repository across multiple physical storage nodes. A PoPR complements the existing proof-of-retrievability (PoR) and proof-of-data possession (PDP) methods that are concerned with file retrievability, but without any verification of the fault-tolerance to physical storage nodes failures. A PoPR goes beyond retrievability by verifying that a file is redundantly stored across multiple physical storage nodes according to a pre-agreed layout and can, therefore, survive node failures. The verification mechanism relies on a combination of storage integrity and timing tests on the simultaneous retrieval of a collection of file symbols from multiple storage nodes. Compared to the state-of-the-art, our approach accommodates CSPs with heterogeneous storage devices (hard disks, SSDs, etc.) and does not assume constant data processing nor network delays. Instead, it can operate under any delayvariance, because it relies only on (loose) delay bounds. We analytically prove the security of our construction and experimentally validate its success in heterogeneous storage settings.
Li Li 0077, Loukas Lazos
IEEE Trans. Parallel Distributed Syst.1