面向 PLS 区块链的索引结构
Indexing structures for the PLS blockchain
AI总结：
针对 PLS 区块链低功耗 IoT 客户端的通信最小化问题，本文用 Tunstall 压缩位图索引生成不存在证明，并以伪随机双射函数抑制相关访问导致的压缩退化。
摘要：
本文从一个新的视角研究已知的索引结构：最小化充当区块链客户端的 IoT 设备与运行包含两个 Guy Fawkes 协议（PLS 和 SLVP）的协议套件的区块链服务器之间的数据交换。PLS 区块链并非加密货币工具；它是一种不可变账本，无需使用公钥密码学即可为低功耗客户端提供有保证的不可否认性。该情形的新颖之处在于，每个 PLS 客户端都必须在其交易对手未参与贡献的链上所有区块中获得不存在证明，而我们证明无需遍历区块的 Merkle 树即可实现这一点。作为基础情形，我们从理论上得出了稀疏 Merkle 树上叶子路径的权重统计数据。利用该理论，我们量化了客户端与区块链交互的通信成本。我们表明，通过提供使用 Tunstall 方法压缩的树的位图索引，可以实现大幅节省。我们进一步表明，即使在相关访问的情况下，例如两个 IoT 设备在连续区块中相互发布消息，也可以通过使用伪随机双射函数对 ID 进行重新随机化来防止压缩性能下降。我们提出了一种此类低成本函数，并通过仿真利用雪崩准则评估了其质量。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
