Show simple item record

dc.contributor.authorShafarenko, Alex
dc.date.accessioned2021-11-03T15:45:01Z
dc.date.available2021-11-03T15:45:01Z
dc.date.issued2021-11-02
dc.identifier.citationShafarenko , A 2021 , ' Indexing structures for the PLS blockchain ' , Cybersecurity , vol. 4 , no. 1 , 36 . https://doi.org/10.1186/s42400-021-00101-w
dc.identifier.issn2523-3246
dc.identifier.otherPURE: 26251518
dc.identifier.otherPURE UUID: 00dc0627-4a1e-4a9b-97e1-8e6b9fdf71e7
dc.identifier.otherJisc: 9b68ca83f9f645099863604e04a49e87
dc.identifier.otherpublisher-id: s42400-021-00101-w
dc.identifier.othermanuscript: 101
dc.identifier.otherScopus: 85118574424
dc.identifier.urihttp://hdl.handle.net/2299/25168
dc.description© The Author(s) 2021. This article is licensed under a Creative Commons Attribution 4.0 International License, to view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
dc.description.abstractThis paper studies known indexing structures from a new point of view: minimisation of data exchange between an IoT device acting as a blockchain client and the blockchain server running a protocol suite that includes two Guy Fawkes protocols, PLS and SLVP. The PLS blockchain is not a cryptocurrency instrument; it is an immutable ledger offering guaranteed non-repudiation to low-power clients without use of public key crypto. The novelty of the situation is in the fact that every PLS client has to obtain a proof of absence in all blocks of the chain to which its counterparty does not contribute, and we show that it is possible without traversing the block’s Merkle tree. We obtain weight statistics of a leaf path on a sparse Merkle tree theoretically, as our ground case. Using the theory we quantify the communication cost of a client interacting with the blockchain. We show that large savings can be achieved by providing a bitmap index of the tree compressed using Tunstall’s method. We further show that even in the case of correlated access, as in two IoT devices posting messages for each other in consecutive blocks, it is possible to prevent compression degradation by re-randomising the IDs using a pseudorandom bijective function. We propose a low-cost function of this kind and evaluate its quality by simulation, using the avalanche criterion.en
dc.format.extent19
dc.language.isoeng
dc.relation.ispartofCybersecurity
dc.rightsOpen
dc.subjectResearch
dc.subjectPLS blockchain
dc.subjectGuy Fawkes protocol
dc.subjectContent-addressable storage
dc.subjectData-structure statistics
dc.subjectTunstall coding
dc.subjectPseudorandom bijections
dc.titleIndexing structures for the PLS blockchainen
dc.contributor.institutionDepartment of Computer Science
dc.contributor.institutionSchool of Physics, Engineering & Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.contributor.institutionUniversity of Hertfordshire
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Physics, Engineering & Computer Science
dc.description.versiontypeFinal Published version
dcterms.dateAccepted2021-11-02
rioxxterms.versionVoR
rioxxterms.versionofrecordhttps://doi.org/10.1186/s42400-021-00101-w
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record