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

Guo-Tan Liao

dblp:40/460 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Systems, architecture and hardware · 2Computer networks · 2Security and privacy · 2Applied, interdisciplinary, general and emerging computing · 1

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
Network security · 67% Privacy and data protection · 33%

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

TopicWeightPapersLastEvidence papers
Network security › attack modeling
attack prediction
0.112011
A Novel Probabilistic Matching Algorithm for Multi-Stage Attack Forecasts · IEEE J. Sel. Areas Commun. 2011
Network security › intrusion detection and prevention
intrusion detection
0.112011
A Novel Probabilistic Matching Algorithm for Multi-Stage Attack Forecasts · IEEE J. Sel. Areas Commun. 2011
Privacy and data protection
statistical matching
0.112011
A Novel Probabilistic Matching Algorithm for Multi-Stage Attack Forecasts · IEEE J. Sel. Areas Commun. 2011

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

longest common subsequence · 0.1attack session graph · 0.1
YearPublicationVenuePosition
2012 iPAT: Intelligent privacy-preserving administration tool for IRB applications
abstract
Supported by maturing information and communication technology (ICT) technologies, the medical care industry entered its digitization age. However, medical information is highly confidential and involves privacy; even legitimate access can cause privacy infringements. Under the current medical administration system, no established application systems conform to the IRB (Institutional review board) to protect privacy in human subject research. To prevent the privacy of research subjects from being disclosed unintentionally, and to meet the “need-to-know” demands of information management, this study proposes an intelligent privacy-preserving administration tool (iPAT) designed to facilitate human subject research. This study provides the principle and feasibility of iPAT that are introduced and verified through a use case conducted by the head of the research project.
Ya-Ling Chen, Hsueh-Lin Chen, Chia-I Lin, Bo-Chao Cheng, Guo-Tan Liao, Ting-Chun Yin, Kuo-Yang Hung
Healthcom5
2012 MIB-ITrace-CP: An Improvement of ICMP-Based Traceback Efficiency in Network Forensic Analysis
Bo-Chao Cheng, Guo-Tan Liao, Ching-Kai Lin, Shih-Chun Hsu, Ping-Hai Hsu, Jong Hyuk Park 0001
NPC2
2012 Network lifetime bounds for hierarchical wireless sensor networks in the presence of energy constraints
Bo-Chao Cheng, Guo-Tan Liao, Ryh-Yuh Tseng, Ping-Hai Hsu
Comput. Networks2
2011 A Novel Probabilistic Matching Algorithm for Multi-Stage Attack Forecasts
abstract
Current intrusion detection systems (IDSs) can only discover single-step attacks but not complicated multi-stage attacks. Therefore, it is not only important, but also challenging for security managers to correlate security alerts with specific patterns to predict a multi-stage attack. In this paper, we propose Judge Evaluation of Attack intensioN (JEAN), which inspects the security alerts in the network and provides a probabilistic approach for the projection of the multi-stage attack by measuring the difference between the stored and the actual multi-stage attack session graphs (ASG). The experimental results show that JEAN is able to project possible attacks with more accuracy than Longest Common Subsequence (LCS) based approaches on DARPA 2000 and DARPA GCP (Grand Challenge Problem) specific attack scenario datasets.
Bo-Chao Cheng, Guo-Tan Liao, Chu-Chun Huang, Ming-Tse Yu
IEEE J. Sel. Areas Commun.2
2010 HMM machine learning and inference for Activities of Daily Living recognition
Bo-Chao Cheng, Yi-An Tsai, Guo-Tan Liao, Eui-Seok Byeon
J. Supercomput.3
2009 FBT: an efficient traceback scheme in hierarchical wireless sensor network
abstract
Abstract With limited resource constraints, wireless sensor networks (WSNs) pose unique technical challenges: WSNs are vulnerable to DoS/DDoS attacks that can easily exhaust rare available resources to prevent execution of their expected functions. Reconstructing the attacking path and locating the attacking source are challenging tasks in the traceback research areas. In conventional IP networks, probabilistic packet marking (PPM) schemes are among the widely used traceback algorithms. However, due to their high convergence times, conventional PPM schemes are not enough for the need for quick and accurate traceback in WSNs. Because marking probability assignment schemes have considerable influence on convergence time and performance, we place a particular emphasis on how to improve both easiness and efficiency for the marking probability assignment of the PPM. In this paper, we propose a novel traceback scheme, called fishbone traceback (FBT), which can be deployed in hierarchical WSN environments. FBT is designed based on the two‐layer labelling technique and a smart marking probability distribution function (MPDF). The use of two‐layer FBT labels is to derive the main branch (‘fish spine’) of the attacking path quickly, while the use of MPDF can greatly reduce the convergence time by integrating witha prioriinformation of hierarchical WSN topology. The FBT path reconstruction procedure is able to rebuild the spine path (for inter‐cluster traceback)viacluster head marking packets. It also reforms the details of the micro fishbone path (for intra‐cluster traceback) on‐demand within a cluster. Both numerical analysis and simulation results show that our solution has better performance in terms of shorter traceback convergence time. In particular, the proposed FBT also includes many salient features (such as the enhanced robustness of the traceback algorithm in case of multi‐attack and reusable spine path), which enable FBT to be a practical solution to the traceback problem in hierarchical WSNs. Copyright © 2008 John Wiley & Sons, Ltd.
Bo-Chao Cheng, Huan Chen 0002, Guo-Tan Liao
Secur. Commun. Networks3
2008 A Novel Marking Probability Distribution Using Probability Propagation in Hierarchical WSN
Bo-Chao Cheng, Huan Chen 0002, Guo-Tan Liao
Inscrypt3