A Case Study In Forensic Analysis Of Control,
2011
California Sciences Institute, Fred Cohen & Associates
A Case Study In Forensic Analysis Of Control, Fred Cohen
Journal of Digital Forensics, Security and Law
This paper describes a case study in which a method for forensic analysis of control was applied to resolve probative technical issues in a legal action. It describes one instance in which the analysis was successfully applied without challenge, addresses the details of most of the different facets of the analysis method, and demonstrates how such analysis provides a systematic approach to using technical methods to address legal issues as a case study.
Extraction Of Electronic Evidence From Voip: Forensic Analysis Of A Virtual Hard Disk Vs Ram,
2011
University of South Australia, Australia
Extraction Of Electronic Evidence From Voip: Forensic Analysis Of A Virtual Hard Disk Vs Ram, David Irwin, Jill Slay, Arek Dadej, Malcolm Shore
Journal of Digital Forensics, Security and Law
The popularity of Voice over the Internet Protocol (VoIP) is increasing as the cost savings and ease of use is realised by a wide range of home and corporate users. However, the technology is also attractive to criminals. This is because VoIP is a global telephony service, in which it is difficult to verify the user’s identification. The security of placing such calls may also be appealing to criminals, as many implementations use strong encryption to secure both the voice payload as well as to control messages making monitoring such VoIP calls difficult since conventional methods such as wire-tapping is …
Table Of Contents,
2011
Embry-Riddle Aeronautical University
Table Of Contents
Journal of Digital Forensics, Security and Law
No abstract provided.
Book Review: Ios Forensic Analysis: For Iphone, Ipad And Ipod Touch,
2011
LuciData Inc, Minneapolis
Book Review: Ios Forensic Analysis: For Iphone, Ipad And Ipod Touch, Christopher Schulte
Journal of Digital Forensics, Security and Law
As Digital Forensics practitioners, we know that our discipline is constantly evolving. Keeping abreast means we need to continually refine and broaden our knowledge pools through experience, education, research, peer exchange, and more. Mobile device forensics can be especially dynamic and challenging. With multiple standards in place at the hardware, operating system, and user interface levels, it can be daunting to preserve, analyze, search and report on these tiny yet ubiquitous hand-held computers. Apple Computer’s line of mobile products (iOS devices - iPhone, iPad, iPod Touch) is no exception to this rule.
Column: Every Last Byte,
2011
Naval Postgraduate School
Column: Every Last Byte, Simson Garfinkel
Journal of Digital Forensics, Security and Law
Inheritance powder is the name that was given to poisons, especially arsenic, that were commonly used in the 17th and early 18th centuries to hasten the death of the elderly. For most of the 17th century, arsenic was deadly but undetectable, making it nearly impossible to prove that someone had been poisoned. The first arsenic test produced a gas—hardly something that a scientist could show to a judge. Faced with a growing epidemic of poisonings, doctors and chemists spent decades searching for something better
Technology Corner: Brute Force Password Generation -- Basic Iterative And Recursive Algorithms,
2011
University of New Mexico
Technology Corner: Brute Force Password Generation -- Basic Iterative And Recursive Algorithms, Nick V. Flor, Haile Shannon
Journal of Digital Forensics, Security and Law
Most information systems are secured at minimum by some form of password protection. For various reasons a password may be unavailable, requiring some form of password recovery procedure. One such procedure is software-based automated password recovery, where a program attempts to log into a system by repeatedly trying different password combinations. At the core of such software is a password generator. This article describes the basic iterative and recursive algorithms for generating all possible passwords of a given length, which is commonly referred to as brute-force password generation. The paper ends with a discussion of alternative password recovery procedures one …
Identity-Based Strong Designated Verifier Signature Revisited,
2011
Singapore Management University
Identity-Based Strong Designated Verifier Signature Revisited, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Research Collection School Of Computing and Information Systems
Designated verifier signature (DVS) allows the signer to persuade a verifier the validity of a statement but prevent the verifier from transferring the conviction. Strong designated verifier signature (SDVS) is a variant of DVS, which only allows the verifier to privately check the validity of the signer’s signature. In this work we observe that the unforgeability model considered in the existing identity-based SDVS schemes is not strong enough to capture practical attacks, and propose to consider another model which is shown to be strictly stronger than the old one. We then propose a new efficient construction of identity-based SDVS scheme, …
Behaviour Profiling For Transparent Authentication For Mobile Devices,
2011
Edith Cowan University
Behaviour Profiling For Transparent Authentication For Mobile Devices, Fudong Li, Nathan Clarke, Maria Papadaki, Paul Dowland
Research outputs 2011
Since the first handheld cellular phone was introduced in 1970s, the mobile phone has changed significantly both in terms of popularity and functionality. With more than 4.6 billion subscribers around the world, it has become a ubiquitous device in our daily life. Apart from the traditional telephony and text messaging services, people are enjoying a much wider range of mobile services over a variety of network connections in the form of mobile applications. Although a number of security mechanisms such as authentication, antivirus, and firewall applications are available, it is still difficult to keep up with various mobile threats (i.e. …
Security Risk Management: A Psychometric Map Of Expert Knowledge Structure,
2011
Edith Cowan University
Security Risk Management: A Psychometric Map Of Expert Knowledge Structure, David Brooks
Research outputs 2011
The security industry operates within a diverse and multi-disciplined knowledge base, with risk management as a fundamental knowledge domain within security to mitigate its risks. Nevertheless, there has been limited research in understanding and mapping security expert knowledge structures within security risk management to consider if parts of security risk management are unique from more general risk management. This interpretive study applied a technique of multidimensional scaling (MDS) to develop and present a psychometric map within the knowledge domain of security risk management, validated with expert interviews. The psychometric MDS security risk management concept map presented the expert knowledge structure …
Analysis Of Data Remaining On Second Hand Adsl Routers,
2011
Edith Cowan University
Analysis Of Data Remaining On Second Hand Adsl Routers, Patryk Szewczyk
Research outputs 2011
In theory, an ADSL router can provide an additional layer of security to a wired and wireless network through; access control, wireless encryption, firewall rule sets, and network event logging. An ADSL router may also contain the users’ usage habits and broadband account credentials. However, end-users may be unaware of the intricacies of the security measures available and the potentially confidential information stored on their device. As a result a second hand ADSL router may contain a wealth of user-specific information if not wiped and disposed of in a secure manner. This paper shows the data that was acquired from …
Lightweight Delegated Subset Test With Privacy Protection,
2011
Singapore Management University
Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen
Research Collection School Of Computing and Information Systems
Delegated subset tests are mandatory in many applications, such as content-based networks and outsourced text retrieval, where an untrusted server evaluates the degree of matching between two data sets. We design a novel scheme to protect the privacy of the data sets in comparison against the untrusted server, with half of the computation cost and half of the ciphertext size of existing solutions based on predicate only encryption supporting inner product.
Efficient Strong Designated Verifier Signature Schemes Without Random Oracle Or With Non-Delegatability,
2011
Singapore Management University
Efficient Strong Designated Verifier Signature Schemes Without Random Oracle Or With Non-Delegatability, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Research Collection School Of Computing and Information Systems
Designated verifier signature (DVS) allows a signer to convince a designated verifier that a signature is generated by the signer without letting the verifier transfer the conviction to others, while the public can still tell that the signature must be generated by one of them. Strong DVS (SDVS) strengthens the latter part by restricting the public from telling whether the signature is generated by one of them or by someone else. In this paper, we propose two new SDVS schemes. Compared with existing SDVS schemes, the first new scheme has almost the same signature size and meanwhile, is proven secure …
Masthead,
2010
Embry-Riddle Aeronautical University
Front Matter,
2010
Embry-Riddle Aeronautical University
Back Matter,
2010
Embry-Riddle Aeronautical University
Analysis Of A Database Insider Threat Model,
2010
University of Arkansas, Fayetteville
Analysis Of A Database Insider Threat Model, Andrea Samuel
Computer Science and Computer Engineering Undergraduate Honors Theses
According to Silicon.com's CIO Insight - Beware the Insider Security Threat, insiders are bigger threats to corporate security than external threats such as denial of service attacks or malware. Statistics show that 70% of fraud is perpetrated by staff and that the main data security threat comes from poorly trained or disgruntled employees who are authorized to have access to data and file stores [4]. This research project focuses specifically on the problem of insider threat in relational database systems. The project involves simulating research conducted in Qussai Yaseen and Brajendra Panda's research paper, Predicting and Preventing Insider Threat in …
Dynamic Group Key Exchange Revisited,
2010
Singapore Management University
Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan
Research Collection School Of Computing and Information Systems
In a dynamic group key exchange protocol, besides the basic group setup protocol, there are also a join protocol and a leave protocol, which allow the membership of an existing group to be changed more efficiently than rerunning the group setup protocol. The join and leave protocols should ensure that the session key is updated upon every membership change so that the subsequent sessions are protected from leaving members (backward security) and the previous sessions are protected from joining members (forward security). In this paper, we present a new security model for dynamic group key exchange. Comparing to existing models, …
Revisiting Address Space Randomization,
2010
Nankai University
Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao
Research Collection School Of Computing and Information Systems
Address space randomization is believed to be a strong defense against memory error exploits. Many code and data objects in a potentially vulnerable program and the system could be randomized, including those on the stack and heap, base address of code, order of functions, PLT, GOT, etc. Randomizing these code and data objects is believed to be effective in obfuscating the addresses in memory to obscure locations of code and data objects. However, attacking techniques have advanced since the introduction of address space randomization. In particular, return-oriented programming has made attacks without injected code much more powerful than what they …
Time Cost Evaluation For Executing Rfid Authentication Protocols,
2010
Singapore Management University
Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner
Research Collection School Of Computing and Information Systems
There are various reader/tag authentication protocols proposed for the security of RFID systems. Such a protocol normally contains several rounds of conversations between a tag and a reader and involves cryptographic operations at both reader and tag sides. Currently there is a lack of benchmarks that provide a fair comparison platform for (a) the time cost of cryptographic operations at the tag side and (b) the time cost of data exchange between a reader and a tag, making it impossible to evaluate the total time cost for executing a protocol. Based on our experiments implemented on IAIK UHF tag emulators …
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings,
2010
Singapore Management University
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen
Research Collection School Of Computing and Information Systems
Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob. Proxy re-encryption is a very useful primitive, having many applications in distributed file systems, outsourced filtering of encrypted spam, access control over network storage, and so on. Lately, Weng et al. proposed the first unidirectional proxy re-encryption scheme without using bilinear pairs. However, Weng et al.'s construction does not possess collusion resilience, in the sense that a coalition of the proxy and the delegatee can recover the delegator's private …
