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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anurag Kompalli

dblp:338/7141 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-5883-2086ORCID · reported

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

Security and privacy · 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%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
smart contract security
0.712023
TxT: Real-Time Transaction Encapsulation for Ethereum Smart Contracts · IEEE Trans. Inf. Forensics Secur. 2023
Blockchain and cryptocurrency security › smart contract security
vulnerability detection
0.712023
TxT: Real-Time Transaction Encapsulation for Ethereum Smart Contracts · IEEE Trans. Inf. Forensics Secur. 2023
Software testing › non-functional testing
security testing
0.712023
TxT: Real-Time Transaction Encapsulation for Ethereum Smart Contracts · IEEE Trans. Inf. Forensics Secur. 2023
Software testing
smart contract testing
0.712023
TxT: Real-Time Transaction Encapsulation for Ethereum Smart Contracts · IEEE Trans. Inf. Forensics Secur. 2023

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

transaction encapsulation · 1.3execution path replicability analysis · 1.3
YearPublicationVenuePosition
2023 TxT: Real-Time Transaction Encapsulation for Ethereum Smart Contracts
abstract
Ethereum is a permissionless blockchain ecosystem that supports execution of smart contracts, the key enablers of decentralized finance (DeFi) and non-fungible tokens (NFT). However, the expressiveness of Ethereum smart contracts is a double-edged sword: while it enables blockchain programmability, it also introduces security vulnerabilities, i.e., the exploitable discrepancies between expected and actual behaviors of the contract code. To address these discrepancies and increase the vulnerability coverage, we propose a new smart contract security testing approach called transaction encapsulation. The core idea lies in the local execution of transactions on a fully-synchronized yet isolated Ethereum node, which creates a preview of outcomes of transaction sequences on the current state of blockchain. This approach poses a critical technical challenge — the well-known time-of-check/time-of-use (TOCTOU) problem, i.e., the assurance that the final transactions will exhibit the same execution paths as the encapsulated test transactions. In this work, we determine the exact conditions for guaranteed execution path replicability of the tested transactions. To demonstrate the transaction encapsulation, we implement a transaction testing tool, TxT, which reveals the actual outcomes (either benign or malicious) of Ethereum transactions. To ensure the correctness of testing, TxT deterministically verifies whether a given sequence of transactions ensues an identical execution path on the current state of blockchain. We analyze over 1.3 billion Ethereum transactions and determine that 96.5% of them can be verified by TxT. We further show that TxT successfully reveals the suspicious behaviors associated with 31 out of 37 vulnerabilities (83.8% coverage) in the smart contract weakness classification (SWC) registry. In comparison, the vulnerability coverage of all the existing defense approaches combined only reaches 40.5%.
Qiben Yan 0001, Anurag Kompalli
IEEE Trans. Inf. Forensics Secur.3