Skip to content

Commit 82d2931

Browse files
committed
new post and add pubs
1 parent f52cd9a commit 82d2931

25 files changed

+116
-86
lines changed

Gemfile

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,6 @@ group :jekyll_plugins do
1515
gem 'jekyll-toc'
1616
gem 'jekyll-twitter-plugin'
1717
gem 'jemoji'
18-
gem 'mini_racer'
1918
gem 'unicode_utils'
2019
gem 'webrick'
2120
end

_bibliography/papers.bib

Lines changed: 30 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,47 @@
11
---
22
---
33
4+
@INPROCEEDINGS{WTSC25,
5+
author={Suhyeon Lee},
6+
booktitle={WTSC 2025 - 9th Workshop on Trusted Smart Contracts},
7+
title={Hollow Victory: Analysis on Challenger's Incentive in Optimistic Rollup Dispute Game},
8+
year={2025},
9+
volume={},
10+
number={},
11+
pages={},
12+
keywords={Ethereum, Game Theory, Optimistic Rollup, Security, Smart Contract},
13+
abstract = {Blockchain systems, such as Ethereum, are increasingly adopting layer-2 scaling solutions to improve transaction throughput and reduce fees. One popular layer-2 approach is the Optimistic Rollup, which relies security on a mechanism known as a dispute game for block proposals. In these systems, validators can challenge blocks that they believe contain errors, and a successful challenge results in the transfer of a portion of the proposer’s deposit as a reward. In this paper, we reveal a structural vulnerability in the mechanism: validators may not be awarded a proper profit despite winning a dispute challenge. We develop a formal game-theoretic model of the dispute game and analyze several scenarios, including cases where the proposer controls some validators and cases where a secondary auction mechanism is deployed to induce additional participation. Our analysis demonstrates that under current designs, the competitive pressure from validators may be insufficient to deter malicious behavior. To address this, we propose countermeasures such as an escrowed reward mechanism and a commit-reveal protocol. Our findings provide critical insights into enhancing the economic security of layer-2 scaling solutions in blockchain networks.},
14+
preview={WTSC25.png}
15+
}
16+
17+
@INPROCEEDINGS{ICBC25,
18+
author={Suhyeon Lee, and Euisin Gee},
19+
booktitle={ICBC 2025 - IEEE International Conference on Blockchain and Cryptocurrency},
20+
title={Commit-Reveal²: Randomized Reveal Order Mitigates Last-Revealer Attacks in Commit-Reveal},
21+
year={2025},
22+
volume={},
23+
number={},
24+
pages={},
25+
keywords={Blockchain, Commit-Reveal, Distributed Randomness, Smart Contract},
26+
abstract = {Randomness generation is a fundamental component in blockchain systems, essential for tasks such as validator selection, zero-knowledge proofs, and decentralized finance operations. Traditional Commit-Reveal mechanisms provide simplicity and security but are susceptible to last revealer attacks, where an adversary can manipulate the random outcome by withholding their reveal. To address this vulnerability, we propose the Commit-Reveal² protocol, which employs a two-layer Commit-Reveal process to randomize the reveal order and mitigate the risk of such attacks. Additionally, our protocol introduces an overlapped-commitment structure and leverages off-chain networks to optimize communication costs and enhance efficiency. We conduct security and economic analyses to demonstrate the effectiveness of Commit-Reveal² in reducing attacker incentives and preventing manipulation. Furthermore, we implement a prototype of the proposed mechanism and publicly release the code to facilitate practical adoption and further research.},
27+
preview={ICBC25.png}
28+
}
29+
30+
31+
432
@INPROCEEDINGS{ICBC24,
533
author={Hojung Lee, and Suhyeon Lee, and Seungjoo Kim},
634
booktitle={ICBC 2024 - IEEE International Conference on Blockchain and Cryptocurrency},
735
title={A Tip for IOTA Privacy: IOTA Light Node Deanonymization via Tip Selection},
836
year={2024},
937
volume={},
1038
number={},
11-
pages={},
39+
pages={494-502},
1240
keywords={Cryptocurrency, IOTA, Tangle, DAG, Privacy, Anonymity, Blockchain},
1341
abstract = {IOTA is a distributed ledger technology that uses a Directed Acyclic Graph (DAG) structure called the Tangle. It is known for its efficiency and is widely used in the Internet of Things (IoT) environment. Tangle can be configured by utilizing the tip selection process. Due to performance issues with light nodes, full nodes are being asked to perform the tip selections of light nodes. However, in this paper, we demonstrate that tip selection can be exploited to compromise users' privacy. An adversary full node can associate a transaction with the identity of a light node by comparing the light node's request with its ledger. We show that these types of attacks are not only viable in the current IOTA environment but also in IOTA 2.0 and the privacy improvement being studied. We also provide solutions to mitigate these attacks and propose ways to enhance anonymity in the IOTA network while maintaining efficiency and scalability.},
1442
html = {https://arxiv.org/abs/2403.11171},
1543
pdf = {https://arxiv.org/pdf/2403.11171.pdf},
16-
doi={10.1109/ACCESS.2023.3309879},
17-
doi={https://doi.org/10.48550/arXiv.2403.11171},
44+
doi={10.1109/ICBC59979.2024.10634353},
1845
preview={ICBC24.png}
1946
}
2047

_pages/about.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -24,6 +24,6 @@ I'm a PhD researcher focused on `Blockchain` and `Cybersecurity`. Before academi
2424

2525
Current projects working on:
2626
<ul>
27-
<li> Layer 2 security and cost analysis (<a href='https://arxiv.org/abs/2410.04111'>recent article</a>)</li>
28-
<li> On-chain distributed random beacon (<a href='https://arxiv.org/abs/2405.06498'>recent article</a>) </li>
27+
<li> Layer 2 security and cost analysis </li>
28+
<li> On-chain distributed randomness </li>
2929
</ul>

_posts/2025-01-07-BDS.md

Lines changed: 0 additions & 34 deletions
This file was deleted.

0 commit comments

Comments
 (0)