File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A complexity based model for quantifying forensic evidential probabilities

TitleA complexity based model for quantifying forensic evidential probabilities
Authors
KeywordsBayesian posterior probability
Competing hypotheses
Digital forensics
Evidential probability
Odds
Operational complexity model
Issue Date2010
PublisherIEEE.
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?
AbstractAn 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 Identifierhttp://hdl.handle.net/10722/125686
ISBN
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorOverill, REen_HK
dc.contributor.authorSilomon, JAMen_HK
dc.contributor.authorChow, KPen_HK
dc.date.accessioned2010-10-31T11:46:02Z-
dc.date.available2010-10-31T11:46:02Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 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-676en_HK
dc.identifier.isbn978-1-4244-5879-0-
dc.identifier.urihttp://hdl.handle.net/10722/125686-
dc.description.abstractAn 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.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings of the International Conference on Availability, Reliability and Securityen_HK
dc.rightsInternational Conference on Availability, Reliability and Security Proceedings. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.subjectBayesian posterior probabilityen_HK
dc.subjectCompeting hypothesesen_HK
dc.subjectDigital forensicsen_HK
dc.subjectEvidential probabilityen_HK
dc.subjectOddsen_HK
dc.subjectOperational complexity modelen_HK
dc.titleA complexity based model for quantifying forensic evidential probabilitiesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://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.emailChow, KP:chow@cs.hku.hken_HK
dc.identifier.authorityChow, KP=rp00111en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ARES.2010.42en_HK
dc.identifier.scopuseid_2-s2.0-77952373595en_HK
dc.identifier.hkuros182204en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77952373595&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage671en_HK
dc.identifier.epage676en_HK
dc.identifier.isiWOS:000278197800103-
dc.description.otherThe 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.scopusauthoridOverill, RE=6602223584en_HK
dc.identifier.scopusauthoridSilomon, JAM=36053451700en_HK
dc.identifier.scopusauthoridChow, KP=7202180751en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats