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

Mansub Song

dblp:291/2640 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-2320-6402ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-author · 2 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 77% Distributed systems · 23%

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

TopicWeightPapersLastEvidence papers
Storage systems › file systems
distributed file system
0.812024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Storage systems
file systems
0.812024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Distributed systems › peer-to-peer systems
IPFS
0.212024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Distributed systems
peer-to-peer systems
0.212024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024

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

parallel garbage collection · 0.8parallel DAG construction · 0.8DAG caching · 0.8
YearPublicationVenuePosition
2024 EnC-IoT: An Efficient Encryption and Access Control Framework based on IPFS for Decentralized IoT
abstract
Recently, many decentralized IoT systems incorporating IPFS and blockchain have been widely used to share private data and overcome issues in a centralized IoT system such as a single point of failure and loss of data sovereignty. However, the constrained computing power of IoT devices can result in a performance overhead during encryption processes, which involves computationally intensive tasks. In addition, the blockchain involved in the access control mechanism can raise another performance issue and potentially expose sensitive information due to its transparent nature. To address these issues, in this paper, we propose an efficient IoT framework (EnC-IoT) to enhance performance and data protection (i.e., security and privacy) in a decentralized IoT environment. We first introduce an efficient data encryption scheme that shuffles the data order to enhance the security level. Then, it partitions the data into multiple regions and encrypts/decrypts each region in parallel to accelerate the cryptography process. Second, we provide an efficient access control scheme which adopts a tree-based authentication to perform the access control quickly. Moreover, it employs a proxy re-encryption method which allows the decryption of sensitive information without exposing the owner’s private key to improve both security and privacy levels. We implement EnC-IoT with two schemes in IPFS based on a decentralized IoT environment. The experimental results show that EnC-IoT provides a performance improvement of up to 100.7× for uploading and 9.6× for downloading compared with the existing systems.
Mansub Song, Sunggon Kim, Hyeonsang Eom, Yongseok Son
CCGrid1
2024 ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing
abstract
This paper introduces a novel file system, ScaleDFS, designed to accelerate decentralized file sharing for a private network, leveraging the potential of scaling file management based on directed acyclic graph (DAG) on modern hardware. Specifically, in ScaleDFS, we first design a DAG builder that parallelizes the construction of DAG nodes for a file while preserving critical orders to speed up the uploading process. Second, we introduce a DAG reader that retrieves leaf DAG nodes in parallel without graph traversal assisted by a devised DAG cache to accelerate the downloading process. Finally, we present a DAG remover that rapidly identifies obsolete DAG nodes/data and removes them in parallel to mitigate the garbage collection overhead without compromising consistency. We implement ScaleDFS based on IPFS and demonstrate that ScaleDFS outperforms IPFS by up to 3.7×, 1.8×, and 12.6× in realistic file, private blockchain, and gateway workloads, respectively.
Mansub Song, Lan Anh Nguyen, Sunggon Kim, Hyeonsang Eom, Yongseok Son
HPDC1