Proofs of Writing for Robust Storage
- Submitting institution
-
The University of Lancaster
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 277360423
- Type
- D - Journal article
- DOI
-
10.1109/TPDS.2019.2919285
- Title of journal
- IEEE Transactions on Parallel and Distributed Systems
- Article number
- -
- First page
- 2547
- Volume
- 30
- Issue
- 11
- ISSN
- 1045-9219
- Open access status
- Deposit exception
- Month of publication
- May
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
I - Security
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper makes 2 fundamental contributions. It established a counter-intuitive result that negated established bounds to show that, in the presence of attackers, the cost of memory Reads in Client-Server storage can be twice as expensive as Writes. The seminal concept of 'Proof of Writing', where a server implicitly obtains a proof that a Write action has completed, solved the problem initially for a single Reader/Writer scenario (CCS 2013), this paper establishes the validity in the generalized multiple Reader/Writer scenario and proved linearizability. The concept forms the foundation of the IBM's Hyperledger Blockchain platform that is now deployed worldwide.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
