File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ARES.2010.42
- Scopus: eid_2-s2.0-77952373595
- WOS: WOS:000278197800103
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: A complexity based model for quantifying forensic evidential probabilities
Title | A complexity based model for quantifying forensic evidential probabilities |
---|---|
Authors | |
Keywords | Bayesian posterior probability Competing hypotheses Digital forensics Evidential probability Odds Operational complexity model |
Issue Date | 2010 |
Publisher | IEEE. |
Citation | The 3rd International Workshop on Digital Forensics (WSDF 2010) to be held in conjunction with the 5th International Conference on Availability, Reliability and Security (ARES 2010), Krakow, Poland, 15-18 February 2010. In Proceedings of the International Conference on Availability, Reliability and Security, 2010, p. 671-676 How to Cite? |
Abstract | An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexity of formation of a set of traces via a specified route a measure of the probability of that route can be determined. By determining the complexities of alternative routes leading to the formation of the same set of traces, the odds indicating the relative plausibility of the alternative routes can be found. An illustrative application to a BitTorrent piracy case is presented, and the results obtained suggest that the OCM is capable of providing a realistic estimate of the odds for two competing hypotheses. It is also demonstrated that the OCM can be straightforwardly refined to encompass a variety of circumstances. © 2010 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/125686 |
ISBN | |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Overill, RE | en_HK |
dc.contributor.author | Silomon, JAM | en_HK |
dc.contributor.author | Chow, KP | en_HK |
dc.date.accessioned | 2010-10-31T11:46:02Z | - |
dc.date.available | 2010-10-31T11:46:02Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | The 3rd International Workshop on Digital Forensics (WSDF 2010) to be held in conjunction with the 5th International Conference on Availability, Reliability and Security (ARES 2010), Krakow, Poland, 15-18 February 2010. In Proceedings of the International Conference on Availability, Reliability and Security, 2010, p. 671-676 | en_HK |
dc.identifier.isbn | 978-1-4244-5879-0 | - |
dc.identifier.uri | http://hdl.handle.net/10722/125686 | - |
dc.description.abstract | An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexity of formation of a set of traces via a specified route a measure of the probability of that route can be determined. By determining the complexities of alternative routes leading to the formation of the same set of traces, the odds indicating the relative plausibility of the alternative routes can be found. An illustrative application to a BitTorrent piracy case is presented, and the results obtained suggest that the OCM is capable of providing a realistic estimate of the odds for two competing hypotheses. It is also demonstrated that the OCM can be straightforwardly refined to encompass a variety of circumstances. © 2010 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | Proceedings of the International Conference on Availability, Reliability and Security | en_HK |
dc.rights | ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Bayesian posterior probability | en_HK |
dc.subject | Competing hypotheses | en_HK |
dc.subject | Digital forensics | en_HK |
dc.subject | Evidential probability | en_HK |
dc.subject | Odds | en_HK |
dc.subject | Operational complexity model | en_HK |
dc.title | A complexity based model for quantifying forensic evidential probabilities | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-5879-0&volume=&spage=671&epage=676&date=2010&atitle=A+complexity+based+model+for+quantifying+forensic+evidential+probabilities | - |
dc.identifier.email | Chow, KP:chow@cs.hku.hk | en_HK |
dc.identifier.authority | Chow, KP=rp00111 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/ARES.2010.42 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77952373595 | en_HK |
dc.identifier.hkuros | 182204 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77952373595&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 671 | en_HK |
dc.identifier.epage | 676 | en_HK |
dc.identifier.isi | WOS:000278197800103 | - |
dc.description.other | The 3rd International Workshop on Digital Forensics (WSDF 2010) to be held in conjunction with the 5th International Conference on Availability, Reliability and Security (ARES 2010), Krakow, Poland, 15-18 February 2010. In Proceedings of the International Conference on Availability, Reliability and Security, 2010, p. 671-676 | - |
dc.identifier.scopusauthorid | Overill, RE=6602223584 | en_HK |
dc.identifier.scopusauthorid | Silomon, JAM=36053451700 | en_HK |
dc.identifier.scopusauthorid | Chow, KP=7202180751 | en_HK |