Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5401 - 5430 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo Feb 2011

Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Billions of dollars are spent annually on software-related cost. It is estimated that up to 45 percent of software cost is due to the difficulty in understanding existing systems when performing maintenance tasks (i.e., adding features, removing bugs, etc.). One of the root causes is that software products often come with poor, incomplete, or even without any documented specifications. In an effort to improve program understanding, Lo et al. have proposed iterative pattern mining which outputs patterns that are repeated frequently within a program trace, or across multiple traces, or both. Frequent iterative patterns reflect frequent program behaviors that likely …

Go to article

Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng Feb 2011

Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Privacy protection is one of the fundamental security requirements for database outsourcing. A major threat is information leakage from database access patterns generated by query executions. The standard private information retrieval (PIR) schemes, which are widely regarded as theoretical solutions, entail O(n) computational overhead per query for a database with items. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is as strong as PIR, though with O(1) online computation cost, they still have O(n) amortized cost per query due to periodically full database shuffles. In this paper, we …

Go to article

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy Feb 2011

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy

Research Collection School Of Computing and Information Systems

Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the …

Go to article

Artificial Cognitive Memory - Changing From Density Driven To Functionality Driven, Luping Shi, Kaijun Yi, Kiruthika Ramanathan, Rong Zhao, Ning Ning, Ding Ding, Tow Chong Chong Feb 2011

Artificial Cognitive Memory - Changing From Density Driven To Functionality Driven, Luping Shi, Kaijun Yi, Kiruthika Ramanathan, Rong Zhao, Ning Ning, Ding Ding, Tow Chong Chong

Research Collection School Of Computing and Information Systems

Increasing density based on bit size reduction is currently a main driving force for the development of data storage technologies. However, it is expected that all of the current available storage technologies might approach their physical limits in around 15 to 20 years due to miniaturization. To further advance the storage technologies, it is required to explore a new development trend that is different from density driven. One possible direction is to derive insights from biological counterparts. Unlike physical memories that have a single function of data storage, human memory is versatile. It contributes to functions of data storage, information …

Go to article

Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He Feb 2011

Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He

Research Collection School Of Computing and Information Systems

With the popularity of various social media applications, massive social images associated with high quality tags have been made available in many social media web sites nowadays. Mining social images on the web has become an emerging important research topic in web search and data mining. In this paper, we propose a machine learning framework for mining social images and investigate its application to automated image tagging. To effectively discover knowledge from social images that are often associated with multimodal contents (including visual images and textual tags), we propose a novel Unified Distance Metric Learning (UDML) scheme, which not only …

Go to article

An Effective Approach To Pose Invariant 3d Face Recognition, Dayong Wang, Steven C. H. Hoi, Ying He Jan 2011

An Effective Approach To Pose Invariant 3d Face Recognition, Dayong Wang, Steven C. H. Hoi, Ying He

Research Collection School Of Computing and Information Systems

One critical challenge encountered by existing face recognition techniques lies in the difficulties of handling varying poses. In this paper, we propose a novel pose invariant 3D face recognition scheme to improve regular face recognition from two aspects. Firstly, we propose an effective geometry based alignment approach, which transforms a 3D face mesh model to a well-aligned 2D image. Secondly, we propose to represent the facial images by a Locality Preserving Sparse Coding (LPSC) algorithm, which is more effective than the regular sparse coding algorithm for face representation. We conducted a set of extensive experiments on both 2D and 3D …

Go to article

Mining Event Structures From Web Videos, Xiao Wu, Yi-Jie Lu, Qiang Peng, Chong-Wah Ngo Jan 2011

Mining Event Structures From Web Videos, Xiao Wu, Yi-Jie Lu, Qiang Peng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

The article is discussing the issues of mining event structures from Web video search results using text analysis, burst detection, and clustering as with the proliferation of social media, the volume of Web videos have grown exponentially.

Go to article

Efficient Strong Designated Verifier Signature Schemes Without Random Oracle Or With Non-Delegatability, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo Jan 2011

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 …

Go to article

Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng Jan 2011

Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng

Research Collection School Of Computing and Information Systems

The timetabling problem arising from a university in Indonesia is addressed in this paper.It involves the assignment of teachers to the courses and course sections. We formulate theproblem as a mathematical programming model. Two different algorithms, mainly basedon simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving theproblem. The proposed algorithms consist of two phases. The first phase involves allocatingthe teachers to the courses and determining the number of courses to be assigned to eachteacher. The second phase involves assigning the teachers to the course sections in order tobalance the teachers’ load. The performance of the proposed …

Go to article

Innovation And Price Competition In A Two-Sided Market, Mei Lin, Shaojin Li, Andrew B. Whinston Jan 2011

Innovation And Price Competition In A Two-Sided Market, Mei Lin, Shaojin Li, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

We examine a platform's optimal two-sided pricing strategy while considering seller-side innovation decisions and price competition. We model the innovation race among sellers in both finite and infinite horizons. In the finite case, we analytically show that the platform's optimal seller-side access fee fully extracts the sellers' surplus, and that the optimal buyer-side access fee mitigates price competition among sellers. The platform's optimal strategy may be to charge or subsidize buyers depending on the degree of variation in the buyers' willingness to pay for quality; this optimal strategy induces full participation on both sides. Furthermore, a wider quality gap among …

Go to article

Randomly Projected Kd-Trees With Distance Metric Learning For Image Retrieval, Pengcheng Wu, Steven Hoi, Duc Dung Nguyen, Ying He Jan 2011

Randomly Projected Kd-Trees With Distance Metric Learning For Image Retrieval, Pengcheng Wu, Steven Hoi, Duc Dung Nguyen, Ying He

Research Collection School Of Computing and Information Systems

Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree) usually are only efficient for low dimensional data, but often perform no better than a simple exhaustive linear search when the number of dimensions is large enough. Recently, approximate NN search techniques have been proposed for high-dimensional search, such as Locality-Sensitive Hashing (LSH), which adopts some random projection approach. Motivated by similar idea, in this paper, we propose a new high dimensional NN search method, called Randomly Projected kd-Trees (RP-kd-Trees), which is to project data points into a lower-dimensional …

Go to article

Editorial: Special Issue On Ubiquitous Electronic Commerce Systems, Robert H. Deng, Jari Veijalainen, Shiguo Lian, Dimitris Kanellopoulos Jan 2011

Editorial: Special Issue On Ubiquitous Electronic Commerce Systems, Robert H. Deng, Jari Veijalainen, Shiguo Lian, Dimitris Kanellopoulos

Research Collection School Of Computing and Information Systems

Ubiquitous computing is a post-desktop model of human-computer interaction in which information processing has been thoroughly integrated into everyday objects and activities. Emerging ubiquitous electronic commerce systems (UECS) are expected to be available anytime, anywhere, and using different official or personal computing devices. Systems and services such as digital libraries, on-line business transactions, mobile office and mobile TV are widely deployed. Users will be able to access these services anytime, anywhere, while using any computing device in a pervasive way.

Go to article

Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu Jan 2011

Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu

Research Collection School Of Computing and Information Systems

This paper is concerned with the problem of Just-In-Time (JIT) job scheduling in a dynamic environment under uncertainty to attain timely service. We provide an approach, based on robust scheduling concepts, to analytically evaluate the expected cost of earliness and tardiness for each job and also the project. In addition, we search for a schedule execution policy with the minimum robust cost such that for a given risk level (epsilon), the actual realized schedule has (1 - epsilon) probability of completing with less than or equal to this robust cost. Our method is quite generic, and can be applied to …

Go to article

Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati Jan 2011

Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati

Research Collection School Of Computing and Information Systems

Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a framework based on DOE to find a good initial range of parameter values for automated tuning. We use a factorial experiment design to first screen and rank all the parameters thereby allowing us to then focus on the parameter …

Go to article

Would Price Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh Jan 2011

Would Price Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh

Research Collection School Of Computing and Information Systems

On May 6, 2010, the U.S. equity markets experienced a brief but highly unusual drop in prices across a number of stocks and indices. The Dow Jones Industrial Average (see Figure 1) fell by approximately 9% in a matter of minutes, and several stocks were traded down sharply before recovering a short time later. The authors contend that the events of May 6, 2010 exhibit patterns consistent with the type of "flash crash" observed in their earlier study (2010). This paper describes the results of nine different simulations created by using a large-scale computer model to reconstruct the critical elements …

Go to article

Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo Jan 2011

Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo

Research Collection School Of Computing and Information Systems

This paper is concerned with automated tuning of parameters in local-search based meta-heuristics. Several generic approaches have been introduced in the literature that returns a ”one-size-fits-all” parameter configuration for all instances. This is unsatisfactory since different instances may require the algorithm to use very different parameter configurations in order to find good solutions. There have been approaches that perform instance-based automated tuning, but they are usually problem-specific. In this paper, we propose CluPaTra, a generic (problem-independent) approach to perform parameter tuning, based on CLUstering instances with similar PAtterns according to their search TRAjectories. We propose representing a search trajectory as …

Go to article

Workshop Report From Web2se 2011: 2nd International Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black Jan 2011

Workshop Report From Web2se 2011: 2nd International Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black

Research Collection School Of Computing and Information Systems

Web 2.0 technologies, such as wikis, blogs, tags and feeds, have been adopted and adapted by software engineers. With the annual Web2SE workshop, we provide a venue for research on Web 2.0 for software engineering by highlighting state-of-the-art work, identifying current research areas, discussing implications of Web 2.0 on software engineering, and outlining the risks and challenges for researchers. This report highlights the paper and tool presentations, and the discussions among participants at Web2SE 2011 in Honolulu, as well as future directions of the Web2SE workshop community.

Go to article

Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen Jan 2011

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.

Go to article

Identity-Based Strong Designated Verifier Signature Revisited, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo Jan 2011

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, …

Go to article

A Usability Study Of A Mobile Content Sharing System, Alton Yeow-Kuan Chua, Dion Hoe-Lian Goh, Khasfariyati Razikin, Ee Peng Lim Jan 2011

A Usability Study Of A Mobile Content Sharing System, Alton Yeow-Kuan Chua, Dion Hoe-Lian Goh, Khasfariyati Razikin, Ee Peng Lim

Research Collection School Of Computing and Information Systems

We investigate the usability of MobiTOP (Mobile Tagging of Objects and People), a mobile location-based content sharing system. MobiTOP allows users to annotate real world locations with both multimedia and textual content and concurrently, share the annotations among its users. In addition, MobiTOP provides additional functionality such as clustering of annotations and advanced search and filtering options. A usability evaluation of the system was conducted in the context of a travel companion for tourists. The results suggested the potential of the system in terms of functionality for mobile content sharing. Participants agreed that the features in MobiTOP were generally usable …

Go to article

Trends And Controversies: Ai, Virtual Worlds, And Massively Multiplayer Online Games, Hsinchun Chen, Yulei Zhang, W. S. Bainbridge, Kyong Jin Shim, N. Pathak, M. A. Ahmad, C. Delong, Z. Borbora, A. Mahapatra, J. Srivastava Jan 2011

Trends And Controversies: Ai, Virtual Worlds, And Massively Multiplayer Online Games, Hsinchun Chen, Yulei Zhang, W. S. Bainbridge, Kyong Jin Shim, N. Pathak, M. A. Ahmad, C. Delong, Z. Borbora, A. Mahapatra, J. Srivastava

Research Collection School Of Computing and Information Systems

The rich social media data generated in virtual worlds has important implications for business, education, social science, and society at large. Similarly, massively multiplayer online games (MMOGs) have become increasingly popular and have online communities comprising tens of millions of players. They serve as unprecedented tools for theorizing about and empirically modeling the social and behavioral dynamics of individuals, groups, and networks within large communities. Some technologists consider virtual worlds and MMOGs to be likely candidates to become the Web 3.0. AI can play a significant role, from multiagent avatar research and immersive virtual interface design to virtual world and …

Go to article

Near-Duplicate Keyframe Retrieval By Semi-Supervised Learning And Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan Jan 2011

Near-Duplicate Keyframe Retrieval By Semi-Supervised Learning And Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Near-duplicate keyframe (NDK) retrieval techniques are critical to many real-world multimedia applications. Over the last few years, we have witnessed a surge of attention on studying near-duplicate image/keyframe retrieval in multimedia community. To facilitate an effective approach to NDK retrieval on large-scale data, we suggest an effective Multi-Level Ranking (MLR) scheme that effectively retrieves NDKs in a coarse-to-fine manner. One key stage of the MLR ranking scheme is how to learn an effective ranking function with extremely small training examples in a near-duplicate detection task. To attack this challenge, we employ a semi-supervised learning method, semi-supervised support vector machines, which …

Go to article

Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei Wu, Steven C. H. Hoi Jan 2011

Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The authors present an online semantics preserving, metric learning technique for improving the bag-of-words model and addressing the semantic-gap issue. This article investigates the challenge of reducing the semantic gap for building BoW models for image representation; propose a novel OSPML algorithm for enhancing BoW by minimizing the semantic loss, which is efficient and scalable for enhancing BoW models for large-scale applications; apply the proposed technique for large-scale image annotation and object recognition; and compare it to the state of the art.

Go to article

Concept-Driven Multi-Modality Fusion For Video Search, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo Jan 2011

Concept-Driven Multi-Modality Fusion For Video Search, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

As it is true for human perception that we gather information from different sources in natural and multi-modality forms, learning from multi-modalities has become an effective scheme for various information retrieval problems. In this paper, we propose a novel multi-modality fusion approach for video search, where the search modalities are derived from a diverse set of knowledge sources, such as text transcript from speech recognition, low-level visual features from video frames, and high-level semantic visual concepts from supervised learning. Since the effectiveness of each search modality greatly depends on specific user queries, prompt determination of the importance of a modality …

Go to article

Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh Jan 2011

Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh

Research Collection School Of Computing and Information Systems

This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). The proposed algorithminvolves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combinedSimulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Experimental results indicate that the hybridalgorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.

Go to article

Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan Dec 2010

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, …

Go to article

Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong Dec 2010

Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Patient safety is an emerging, major health care discipline with significance accentuated in the influential Institute of Medicine (IOM) reports in the United States “To Err is Human” and “Crossing the Quality Chasm”. These reports highlighted the danger and prevalence of medical errors and preventable adverse events, explained the three main sources of system-related, human factors-related and cognitive-related errors, and recommended the use of information and decision support technologies to help alleviate the problem. A number of studies and reports from all over the world with similar findings have since followed, culminating in the 55th World Health Assembly Resolution on …

Go to article

Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo Dec 2010

Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Search engines are used to return a long list of hundreds or even thousands of videos in response to a query topic. Efficient navigation of videos becomes difficult and users often need to painstakingly explore the search list for a gist of the search result. This paper addresses the challenge of topical summarization by providing a timeline-based visualization of videos through matching of heterogeneous sources. To overcome the so called sparse-text problem of web videos, auxiliary information from Google context is exploited. Google Trends is used to predict the milestone events of a topic. Meanwhile, the typical scenes of web …

Go to article

Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen Dec 2010

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 …

Go to article

A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang Dec 2010

A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Existing steganographic file systems enable a user to hide the existence of his secret data by claiming that they are (static) dummy data created during disk initialization. Such a claim is plausible if the adversary only sees the disk content at the point of attack. In a multi-user computing environment that employs untrusted shared storage, however, the adversary could have taken multiple snapshots of the disk content over time. Since the dummy data are static, the differences across snapshots thus disclose the locations of user data, and could even reveal the user passwords. In this paper, we introduce a Dummy-Relocatable …

Go to article

First Prev Next Last