Indexing structures for the PLS blockchain

Abstract This 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 crypt...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Alex Shafarenko
Formato:	article
Lenguaje:	EN
Publicado:	SpringerOpen 2021
Materias:	PLS blockchain Guy Fawkes protocol Content-addressable storage Data-structure statistics Tunstall coding Pseudorandom bijections Computer engineering. Computer hardware TK7885-7895 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/722dba7688e84b629ea61f7f7128d13b
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:722dba7688e84b629ea61f7f7128d13b
record_format	dspace
spelling	oai:doaj.org-article:722dba7688e84b629ea61f7f7128d13b2021-11-08T10:44:49ZIndexing structures for the PLS blockchain10.1186/s42400-021-00101-w2523-3246https://doaj.org/article/722dba7688e84b629ea61f7f7128d13b2021-11-01T00:00:00Zhttps://doi.org/10.1186/s42400-021-00101-whttps://doaj.org/toc/2523-3246Abstract This 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.Alex ShafarenkoSpringerOpenarticlePLS blockchainGuy Fawkes protocolContent-addressable storageData-structure statisticsTunstall codingPseudorandom bijectionsComputer engineering. Computer hardwareTK7885-7895Electronic computers. Computer scienceQA75.5-76.95ENCybersecurity, Vol 4, Iss 1, Pp 1-19 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	PLS blockchain Guy Fawkes protocol Content-addressable storage Data-structure statistics Tunstall coding Pseudorandom bijections Computer engineering. Computer hardware TK7885-7895 Electronic computers. Computer science QA75.5-76.95
spellingShingle	PLS blockchain Guy Fawkes protocol Content-addressable storage Data-structure statistics Tunstall coding Pseudorandom bijections Computer engineering. Computer hardware TK7885-7895 Electronic computers. Computer science QA75.5-76.95 Alex Shafarenko Indexing structures for the PLS blockchain
description	Abstract This 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.
format	article
author	Alex Shafarenko
author_facet	Alex Shafarenko
author_sort	Alex Shafarenko
title	Indexing structures for the PLS blockchain
title_short	Indexing structures for the PLS blockchain
title_full	Indexing structures for the PLS blockchain
title_fullStr	Indexing structures for the PLS blockchain
title_full_unstemmed	Indexing structures for the PLS blockchain
title_sort	indexing structures for the pls blockchain
publisher	SpringerOpen
publishDate	2021
url	https://doaj.org/article/722dba7688e84b629ea61f7f7128d13b
work_keys_str_mv	AT alexshafarenko indexingstructuresfortheplsblockchain
_version_	1718442626952200193

Indexing structures for the PLS blockchain

Ejemplares similares