TY - GEN
T1 - GEM 2-tree
T2 - 35th IEEE International Conference on Data Engineering, ICDE 2019
AU - Zhang, Ce
AU - Xu, Cheng
AU - XU, Jianliang
AU - Tang, Yuzhe
AU - CHOI, Koon Kau
N1 - Funding Information:
ACKNOWLEDGEMENTS This work was supported by Research Grants Council of Hong Kong under GRF Projects 12201018, 12244916, and CRF Project C1008-16G. Yuzhe Tang was partially supported by the National Science Foundation under Grant CNS-1815814, CUSE grant 286056 and a gift from Intel.
PY - 2019/4
Y1 - 2019/4
N2 - Blockchain technology has attracted much attention due to the great success of the cryptocurrencies. Owing to its immutability property and consensus protocol, blockchain offers a new solution for trusted storage and computation services. To scale up the services, prior research has suggested a hybrid storage architecture, where only small meta-data are stored on-chain and the raw data are outsourced to off-chain storage. To protect data integrity, cryptographic proof can be constructed online for queries over the data stored in the system. However, the previous schemes only support simple key-value queries. In this paper, we take the first step toward studying authenticated range queries in the hybrid-storage blockchain. The key challenge lies in how to design an authenticated data structure (ADS) that can be efficiently maintained by the blockchain, in which a unique gas cost model is employed. By analyzing the performance of the existing techniques, we propose a novel ADS, called GEM2-tree, which is not only gas-efficient but also effective in supporting authenticated queries. To further reduce the ADS maintenance cost without sacrificing much the query performance, we also propose an optimized structure, GEM2∗-tree, by designing a two-level index structure. Theoretical analysis and empirical evaluation validate the performance of the proposed ADSs.
AB - Blockchain technology has attracted much attention due to the great success of the cryptocurrencies. Owing to its immutability property and consensus protocol, blockchain offers a new solution for trusted storage and computation services. To scale up the services, prior research has suggested a hybrid storage architecture, where only small meta-data are stored on-chain and the raw data are outsourced to off-chain storage. To protect data integrity, cryptographic proof can be constructed online for queries over the data stored in the system. However, the previous schemes only support simple key-value queries. In this paper, we take the first step toward studying authenticated range queries in the hybrid-storage blockchain. The key challenge lies in how to design an authenticated data structure (ADS) that can be efficiently maintained by the blockchain, in which a unique gas cost model is employed. By analyzing the performance of the existing techniques, we propose a novel ADS, called GEM2-tree, which is not only gas-efficient but also effective in supporting authenticated queries. To further reduce the ADS maintenance cost without sacrificing much the query performance, we also propose an optimized structure, GEM2∗-tree, by designing a two-level index structure. Theoretical analysis and empirical evaluation validate the performance of the proposed ADSs.
KW - Authenticated query
KW - Blockchain
KW - Range query
KW - Smart contract
UR - http://www.scopus.com/inward/record.url?scp=85067969489&partnerID=8YFLogxK
U2 - 10.1109/ICDE.2019.00080
DO - 10.1109/ICDE.2019.00080
M3 - Conference contribution
AN - SCOPUS:85067969489
T3 - Proceedings - International Conference on Data Engineering
SP - 842
EP - 853
BT - Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019
PB - IEEE Computer Society
Y2 - 8 April 2019 through 11 April 2019
ER -