Warodom Werapun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Warodom Werapun has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jakapan Suaboot
College of Computing, Prince of Songkla University, Kathu, Phuket 83120, Thailand
8 shared publications - Esther Sangiamkul
College of Computing, Prince of Songkla University, Phuket 83120, Thailand
4 shared publications - Apichat Heednacram
Prince of Songkla University
3 shared publications - Tanwa Arpornthip
Faculty of Technology and Environment, Prince of Songkla University, Phuket 83120, Thailand
3 shared publications Beatrice Paillassa
University of Toulouse, IRIT Laboratory, INP - ENSEEIHT, France
2 shared publications- Nattawat Songsom2 shared publications
Latest Publications
- Open Access
- 28 October 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 15
Ensemble YOLO architectures and UAV imagery for robust on-tree durian detection
- 28 October 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 15
Open AccessEnsemble YOLO architectures and UAV imagery for robust on-tree durian detection
- Open Access
- 9 September 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (5) , 66
Privacy-Preserving Health Insurance Eligibility Verification on Blockchain Using zk-SNARKs
Verifying a patient’s eligibility for insurance reimbursement typically requires disclosing sensitive clinical data—diagnosis codes, laboratory values, and policy details—to third parties, conflicting with the data-minimization principle of modern data-protection regimes. Blockchain platforms improve auditability but, when health records are placed on-chain, amplify the privacy problem. This paper presents a zero-knowledge framework in which a patient proves that an authority-signed health record satisfies a set of policy predicates—a covered diagnosis, a laboratory value within an approved range, and a claim amount within the policy ceiling—without revealing the underlying values. Records are committed to an on-chain Merkle registry, and a record-bound nullifier prevents double claims without linking a claim to the patient. We state the NP relation proved by the circuit and reduce claim soundness, claim unlinkability, and front-running resistance to the knowledge soundness and zero-knowledge of the argument, the collision resistance of the hash, and the unforgeability of the signature scheme. A circom and snarkjs prototype with a Solidity verifier compiles to 10,050 R1CS constraints, of which the eligibility predicates contribute only 2.1%, and produces a constant 256-byte proof verified on-chain by a fixed four-pair check. On-chain cost scales with the number of public inputs rather than circuit size, and we identify the attack surface such designs commonly leave open—proof front-running, issuer-side linkability, and anonymity-set size, which the registry population bounds rather than tree depth.
- 9 September 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (5) , 66
Open AccessPrivacy-Preserving Health Insurance Eligibility Verification on Blockchain Using zk-SNARKs
Verifying a patient’s eligibility for insurance reimbursement typically requires disclosing sensitive clinical data—diagnosis codes, laboratory values, and policy details—to third parties, conflicting with the data-minimization principle of modern data-protection regimes. Blockchain platforms improve auditability but, when health records are placed on-chain, amplify the privacy problem. This paper presents a zero-knowledge framework in which a patient proves that an authority-signed health record satisfies a set of policy predicates—a covered diagnosis, a laboratory value within an approved range, and a claim amount within the policy ceiling—without revealing the underlying values. Records are committed to an on-chain Merkle registry, and a record-bound nullifier prevents double claims without linking a claim to the patient. We state the NP relation proved by the circuit and reduce claim soundness, claim unlinkability, and front-running resistance to the knowledge soundness and zero-knowledge of the argument, the collision resistance of the hash, and the unforgeability of the signature scheme. A circom and snarkjs prototype with a Solidity verifier compiles to 10,050 R1CS constraints, of which the eligibility predicates contribute only 2.1%, and produces a constant 256-byte proof verified on-chain by a fixed four-pair check. On-chain cost scales with the number of public inputs rather than circuit size, and we identify the attack surface such designs commonly leave open—proof front-running, issuer-side linkability, and anonymity-set size, which the registry population bounds rather than tree depth.
- Open Access
- 7 September 2026
- Published by MDPI AG in Smart Cities
- Vol. 9 (9) , 148
WindChain: Physics-Constrained Blockchain Attestation of Wind-Resource Provenance for Verifiable Renewable Energy Certificates in Smart Cities
Smart-city energy platforms—peer-to-peer markets and tokenized renewable energy certificates—settle against metered generation, yet never check the physical plausibility of those claims. For wind, attainable energy is not measured but derived from anemometry through a vertical extrapolation whose exponent—the wind-shear coefficient—is a discretionary modeling choice. Using a five-height, 52,192-record campaign from Phangan Island, Thailand—reproduced here as a statistically anchored reconstruction, the raw archive not being redistributable—we show that the conventional rule understates attainable energy by , and that an adversary asserting the exponent could inflate a resource claim by . WindChain sits beneath the smart-city transactive layer rather than beside it: it does not mint certificates from wind data but bounds what a revenue meter may claim. It enforces boundary-layer, kinematic, and thermodynamic admissibility as a consensus predicate and commits wind statistics to a hierarchical Merkle–Weibull accumulator whose 104-byte root lets any verifier recompute the Weibull parameters, power density, and shear exponent in constant time. We prove that an epoch-level admissibility gate bounds over-issuance, and that attestation windows must be thirty-six times longer than independence assumes. On the reconstruction, WindChain detects six of eight manipulation classes—four of them with recall —at a false-positive rate; we also report a camouflage regime defeating every per-record test, and a sustained bias at or below that the epoch detector does not see. Consensus performance is modeled, not deployed. WindChain narrows the trust boundary rather than removing it: the guarantee is conditional on an independently certified site reference and on physical calibration of the mast and is best read as an auditable plausibility layer beneath settlement rather than as a trustless one.- 7 September 2026
- Published by MDPI AG in Smart Cities
- Vol. 9 (9) , 148
Open AccessWindChain: Physics-Constrained Blockchain Attestation of Wind-Resource Provenance for Verifiable Renewable Energy Certificates in Smart Cities
Smart-city energy platforms—peer-to-peer markets and tokenized renewable energy certificates—settle against metered generation, yet never check the physical plausibility of those claims. For wind, attainable energy is not measured but derived from anemometry through a vertical extrapolation whose exponent—the wind-shear coefficient—is a discretionary modeling choice. Using a five-height, 52,192-record campaign from Phangan Island, Thailand—reproduced here as a statistically anchored reconstruction, the raw archive not being redistributable—we show that the conventional rule understates attainable energy by , and that an adversary asserting the exponent could inflate a resource claim by . WindChain sits beneath the smart-city transactive layer rather than beside it: it does not mint certificates from wind data but bounds what a revenue meter may claim. It enforces boundary-layer, kinematic, and thermodynamic admissibility as a consensus predicate and commits wind statistics to a hierarchical Merkle–Weibull accumulator whose 104-byte root lets any verifier recompute the Weibull parameters, power density, and shear exponent in constant time. We prove that an epoch-level admissibility gate bounds over-issuance, and that attestation windows must be thirty-six times longer than independence assumes. On the reconstruction, WindChain detects six of eight manipulation classes—four of them with recall —at a false-positive rate; we also report a camouflage regime defeating every per-record test, and a sustained bias at or below that the epoch detector does not see. Consensus performance is modeled, not deployed. WindChain narrows the trust boundary rather than removing it: the guarantee is conditional on an independently certified site reference and on physical calibration of the mast and is best read as an auditable plausibility layer beneath settlement rather than as a trustless one. - 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Architectures de réseaux pour la délivrance de services à domicile
Avec l’omniprésence au quotidien du numérique et de l’informatique, de plus en plus d’utilisateurs souhaitent avoir accès à Internet et à leurs applications via n’importe quel périphérique, de n’importe où et n’importe quand. Les appareils domestiques intelligents se développant, les besoins d’échanger des données au domicile même se font de plus en plus sentir. C’est dans ce contexte, celui des services à domicile avec besoin d’interconnexion que se situe notre étude. Ce type de service est qualifié de Home Service (HS) alors que le réseau à domicile est nommé Home Network (HN). La problématique pour les opérateurs est alors de concevoir des architectures appropriées à l’interconnexion des HN de manière sécurisée tout en permettant un déploiement facile et à grande échelle. Dans la première étape, nous considérons la livraison de services sécurisés à travers un réseau de nouvelle génération (NGN) : IMS (IP Multimedia Subsystem). IMS étant l’architecture de référence pour son caractère réseau NGN des opérateurs, diverses architectures peuvent être développées comme support aux HS. Nous avons choisi d'analyser et de mettre en place une architecture P2P centralisée et de le comparer à l’architecture de référence. Plusieurs mécanismes d'authentification sont mis en place autour du P2P centralisé afin de sécuriser la prestation de services. La modélisation et l’évaluation de notre proposition ont permis d’identifier sa relation à l’IMS mais aussi des problèmes inhérents aux solutions centralisées : la protection des données personnelles, l’impact de la taille sur réseau sur les performances, l’existence d’un point de faiblesse unique face aux attaques et la congestion au niveau du serveur centralisé. Par conséquent, nous nous sommes tournés vers les solutions distribuées pour résoudre ces problèmes. Dans la deuxième étape, nous considérons l’architecture P2P non-structurée, qualifiée de pur P2P. La cryptographie basée sur l'identité (IBC) est ajoutée au P2P pur afin d’authentifier les utilisateurs et de protéger leurs communications. Pour chacune des solutions une analyse du coût de signalisation est effectuée révélant une faiblesse en ce qui concerne l’étape de recherche. Dans un déploiement à grande échelle, le coût de cette phase est trop élevé. Aussi, nous examinons le P2P structuré basé sur les Dynamic Hash Tables, une autre solution distribuée. Cette architecture est étudiée par l'IETF en tant qu’une des dernières générations de P2P: REsource LOcation And Discovery (RELOAD) Base Protocol. Nous proposons son utilisation dans le cadre des HSs. Comme preuve du concept, cette solution a été implantée et déployée sur un petit réseau en utilisant TLS/SSL comme mécanisme de sécurité. Cette plateforme nous a permis d’étudier les délais et les coûts de cette solution. Pour terminer, un bilan est établi sur toutes les solutions proposées En outre, nous introduisons d’autres types de HS et leurs possibilités de déploiement futur.
- 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Architectures de réseaux pour la délivrance de services à domicile
Avec l’omniprésence au quotidien du numérique et de l’informatique, de plus en plus d’utilisateurs souhaitent avoir accès à Internet et à leurs applications via n’importe quel périphérique, de n’importe où et n’importe quand. Les appareils domestiques intelligents se développant, les besoins d’échanger des données au domicile même se font de plus en plus sentir. C’est dans ce contexte, celui des services à domicile avec besoin d’interconnexion que se situe notre étude. Ce type de service est qualifié de Home Service (HS) alors que le réseau à domicile est nommé Home Network (HN). La problématique pour les opérateurs est alors de concevoir des architectures appropriées à l’interconnexion des HN de manière sécurisée tout en permettant un déploiement facile et à grande échelle. Dans la première étape, nous considérons la livraison de services sécurisés à travers un réseau de nouvelle génération (NGN) : IMS (IP Multimedia Subsystem). IMS étant l’architecture de référence pour son caractère réseau NGN des opérateurs, diverses architectures peuvent être développées comme support aux HS. Nous avons choisi d'analyser et de mettre en place une architecture P2P centralisée et de le comparer à l’architecture de référence. Plusieurs mécanismes d'authentification sont mis en place autour du P2P centralisé afin de sécuriser la prestation de services. La modélisation et l’évaluation de notre proposition ont permis d’identifier sa relation à l’IMS mais aussi des problèmes inhérents aux solutions centralisées : la protection des données personnelles, l’impact de la taille sur réseau sur les performances, l’existence d’un point de faiblesse unique face aux attaques et la congestion au niveau du serveur centralisé. Par conséquent, nous nous sommes tournés vers les solutions distribuées pour résoudre ces problèmes. Dans la deuxième étape, nous considérons l’architecture P2P non-structurée, qualifiée de pur P2P. La cryptographie basée sur l'identité (IBC) est ajoutée au P2P pur afin d’authentifier les utilisateurs et de protéger leurs communications. Pour chacune des solutions une analyse du coût de signalisation est effectuée révélant une faiblesse en ce qui concerne l’étape de recherche. Dans un déploiement à grande échelle, le coût de cette phase est trop élevé. Aussi, nous examinons le P2P structuré basé sur les Dynamic Hash Tables, une autre solution distribuée. Cette architecture est étudiée par l'IETF en tant qu’une des dernières générations de P2P: REsource LOcation And Discovery (RELOAD) Base Protocol. Nous proposons son utilisation dans le cadre des HSs. Comme preuve du concept, cette solution a été implantée et déployée sur un petit réseau en utilisant TLS/SSL comme mécanisme de sécurité. Cette plateforme nous a permis d’étudier les délais et les coûts de cette solution. Pour terminer, un bilan est établi sur toutes les solutions proposées En outre, nous introduisons d’autres types de HS et leurs possibilités de déploiement futur.
- Open Access
- 25 August 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (5)
FSA: A Framework for Analyzing Secondary Preimage Attacks on Merkle Proof-Based Airdrops
- 25 August 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (5)
Open AccessFSA: A Framework for Analyzing Secondary Preimage Attacks on Merkle Proof-Based Airdrops
- Open Access
- 22 August 2025
- Published by Cambridge University Press (CUP) in Journal of Tropical Ecology
- Vol. 41, e23
Tokenisation of forest carbon project: a blockchain-based approach for community engagement
Carbon credits have become increasingly important for supporting sustainable forest management and mitigating climate change. However, carbon projects can be challenging for local communities and smallholders to implement due to high expenses and complicated protocols. Forest projects often suffer from inefficiency, lack of transparency, and uneven benefit distribution. This study suggests a blockchain-based framework for aggregating forest carbon projects. This framework is the first in the forest sector to provide a reward mechanism for local communities or smallholders with a direct integration into an accredited registry protocol of Monitoring, Reporting, and Verification. The system combines digital identities, smart contracts, and automated incentives to improve transparency, responsibility, and trust among stakeholders. Two types of tokens are introduced: (i) Carbon Coin represents verified carbon credits within the system; and (ii) Forest Coin functions as a security token used to proportionally distribute project revenue among stakeholders. The revenue distribution was demonstrated in scenarios of afforestation, reforestation, and conservation. In addition, a web application was developed so that users can monitor project details. Unlike most blockchain carbon platforms that focus on investment and trading, this framework addresses upstream challenges, prioritising equitable benefit-sharing. The framework supports project aggregation and prioritises community ownership, advancing inclusive access to the carbon market. This study demonstrates how technological advantages can be transferred to community-driven ecological conservation.
- 22 August 2025
- Published by Cambridge University Press (CUP) in Journal of Tropical Ecology
- Vol. 41, e23
Open AccessTokenisation of forest carbon project: a blockchain-based approach for community engagement
Carbon credits have become increasingly important for supporting sustainable forest management and mitigating climate change. However, carbon projects can be challenging for local communities and smallholders to implement due to high expenses and complicated protocols. Forest projects often suffer from inefficiency, lack of transparency, and uneven benefit distribution. This study suggests a blockchain-based framework for aggregating forest carbon projects. This framework is the first in the forest sector to provide a reward mechanism for local communities or smallholders with a direct integration into an accredited registry protocol of Monitoring, Reporting, and Verification. The system combines digital identities, smart contracts, and automated incentives to improve transparency, responsibility, and trust among stakeholders. Two types of tokens are introduced: (i) Carbon Coin represents verified carbon credits within the system; and (ii) Forest Coin functions as a security token used to proportionally distribute project revenue among stakeholders. The revenue distribution was demonstrated in scenarios of afforestation, reforestation, and conservation. In addition, a web application was developed so that users can monitor project details. Unlike most blockchain carbon platforms that focus on investment and trading, this framework addresses upstream challenges, prioritising equitable benefit-sharing. The framework supports project aggregation and prioritises community ownership, advancing inclusive access to the carbon market. This study demonstrates how technological advantages can be transferred to community-driven ecological conservation.
- Open Access
- 6 August 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (4)
Exploring Risk and Return Profiles of Funding Rate Arbitrage on CEX and DEX
- 6 August 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (4)
Open AccessExploring Risk and Return Profiles of Funding Rate Arbitrage on CEX and DEX
- Open Access
- 2 July 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (2)
Resolving the token loss vulnerability in the Ethereum ERC-20 standard
- 2 July 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (2)
Open AccessResolving the token loss vulnerability in the Ethereum ERC-20 standard
- 31 March 2025
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (7)
On the Hamilton–Jacobi–Bellman approach to the relaxed optimal feedback control problems
- 31 March 2025
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (7)
On the Hamilton–Jacobi–Bellman approach to the relaxed optimal feedback control problems
- 22 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 24 (05) , 1521-1537
The Automated Arbitrage Strategy of Cross-Cryptocurrency Exchanges
The emergence of decentralized finance (DeFi) allows arbitrageurs to obtain risk-free income from price gaps of cryptocurrency tokens in many global markets. Several automated arbitrage techniques have been invented to profit from single or multiple platforms, including Centralized and Decentralized Exchange (CEX and DEX), triangular, and DEX-Fait. This paper proposes the arbitrage strategy of cross-cryptocurrency exchanges (ASCEX), a novel automated arbitrage strategy for CEX-DEX platforms, to maximize profit and loss (PNL) using a token route searching algorithm. Based on feature comparison, ASCEX outperforms the existing trading strategies available. Our actual trade experiment shows that ASCEX can generate up to 0.95% monthly risk-free profit compared to 0.34% trading on DEX alone.
- 22 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 24 (05) , 1521-1537
The Automated Arbitrage Strategy of Cross-Cryptocurrency Exchanges
The emergence of decentralized finance (DeFi) allows arbitrageurs to obtain risk-free income from price gaps of cryptocurrency tokens in many global markets. Several automated arbitrage techniques have been invented to profit from single or multiple platforms, including Centralized and Decentralized Exchange (CEX and DEX), triangular, and DEX-Fait. This paper proposes the arbitrage strategy of cross-cryptocurrency exchanges (ASCEX), a novel automated arbitrage strategy for CEX-DEX platforms, to maximize profit and loss (PNL) using a token route searching algorithm. Based on feature comparison, ASCEX outperforms the existing trading strategies available. Our actual trade experiment shows that ASCEX can generate up to 0.95% monthly risk-free profit compared to 0.34% trading on DEX alone.