Current Search: Department of Computer Science (x)
Search results
(1 - 15 of 15)
- Title
- Analysis of Temporal Constraints in Qualitative Eligibility Criteria of Cancer Clinical Studies.
- Creator
-
He, Zhe, Chen, Zhiwei, Bian, Jiang
- Abstract/Description
-
Clinical studies, especially randomized controlled trials, generate gold-standard medical evidence. However, the lack of population representativeness of clinical studies has hampered their generalizability to the real-world population. Overly restrictive qualitative criteria are often applied to exclude patients. In this work, we develop a lexical-pattern-based tool to structure qualitative eligibility criteria with temporal constraints, with which we analyzed over 10,800 cancer clinical...
Show moreClinical studies, especially randomized controlled trials, generate gold-standard medical evidence. However, the lack of population representativeness of clinical studies has hampered their generalizability to the real-world population. Overly restrictive qualitative criteria are often applied to exclude patients. In this work, we develop a lexical-pattern-based tool to structure qualitative eligibility criteria with temporal constraints, with which we analyzed over 10,800 cancer clinical studies. Our results showed that restrictive temporal constraints are often applied on qualitative criteria in cancer studies, limiting the generalizability of their results.
Show less - Date Issued
- 2016-12-01
- Identifier
- FSU_pmch_29263940, 10.1109/BIBM.2016.7822607, PMC5733789, 29263940, 29263940
- Format
- Citation
- Title
- Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks.
- Creator
-
Zhu, Junxing, Zhang, Jiawei, Wu, Quanyuan, Jia, Yan, Zhou, Bin, Wei, Xiaokai, Yu, Philip S
- Abstract/Description
-
Nowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in...
Show moreNowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in real scenarios, such a requirement can hardly be met and most anchor links are unlabeled, since manually labeling the inter-network anchor links is quite costly and tedious. To overcome such a problem and utilize the numerous unlabeled anchor links in model building, in this paper, we introduce the active learning based anchor link prediction problem. Different from the traditional active learning problems, due to the on anchor links, if an unlabeled anchor link a = ( u , v ) is identified as positive (i.e., existing), all the other unlabeled anchor links incident to account or account will be negative (i.e., non-existing) automatically. Viewed in such a perspective, asking for the labels of potential positive anchor links in the unlabeled set will be rewarding in the active anchor link prediction problem. Various novel anchor link information gain measures are defined in this paper, based on which several constraint active anchor link prediction methods are introduced. Extensive experiments have been done on real-world social network datasets to compare the performance of these methods with state-of-art anchor link prediction methods. The experimental results show that the proposed method can outperform other methods with significant advantages.
Show less - Date Issued
- 2017-08-03
- Identifier
- FSU_pmch_28771201, 10.3390/s17081786, PMC5580167, 28771201, 28771201, s17081786
- Format
- Citation
- Title
- Construction and Optimization of a Large Gene Coexpression Network in Maize Using RNA-Seq Data.
- Creator
-
Huang, Ji, Vendramin, Stefania, Shi, Lizhen, McGinnis, Karen M
- Abstract/Description
-
With the emergence of massively parallel sequencing, genomewide expression data production has reached an unprecedented level. This abundance of data has greatly facilitated maize research, but may not be amenable to traditional analysis techniques that were optimized for other data types. Using publicly available data, a gene coexpression network (GCN) can be constructed and used for gene function prediction, candidate gene selection, and improving understanding of regulatory pathways....
Show moreWith the emergence of massively parallel sequencing, genomewide expression data production has reached an unprecedented level. This abundance of data has greatly facilitated maize research, but may not be amenable to traditional analysis techniques that were optimized for other data types. Using publicly available data, a gene coexpression network (GCN) can be constructed and used for gene function prediction, candidate gene selection, and improving understanding of regulatory pathways. Several GCN studies have been done in maize (), mostly using microarray datasets. To build an optimal GCN from plant materials RNA-Seq data, parameters for expression data normalization and network inference were evaluated. A comprehensive evaluation of these two parameters and a ranked aggregation strategy on network performance, using libraries from 1266 maize samples, were conducted. Three normalization methods and 10 inference methods, including six correlation and four mutual information methods, were tested. The three normalization methods had very similar performance. For network inference, correlation methods performed better than mutual information methods at some genes. Increasing sample size also had a positive effect on GCN. Aggregating single networks together resulted in improved performance compared to single networks.
Show less - Date Issued
- 2017-09-01
- Identifier
- FSU_pmch_28768814, 10.1104/pp.17.00825, PMC5580776, 28768814, 28768814, pp.17.00825
- Format
- Citation
- Title
- Correction to: Evaluating semantic relations in neural word embeddings with biomedical and general domain knowledge bases..
- Creator
-
Chen, Zhiwei, He, Zhe, Liu, Xiuwen, Bian, Jiang
- Abstract/Description
-
After publication of this supplement article [1], it was brought to our attention that the Results section of the abstract contained a partial sentence.
- Date Issued
- 2018-08-22
- Identifier
- FSU_pmch_30134877, 10.1186/s12911-018-0655-1, PMC6104021, 30134877, 30134877, 10.1186/s12911-018-0655-1
- Format
- Citation
- Title
- Enriching consumer health vocabulary through mining a social Q&A site: A similarity-based approach..
- Creator
-
He, Zhe, Chen, Zhiwei, Oh, Sanghee, Hou, Jinghui, Bian, Jiang
- Abstract/Description
-
The widely known vocabulary gap between health consumers and healthcare professionals hinders information seeking and health dialogue of consumers on end-user health applications. The Open Access and Collaborative Consumer Health Vocabulary (OAC CHV), which contains health-related terms used by lay consumers, has been created to bridge such a gap. Specifically, the OAC CHV facilitates consumers' health information retrieval by enabling consumer-facing health applications to translate between...
Show moreThe widely known vocabulary gap between health consumers and healthcare professionals hinders information seeking and health dialogue of consumers on end-user health applications. The Open Access and Collaborative Consumer Health Vocabulary (OAC CHV), which contains health-related terms used by lay consumers, has been created to bridge such a gap. Specifically, the OAC CHV facilitates consumers' health information retrieval by enabling consumer-facing health applications to translate between professional language and consumer friendly language. To keep up with the constantly evolving medical knowledge and language use, new terms need to be identified and added to the OAC CHV. User-generated content on social media, including social question and answer (social Q&A) sites, afford us an enormous opportunity in mining consumer health terms. Existing methods of identifying new consumer terms from text typically use ad-hoc lexical syntactic patterns and human review. Our study extends an existing method by extracting n-grams from a social Q&A textual corpus and representing them with a rich set of contextual and syntactic features. Using K-means clustering, our method, simiTerm, was able to identify terms that are both contextually and syntactically similar to the existing OAC CHV terms. We tested our method on social Q&A corpora on two disease domains: diabetes and cancer. Our method outperformed three baseline ranking methods. A post-hoc qualitative evaluation by human experts further validated that our method can effectively identify meaningful new consumer terms on social Q&A.
Show less - Date Issued
- 2017-05-01
- Identifier
- FSU_pmch_28359728, 10.1016/j.jbi.2017.03.016, PMC5488691, 28359728, 28359728, S1532-0464(17)30065-5
- Format
- Citation
- Title
- Evaluating Semantic Relations In Neural Word Embeddings With Biomedical And General Domain Knowledge Bases (vol 18, 65, 2018).
- Creator
-
Chen, Zhiwei, He, Zhe, Liu, Xiuwen, Bian, Jiang
- Date Issued
- 2018-08-22
- Identifier
- FSU_libsubv1_wos_000442465900001, 10.1186/s12911-018-0655-1
- Format
- Thesis
- Title
- Evaluating semantic relations in neural word embeddings with biomedical and general domain knowledge bases.
- Creator
-
Chen, Zhiwei, He, Zhe, Liu, Xiuwen, Bian, Jiang
- Abstract/Description
-
In the past few years, neural word embeddings have been widely used in text mining. However, the vector representations of word embeddings mostly act as a black box in downstream applications using them, thereby limiting their interpretability. Even though word embeddings are able to capture semantic regularities in free text documents, it is not clear how different kinds of semantic relations are represented by word embeddings and how semantically-related terms can be retrieved from word...
Show moreIn the past few years, neural word embeddings have been widely used in text mining. However, the vector representations of word embeddings mostly act as a black box in downstream applications using them, thereby limiting their interpretability. Even though word embeddings are able to capture semantic regularities in free text documents, it is not clear how different kinds of semantic relations are represented by word embeddings and how semantically-related terms can be retrieved from word embeddings. To improve the transparency of word embeddings and the interpretability of the applications using them, in this study, we propose a novel approach for evaluating the semantic relations in word embeddings using external knowledge bases: Wikipedia, WordNet and Unified Medical Language System (UMLS). We trained multiple word embeddings using health-related articles in Wikipedia and then evaluated their performance in the analogy and semantic relation term retrieval tasks. We also assessed if the evaluation results depend on the domain of the textual corpora by comparing the embeddings of health-related Wikipedia articles with those of general Wikipedia articles. Regarding the retrieval of semantic relations, we were able to retrieve diverse semantic relations in the nearest neighbors of a given word. Meanwhile, the two popular word embedding approaches, Word2vec and GloVe, obtained comparable results on both the analogy retrieval task and the semantic relation retrieval task, while dependency-based word embeddings had much worse performance in both tasks. We also found that the word embeddings trained with health-related Wikipedia articles obtained better performance in the health-related relation retrieval tasks than those trained with general Wikipedia articles. It is evident from this study that word embeddings can group terms with diverse semantic relations together. The domain of the training corpus does have impact on the semantic relations represented by word embeddings. We thus recommend using domain-specific corpus to train word embeddings for domain-specific text mining tasks.
Show less - Date Issued
- 2018-07-23
- Identifier
- FSU_pmch_30066651, 10.1186/s12911-018-0630-x, PMC6069806, 30066651, 30066651, 10.1186/s12911-018-0630-x
- Format
- Citation
- Title
- A harmonized segmentation protocol for hippocampal and parahippocampal subregions: Why do we need one and what are the key goals?.
- Creator
-
Wisse, Laura E M, Daugherty, Ana M, Olsen, Rosanna K, Berron, David, Carr, Valerie A, Stark, Craig E L, Amaral, Robert S C, Amunts, Katrin, Augustinack, Jean C, Bender, Andrew R...
Show moreWisse, Laura E M, Daugherty, Ana M, Olsen, Rosanna K, Berron, David, Carr, Valerie A, Stark, Craig E L, Amaral, Robert S C, Amunts, Katrin, Augustinack, Jean C, Bender, Andrew R, Bernstein, Jeffrey D, Boccardi, Marina, Bocchetta, Martina, Burggren, Alison, Chakravarty, M Mallar, Chupin, Marie, Ekstrom, Arne, de Flores, Robin, Insausti, Ricardo, Kanel, Prabesh, Kedo, Olga, Kennedy, Kristen M, Kerchner, Geoffrey A, LaRocque, Karen F, Liu, Xiuwen, Maass, Anne, Malykhin, Nicolai, Mueller, Susanne G, Ofen, Noa, Palombo, Daniela J, Parekh, Mansi B, Pluta, John B, Pruessner, Jens C, Raz, Naftali, Rodrigue, Karen M, Schoemaker, Dorothee, Shafer, Andrea T, Steve, Trevor A, Suthana, Nanthia, Wang, Lei, Winterburn, Julie L, Yassa, Michael A, Yushkevich, Paul A, la Joie, Renaud
Show less - Abstract/Description
-
The advent of high-resolution magnetic resonance imaging (MRI) has enabled in vivo research in a variety of populations and diseases on the structure and function of hippocampal subfields and subdivisions of the parahippocampal gyrus. Because of the many extant and highly discrepant segmentation protocols, comparing results across studies is difficult. To overcome this barrier, the Hippocampal Subfields Group was formed as an international collaboration with the aim of developing a harmonized...
Show moreThe advent of high-resolution magnetic resonance imaging (MRI) has enabled in vivo research in a variety of populations and diseases on the structure and function of hippocampal subfields and subdivisions of the parahippocampal gyrus. Because of the many extant and highly discrepant segmentation protocols, comparing results across studies is difficult. To overcome this barrier, the Hippocampal Subfields Group was formed as an international collaboration with the aim of developing a harmonized protocol for manual segmentation of hippocampal and parahippocampal subregions on high-resolution MRI. In this commentary we discuss the goals for this protocol and the associated key challenges involved in its development. These include differences among existing anatomical reference materials, striking the right balance between reliability of measurements and anatomical validity, and the development of a versatile protocol that can be adopted for the study of populations varying in age and health. The commentary outlines these key challenges, as well as the proposed solution of each, with concrete examples from our working plan. Finally, with two examples, we illustrate how the harmonized protocol, once completed, is expected to impact the field by producing measurements that are quantitatively comparable across labs and by facilitating the synthesis of findings across different studies. © 2016 Wiley Periodicals, Inc.
Show less - Date Issued
- 2017-01-01
- Identifier
- FSU_pmch_27862600, 10.1002/hipo.22671, PMC5167633, 27862600, 27862600
- Format
- Citation
- Title
- Multiscale Model For Pedestrian And Infection Dynamics During Air Travel.
- Creator
-
Namilae, Sirish, Derjany, Pierrot, Mubayi, Anuj, Scotch, Mathew, Srinivasan, Ashok
- Abstract/Description
-
In this paper we develop a multiscale model combining social-force-based pedestrian movement with a population level stochastic infection transmission dynamics framework. The model is then applied to study the infection transmission within airplanes and the transmission of the Ebola virus through casual contacts. Drastic limitations on air-travel during epidemics, such as during the 2014 Ebola outbreak in West Africa, carry considerable economic and human costs. We use the computational model...
Show moreIn this paper we develop a multiscale model combining social-force-based pedestrian movement with a population level stochastic infection transmission dynamics framework. The model is then applied to study the infection transmission within airplanes and the transmission of the Ebola virus through casual contacts. Drastic limitations on air-travel during epidemics, such as during the 2014 Ebola outbreak in West Africa, carry considerable economic and human costs. We use the computational model to evaluate the effects of passenger movement within airplanes and air-travel policies on the geospatial spread of infectious diseases. We find that boarding policy by an airline is more critical for infection propagation compared to deplaning policy. Enplaning in two sections resulted in fewer infections than the currently followed strategy with multiple zones. In addition, we found that small commercial airplanes are better than larger ones at reducing the number of new infections in a flight. Aggregated results indicate that passenger movement strategies and airplane size predicted through these network models can have significant impact on an event like the 2014 Ebola epidemic. The methodology developed here is generic and can be readily modified to incorporate the impact from the outbreak of other directly transmitted infectious diseases.
Show less - Date Issued
- 2017-05-31
- Identifier
- FSU_libsubv1_wos_000402477600002, 10.1103/PhysRevE.95.052320
- Format
- Citation
- Title
- RFID Ownership Transfer with Positive Secrecy Capacity Channels.
- Creator
-
Munilla, Jorge, Burmester, Mike, Peinado, Alberto, Yang, Guomin, Susilo, Willy
- Abstract/Description
-
RFID ownership transfer protocols (OTPs) transfer tag ownership rights. Recently, there has been considerable interest in such protocols; however, guaranteeing privacy for symmetric-key settings without trusted third parties (TTPs) is a challenge still unresolved. In this paper, we address this issue and show that it can be solved by using channels with positive secrecy capacity. We implement these channels with noisy tags and provide practical values, thus proving that perfect secrecy is...
Show moreRFID ownership transfer protocols (OTPs) transfer tag ownership rights. Recently, there has been considerable interest in such protocols; however, guaranteeing privacy for symmetric-key settings without trusted third parties (TTPs) is a challenge still unresolved. In this paper, we address this issue and show that it can be solved by using channels with positive secrecy capacity. We implement these channels with noisy tags and provide practical values, thus proving that perfect secrecy is theoretically possible. We then define a communication model that captures spatiotemporal events and describe a first example of symmetric-key based OTP that: (i) is formally secure in the proposed communication model and (ii) achieves privacy with a noisy tag wiretap channel without TTPs.
Show less - Date Issued
- 2016-12-29
- Identifier
- FSU_pmch_28036085, 10.3390/s17010053, PMC5298626, 28036085, 28036085, s17010053
- Format
- Citation
- Title
- An Rfid-based Smart Structure For The Supply Chain: Resilient Scanning Proofs And Ownership Transfer With Positive Secrecy Capacity Channels.
- Creator
-
Burmester, Mike, Munilla, Jorge, Ortiz, Andres, Caballero-Gil, Pino
- Abstract/Description
-
The National Strategy for Global Supply Chain Security published in 2012 by the White House identifies two primary goals for strengthening global supply chains: first, to promote the efficient and secure movement of goods, and second to foster a resilient supply chain. The Internet of Things (IoT), and in particular Radio Frequency Identification (RFID) technology, can be used to realize these goals. For product identification, tracking and real-time awareness, RFID tags are attached to goods...
Show moreThe National Strategy for Global Supply Chain Security published in 2012 by the White House identifies two primary goals for strengthening global supply chains: first, to promote the efficient and secure movement of goods, and second to foster a resilient supply chain. The Internet of Things (IoT), and in particular Radio Frequency Identification (RFID) technology, can be used to realize these goals. For product identification, tracking and real-time awareness, RFID tags are attached to goods. As tagged goods move along the supply chain from the suppliers to the manufacturers, and then on to the retailers until eventually they reach the customers, two major security challenges can be identified: (I) to protect the shipment of goods that are controlled by potentially untrusted carriers; and (II) to secure the transfer of ownership at each stage of the chain. For the former, grouping proofs in which the tags of the scanned goods generate a proof of simulatenous presence can be employed, while for the latter, ownership transfer protocols (OTP) are used. This paper describes enhanced security solutions for both challenges. We first extend earlier work on grouping proofs and group codes to capture resilient group scanning with untrusted readers; then, we describe a modified version of a recently published OTP based on channels with positive secrecy capacity adapted to be implemented on common RFID systems in the supply chain. The proposed solutions take into account the limitations of low cost tags employed in the supply chain, which are only required to generate pseudorandom numbers and compute one-way hash functions.
Show less - Date Issued
- 2017-07
- Identifier
- FSU_libsubv1_wos_000407517600101, 10.3390/s17071562
- Format
- Citation
- Title
- An RFID-Based Smart Structure for the Supply Chain: Resilient Scanning Proofs and Ownership Transfer with Positive Secrecy Capacity Channels..
- Creator
-
Burmester, Mike, Munilla, Jorge, Ortiz, Andrés, Caballero-Gil, Pino
- Abstract/Description
-
The National Strategy for Global Supply Chain Security published in 2012 by the White House identifies two primary goals for strengthening global supply chains: first, to promote the efficient and secure movement of goods, and second to foster a resilient supply chain. The Internet of Things (IoT), and in particular Radio Frequency Identification (RFID) technology, can be used to realize these goals. For product identification, tracking and real-time awareness, RFID tags are attached to goods...
Show moreThe National Strategy for Global Supply Chain Security published in 2012 by the White House identifies two primary goals for strengthening global supply chains: first, to promote the efficient and secure movement of goods, and second to foster a resilient supply chain. The Internet of Things (IoT), and in particular Radio Frequency Identification (RFID) technology, can be used to realize these goals. For product identification, tracking and real-time awareness, RFID tags are attached to goods. As tagged goods move along the supply chain from the suppliers to the manufacturers, and then on to the retailers until eventually they reach the customers, two major security challenges can be identified: (I) to protect the shipment of goods that are controlled by potentially untrusted carriers; and (II) to secure the transfer of ownership at each stage of the chain. For the former, grouping proofs in which the tags of the scanned goods generate a proof of "simulatenous" presence can be employed, while for the latter, ownership transfer protocols (OTP) are used. This paper describes enhanced security solutions for both challenges. We first extend earlier work on grouping proofs and group codes to capture resilient group scanning with untrusted readers; then, we describe a modified version of a recently published OTP based on channels with positive secrecy capacity adapted to be implemented on common RFID systems in the supply chain. The proposed solutions take into account the limitations of low cost tags employed in the supply chain, which are only required to generate pseudorandom numbers and compute one-way hash functions.
Show less - Date Issued
- 2017-07-04
- Identifier
- FSU_pmch_28677637, 10.3390/s17071562, PMC5539709, 28677637, 28677637, s17071562
- Format
- Citation
- Title
- The structure of the actin-smooth muscle myosin motor domain complex in the rigor state.
- Creator
-
Banerjee, Chaity, Hu, Zhongjun, Huang, Zhong, Warrington, J Anthony, Taylor, Dianne W, Trybus, Kathleen M, Lowey, Susan, Taylor, Kenneth A
- Abstract/Description
-
Myosin-based motility utilizes catalysis of ATP to drive the relative sliding of F-actin and myosin. The earliest detailed model based on cryo-electron microscopy (cryoEM) and X-ray crystallography postulated that higher actin affinity and lever arm movement were coupled to closure of a feature of the myosin head dubbed the actin-binding cleft. Several studies since then using crystallography of myosin-V and cryoEM structures of F-actin bound myosin-I, -II and -V have provided details of this...
Show moreMyosin-based motility utilizes catalysis of ATP to drive the relative sliding of F-actin and myosin. The earliest detailed model based on cryo-electron microscopy (cryoEM) and X-ray crystallography postulated that higher actin affinity and lever arm movement were coupled to closure of a feature of the myosin head dubbed the actin-binding cleft. Several studies since then using crystallography of myosin-V and cryoEM structures of F-actin bound myosin-I, -II and -V have provided details of this model. The smooth muscle myosin II interaction with F-actin may differ from those for striated and non-muscle myosin II due in part to different lengths of important surface loops. Here we report a ∼6 Å resolution reconstruction of F-actin decorated with the nucleotide-free recombinant smooth muscle myosin-II motor domain (MD) from images recorded using a direct electron detector. Resolution is highest for F-actin and the actin-myosin interface (3.5-4 Å) and lowest (∼6-7 Å) for those parts of the MD at the highest radius. Atomic models built into the F-actin density are quite comparable to those previously reported for rabbit muscle actin and show density from the bound ADP. The atomic model of the MD, is quite similar to a recently published structure of vertebrate non-muscle myosin II bound to F-actin and a crystal structure of nucleotide free myosin-V. Larger differences are observed when compared to the cryoEM structure of F-actin decorated with rabbit skeletal muscle myosin subfragment 1. The differences suggest less closure of the 50 kDa domain in the actin bound skeletal muscle myosin structure.
Show less - Date Issued
- 2017-12-01
- Identifier
- FSU_pmch_29038012, 10.1016/j.jsb.2017.10.003, PMC5748330, 29038012, 29038012, S1047-8477(17)30171-5
- Format
- Citation
- Title
- Systematically Generated Two-qubit Anyon Braids.
- Creator
-
Carnahan, Caitlin, Zeuch, Daniel, Bonesteel, N. E.
- Abstract/Description
-
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but...
Show moreFibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.
Show less - Date Issued
- 2016-05-20
- Identifier
- FSU_libsubv1_wos_000376243800001, 10.1103/PhysRevA.93.052328
- Format
- Citation
- Title
- Trueerase: Leveraging An Auxiliary Data Path For Per-file Secure Deletion.
- Creator
-
Diesburg, Sarah, Meyers, Christopher, Stanovich, Mark, Wang, An-I. Andy, Kuenning, Geoff
- Abstract/Description
-
One important aspect of privacy is the ability to securely delete sensitive data from electronic storage in such a way that it cannot be recovered; we call this action secure deletion. Short of physically destroying the entire storage medium, existing software secure-deletion solutions tend to be piecemeal at best - they may only work for one type of storage or file system, may force the user to delete all files instead of selected ones, may require the added complexities of encryption and...
Show moreOne important aspect of privacy is the ability to securely delete sensitive data from electronic storage in such a way that it cannot be recovered; we call this action secure deletion. Short of physically destroying the entire storage medium, existing software secure-deletion solutions tend to be piecemeal at best - they may only work for one type of storage or file system, may force the user to delete all files instead of selected ones, may require the added complexities of encryption and key storage, may require extensive changes and additions to the computer's operating system or storage firmware, and may not handle system crashes gracefully. We present TrueErase, a holistic secure-deletion framework for individual systems that contain sensitive data. Through design, implementation, verification, and evaluation on both a hard drive and NAND flash, TrueErase shows that it is possible to construct a per-file, secure-deletion framework that can accommodate different storage media and legacy file systems, require limited changes to legacy systems, and handle common crash scenarios. TrueErase can serve as a building block by cryptographic systems that securely delete information by erasing encryption keys. The overhead is dependent on spatial locality, number of sensitive files, and workload (computational-or I/O-bound).
Show less - Date Issued
- 2016-08
- Identifier
- FSU_libsubv1_wos_000382760500001, 10.1145/2854882
- Format
- Citation
