Identifying Sensitive, Private, or Legally Protected Data in DRUM Submissions
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Identifying Sensitive, Private, or Legally Protected Data in DRUM Submissions
Alternative title
Authors
Published Date
2015
Publisher
Type
Presentation
Abstract
Identifying sensitive, private, or legally protected data is a prevalent issue that data repositories and archives are faced with today. Restricted information can be difficult to detect in large datasets, however there are numerous tools that can facilitate this process. This poster provides an overview of two tools that have extensive search and identification capabilities, namely Identity Finder and Bulk Extractor. The Data Repository for the University of Minnesota (DRUM) utilizes these tools to ensure that all submissions are free of restricted data. The workflow for evaluation and review of DRUM submissions was created using these tools and is also presented here. Additionally, the nineteen personal identifiers, defined by the HIPAA Privacy Rule, are listed with corresponding examples and procedures for identification.
Keywords
Description
Presented at the 2015 Research Data Access and Preservation Summit held April 23, 2015 in Minneapolis, MN.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Storino, Christine M. (2015). Identifying Sensitive, Private, or Legally Protected Data in DRUM Submissions. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/171825.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.