Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nianyi Liu

dblp:309/6397 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Blockchain and cryptocurrency security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security › consensus protocol
proof-of-work
0.712023
Blockchain Mining With Multiple Selfish Miners · IEEE Trans. Inf. Forensics Secur. 2023
Blockchain and cryptocurrency security › mining attack
selfish mining
0.712023
Blockchain Mining With Multiple Selfish Miners · IEEE Trans. Inf. Forensics Secur. 2023
Distributed systems
consensus
0.212023
Blockchain Mining With Multiple Selfish Miners · IEEE Trans. Inf. Forensics Secur. 2023

Methods — techniques the papers use, named apart from their topics

partially observable markov decision process · 1.3online algorithm · 1.3markov chain · 1.3
YearPublicationVenuePosition
2023 Blockchain Mining With Multiple Selfish Miners
abstract
This paper studies a fundamental problem regarding the security of blockchain PoW consensus on how the existence of multiple misbehaving miners influences the profitability of selfish mining. Each selfish miner maintains a private chain and makes it public opportunistically for acquiring more rewards incommensurate to his Hash power. We first establish a general Markov chain model to characterize the state transition of public and private chains for Basic Selfish Mining (BSM), and derive the stationaryprofitable thresholdof Hash power in closed form. It reduces from 25% for a single attacker to below 21.48% for two symmetric attackers theoretically, and further reduces to around 10% with eight symmetric attackers experimentally. We next explore the profitable threshold when one of the attackers performs strategic mining based on Partially Observable Markov Decision Process (POMDP) that only half of the attributes pertinent to a mining state are observable to him. An online algorithm is presented to compute the nearly optimal policy efficiently despite the large state space and high dimensional belief space. The profitable threshold is much lower for the strategic attacker. Last, we formulate a simple model of absolute mining revenue that yields an interesting observation: selfish mining is never profitable at the first difficulty adjustment period, but relies on the reimbursement of stationary selfish mining gains in future periods. The delay till being profitable of an attacker increases with the decrease of his Hash power, making blockchain miners more cautious about performing selfish mining.
Qianlan Bai, Yuedong Xu 0001, Nianyi Liu
IEEE Trans. Inf. Forensics Secur.3
2022 Evolution of Transaction Pattern in Ethereum: A Temporal Graph Perspective
abstract
Ethereum is one of the most popular blockchain systems that support more than half a million transactions every day and foster miscellaneous decentralized applications with its Turing-complete smart contract machine. Whereas it remains mysterious what the transaction pattern of Ethereum is and how it evolves over time. In this article, we study the evolutionary behavior of Ethereum transactions from a temporal graph point of view. We first develop a data analytic platform to collect external transactions associated with users as well as internal transactions initiated by smart contracts. Three types of temporal graphs, user-to-user, contract-to-contract, and user-contract graphs, are constructed according to trading relationships and are segmented with an appropriate time window. We observe a strong correlation between the size of the user-to-user transaction graph and the average Ether price in a time window, while no evidence of such linkage is shown at the average degree, average edge weights, and average triplet closure duration. The macroscopic and microscopic burstiness of Ethereum transactions are validated. We analyze the Gini indexes of the transaction graphs and the user wealth in which Ethereum is found to be very unfair since the very beginning, in a sense, “the rich is already very rich.”
Qianlan Bai, Nianyi Liu, Yuedong Xu 0001, Xin Wang 0003
IEEE Trans. Comput. Soc. Syst.3