Michael Y. K. Kwan
University of Hong Kong
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Michael Y. K. Kwan.
international conference on digital forensics | 2012
Hayson Tse; K. P. Chow; Michael Y. K. Kwan
This paper presents methods for analyzing the topology of a Bayesian belief network created to qualify and quantify the strengths of investigative hypotheses and their supporting digital evidence. The methods, which enable investigators to systematically establish, demonstrate and challenge a Bayesian belief network, help provide a powerful framework for reasoning about digital evidence. The methods are applied to review a Bayesian belief network constructed for a criminal case involving BitTorrent file sharing, and explain the causal effects underlying the legal arguments.
Second International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE'07) | 2007
K. P. Chow; Frank Y. W. Law; Michael Y. K. Kwan; Pierre K. Y. Lai
With the rapid development and popularity of IT technology, criminals and mischievous computer users are given avenues to commit crimes and malicious activities. As forensic science has long been used to resolve legal disputes regarding different branches of science, computer forensics is developed naturally in the aspects of computer crimes or misbehaviors. In computer forensics, temporal analysis plays a significant role in the reconstruction of events or crimes. Indeed, temporal analysis is one of the attractive areas in computer forensics that caused a large number of researches and studies. It is the purpose of this paper to focus on temporal analysis on NTFS file system and to project intuitional rules on the behavioral characteristics of related digital files
international conference on digital forensics | 2010
Michael Y. K. Kwan; Richard E. Overill; K. P. Chow; Jantje A. M. Silomon; Hayson Tse; Frank Y. W. Law; Pierre K. Y. Lai
Internet auction fraud has become prevalent. Methodologies for detecting fraudulent transactions use historical information about Internet auction participants to decide whether or not a user is a potential fraudster. The information includes reputation scores, values of items, time frames of various activities and transaction records. This paper presents a distinctive set of fraudster characteristics based on an analysis of 278 allegations about the sale of counterfeit goods at Internet auction sites. Also, it applies a Bayesian approach to analyze the relevance of evidence in Internet auction fraud cases.
international conference on digital forensics | 2011
Michael Y. K. Kwan; Richard E. Overill; K. P. Chow; Hayson Tse; Frank Y. W. Law; Pierre K. Y. Lai
Research on using Bayesian networks to enhance digital forensic investigations has yet to evaluate the quality of the output of a Bayesian network. The evaluation can be performed by assessing the sensitivity of the posterior output of a forensic hypothesis to the input likelihood values of the digital evidence. This paper applies Bayesian sensitivity analysis techniques to a Bayesian network model for the well-known Yahoo! case. The analysis demonstrates that the conclusions drawn from Bayesian network models are statistically reliable and stable for small changes in evidence likelihood values.
2011 Sixth IEEE International Workshop on Systematic Approaches to Digital Forensic Engineering | 2011
Frank Y. W. Law; Patrick P. F. Chan; Siu-Ming Yiu; K. P. Chow; Michael Y. K. Kwan; Hayson Tse; Pierre K. Y. Lai
Privacy is a fundamental human right defined in the Universal Declaration of Human Rights. To enable the protection of data privacy, personal data that are not related to the investigation subject should be excluded during computer forensic examination. In the physical world, protection of privacy is controlled and regulated in most countries by laws. Legislation for handling private data has been established in various jurisdictions. In the modern world, the massive use of computers generates a huge amount of private data and there is correspondingly an increased expectation to recognize and respect human rights in digital investigation. However, there does not exist a forensically sound model for protecting private data in the context of digital investigation, and it poses a threat to privacy if the investigation involves the processing of such kind of data. In this paper, we try to address this important issue and present a cryptographic model designed to be incorporated into the current digital investigation framework, thereby adding a possible way to protect data privacy in digital investigation.
2010 3rd International Conference on Human-Centric Computing | 2010
Richard E. Overill; Jantje A. M. Silomon; Michael Y. K. Kwan; K. P. Chow; Frank Y. W. Law; Pierre K. Y. Lai
A Bayesian network representing an actual prosecuted case of illegal file sharing over a peer-to-peer network has been subjected to a systematic and rigorous sensitivity analysis. Our results demonstrate that such networks are usefully insensitive both to the occurrence of missing evidential traces and to the choice of conditional evidential probabilities. The importance of this finding for the investigation of digital forensic hypotheses is highlighted.
international conference on digital forensics | 2009
Ricci S. C. Ieong; Pierre K. Y. Lai; K. P. Chow; Frank Y. W. Law; Michael Y. K. Kwan; Kenneth W. H. Tse
In recent years, peer-to-peer (P2P) applications have become the dominant form of Internet traffic. Foxy, a Chinese community focused filesharing tool, is increasingly being used to disseminate private data and sensitive documents in Hong Kong. Unfortunately, its scattered design and a highly distributed network make it difficult to locate a file originator. This paper proposes an investigative model for analyzing Foxy communications and identifying the first uploaders of files. The model is built on the results of several experiments, which reveal behavior patterns of the Foxy protocol that can be used to expose traces of file originators.
international conference on digital forensics | 2009
Richard E. Overill; Michael Y. K. Kwan; K. P. Chow; Pierre K. Y. Lai; Frank Y. W. Law
Because of the way computers operate, every discrete event potentially leaves a digital trace. These digital traces must be retrieved during a digital forensic investigation to prove or refute an alleged crime. Given resource constraints, it is not always feasible (or necessary) for law enforcement to retrieve all the related digital traces and to conduct comprehensive investigations. This paper attempts to address the issue by proposing a model for conducting swift, practical and cost-effective digital forensic investigations.
Handbook of Research on Computational Forensics, Digital Crime, and Investigation | 2010
Ricci S. C. Ieong; Pierre K. Y. Lai; K. P. Chow; Michael Y. K. Kwan; Frank Y. W. Law
The community of peer-to-peer (P2P) file-sharing networks has been expanding swiftly since the appearance of the very first P2P application (Napster) in 2001. These networks are famous for their excellent file transfer rates and adversely, the flooding of copyright-infringed digital materials. Recently, a number of documents containing personal data or sensitive information have been shared in an unbridled manner over the Foxy network (a popular P2P network in Chinese regions). These incidents have urged the authors to develop an investigation model for tracing suspicious P2P activities. Unfortunately, hindered DOI: 10.4018/978-1-60566-836-9.ch015
international conference on digital forensics | 2010
Frank Y. W. Law; Patrick P. F. Chan; Siu-Ming Yiu; Benjamin Tang; Pierre K. Y. Lai; K. P. Chow; Ricci S. C. Ieong; Michael Y. K. Kwan; Wing-Kai Hon; Lucas Chi Kwong Hui
One of the core components of live forensics is to collect and analyze volatile memory data. Since the dynamic analysis of memory is not possible, most live forensic approaches focus on analyzing a single snapshot of a memory dump. Analyzing a single memory dump raises questions about evidence reliability; consequently, a natural extension is to study data from multiple memory dumps. Also important is the need to differentiate static data from dynamic data in the memory dumps; this enables investigators to link evidence based on memory structures and to determine if the evidence is found in a consistent area or a dynamic memory buffer, providing greater confidence in the reliability of the evidence. This paper proposes an indexing data structure for analyzing pages from multiple memory dumps in order to identify static and dynamic pages.