33 citations · 49 across the 19 of their papers we have counts for
22 papers
The Anatomy of Address Poisoning on Ethereum: Funding Mechanisms, Scam Signatures, and Laundering via Tornado Cash
Son Hoang Dau, Thanh Nguyen, Phuong Duy Huynh +5
Address-Poisoning Transfer (APT) is a prevalent blockchain phishing scam in which a scammer poisons a victim's address book by generating a transfer with a phishing address that lo…
Serial Scammers and Attack of the Clones: How Scammers Coordinate Multiple Rug Pulls on Decentralized Exchanges
Phuong Duy Huynh, Son Hoang Dau, Nicholas Huppert +5
We explored the ubiquitous phenomenon of serial scammers, each of whom deployed dozens to thousands of addresses to conduct a series of similar Rug Pulls on popular decentralized e…
Architecture for Protecting Data Privacy in Decentralized Social Networks
Quang Cao, Katerina Vgena, Aikaterini-Georgia Mavroeidi +3
Centralized social networks have experienced a transformative impact on our digital era communication, connection, and information-sharing information. However, it has also raised…
Block Circulant Codes with Application to Decentralized Systems
Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau
In this paper, we design a family of block circulant codes that consist of many local codes and that satisfy three properties: (1) the code su…
Private Repair of a Single Erasure in Reed-Solomon Codes
Stanislav Kruglik, Han Mao Kiah, Son Hoang Dau +1
We investigate the problem of privately recovering a single erasure for Reed-Solomon codes with low communication bandwidths. For an code with ,…
A Family of Low-Complexity Binary Codes with Constant Hamming Weights
Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size . For every integer $\…
New results on Erasure Combinatorial Batch Codes
Phuc-Lu Le, Son Hoang Dau, Hy Dinh Ngo +1
We investigate in this work the problem of Erasure Combinatorial Batch Codes, in which files are stored on servers so that every set of servers allows a client to ret…
From Programming Bugs to Multimillion-Dollar Scams: An Analysis of Trapdoor Tokens on Uniswap
Phuong Duy Huynh, Thisal De Silva, Son Hoang Dau +3
We investigate in this work a recently emerged type of scam ERC-20 token called Trapdoor, which has cost investors billions of US dollars on Uniswap, the largest decentralised exch…
-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size
Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1
We consider the problem of designing a Private Information Retrieval (PIR) scheme on files replicated on servers that can collude or, even worse, can return incorrect answe…
Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification
Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1
Private Information Retrieval (PIR) schemes allow a client to retrieve any file of interest, while hiding the file identity from the database servers. In contrast to most existing…
TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
Son Hoang Dau, Quang Cao, Rinaldo Gagiano +9
A Batch Private Information Retrieval (batch-PIR) scheme allows a client to retrieve multiple data items from a database without revealing them to the storage server(s). Most exist…
Transition Waste Optimization for Coded Elastic Computing
Hoang Dau, Ryan Gabrys, Yu-Chih Huang +4
Distributed computing, in which a resource-intensive task is divided into subtasks and distributed among different machines, plays a key role in solving large-scale problems. Coded…
Local Codes with Addition Based Repair
Han Mao Kiah, Son Hoang Dau, Wentu Song +1
We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or code…
Locally Encodable and Decodable Codes for Distributed Storage Systems
Son Hoang Dau, Han Mao Kiah, Wentu Song +1
We consider the locality of encoding and decoding operations in distributed storage systems (DSS), and propose a new class of codes, called locally encodable and decodable codes (L…
Erasure codes with symbol locality and group decodability for distributed storage
Wentu Song, Son Hoang Dau, Chau Yuen
We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {α; β; k; t}, where k is the number…
Secure Erasure Codes With Partial Decodability
Son Hoang Dau, Wentu Song, Chau Yuen
The MDS property (aka the -out-of- property) requires that if a file is split into several symbols and subsequently encoded into coded symbols, each being stored in one s…
On the Existence of MDS Codes Over Small Fields With Constrained Generator Matrices
Son Hoang Dau, Wentu Song, Chau Yuen
We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entrie…
On Block Security of Regenerating Codes at the MBR Point for Distributed Storage Systems
Son Hoang Dau, Wentu Song, Chau Yuen
A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system…
Optimal Locally Repairable Linear Codes
Wentu Song, Son Hoang Dau, Chau Yuen +1
Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, δ})-locality, denoted as (r, δ)a, is consi…
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures
Son Hoang Dau, Yeow Meng Chee
The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the resear…
Optimal Index Codes with Near-Extreme Rates
Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee
The min-rank of a digraph was shown by Bar-Yossef et al. (2006) to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with…
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling +1
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the…