TY - GEN
T1 - PoQ
T2 - 16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020
AU - Bashar, Golam Dastoger
AU - Avila, Alejandro Anzola
AU - Dagher, Gaby G.
N1 - Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2020.
PY - 2020
Y1 - 2020
N2 - In blockchain technology, consensus protocols serve as mechanisms to reach agreements among a distributed network of nodes. Using a centralized party or consortium, private blockchains achieve high transaction throughput and scalability, Hyperledger Sawtooth is a prominent example of private blockchains that uses Proof of Elapsed Time (PoET) (SGX-based) to achieve consensus. In this paper, we propose a novel protocol, called Proof of Queue (PoQ), for private (permissioned) blockchains, that combines the lottery strategy of PoET with a specialized round-robin algorithm where each node has an equal chance to become a leader (who propose valid data blocks to the chain) with equal access. PoQ is relatively scalable without any collision. Similar to PoET, our protocol uses Intel SGX, a Trusted Execution Environment, to generate a secure random waiting time to choose a leader, and fairly distribute the leadership role to everyone on the network. PoQ scales fairness linearly with SGX machines: the more the SGX in the network, the higher the number of chances to be selected as a leader per unit time. Our analysis and experiments show that PoQ provides significant performance improvements over PoET.
AB - In blockchain technology, consensus protocols serve as mechanisms to reach agreements among a distributed network of nodes. Using a centralized party or consortium, private blockchains achieve high transaction throughput and scalability, Hyperledger Sawtooth is a prominent example of private blockchains that uses Proof of Elapsed Time (PoET) (SGX-based) to achieve consensus. In this paper, we propose a novel protocol, called Proof of Queue (PoQ), for private (permissioned) blockchains, that combines the lottery strategy of PoET with a specialized round-robin algorithm where each node has an equal chance to become a leader (who propose valid data blocks to the chain) with equal access. PoQ is relatively scalable without any collision. Similar to PoET, our protocol uses Intel SGX, a Trusted Execution Environment, to generate a secure random waiting time to choose a leader, and fairly distribute the leadership role to everyone on the network. PoQ scales fairness linearly with SGX machines: the more the SGX in the network, the higher the number of chances to be selected as a leader per unit time. Our analysis and experiments show that PoQ provides significant performance improvements over PoET.
KW - Blockchain
KW - Consensus
KW - Fairness
KW - Permissioned
KW - SGX
UR - http://www.scopus.com/inward/record.url?scp=85098268133&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-63095-9_8
DO - 10.1007/978-3-030-63095-9_8
M3 - Conference contribution
AN - SCOPUS:85098268133
SN - 9783030630942
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 141
EP - 160
BT - Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings
A2 - Park, Noseong
A2 - Sun, Kun
A2 - Foresti, Sara
A2 - Butler, Kevin
A2 - Saxena, Nitesh
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 21 October 2020 through 23 October 2020
ER -