Extending the advanced forensic format to accommodate multiple data sources, logical evidence, arbitrary information and forensic workflow

Forensic analysis requires the acquisition and management of many different types of evidence, including individual disk drives, RAID sets, network packets, memory images, and extracted files. Often the same evidence is reviewed by several different tools or examiners in different locations. We propose a backwards-compatible redesign of the Advanced Forensic Formatdan open, extensible file format for storing and sharing of evidence, arbitrary case related information and analysis results among different tools. The new specification, termed AFF4, is designed to be simple to implement, built upon the well supported ZIP file format specification. Furthermore, the AFF4 implementation has downward comparability with existing AFF files.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

Knowledge Sharing within IT Projects

Even though today’s corporations recognize that they need to understand modern project management techniques (Schwalbe, 2002, p2), many researchers continue to provide evidence of poor IT project success. With Kotnour, (2000) finding that project performance is positively associated with project knowledge, a better understanding of how to effectively manage knowledge in IT projects should have considerable practical significance for increasing the chances of project success. Using a combined qualitative/quantitative method of data collection in multiple case studies spanning four continents, and comprising a variety of organizational types, the focus of this current research centered on the question of why individuals working within IT project teams might be motivated towards, or inhibited from, sharing their knowledge and experience in their activities, procedures, and processes. The research concluded with the development of a new theoretical model of knowledge sharing behavior, ‘The Alignment Model of Motivational Focus’. This model suggests that an individual’s propensity to share knowledge and experience is a function of perceived personal benefits and costs associated with the activity, balanced against the individual’s alignment to a group of ‘institutional’ factors. These factors are identified as alignments to the project team, to the organization, and dependent on the circumstances, to either the professional discipline or community of practice, to which the individual belongs.