公开(公告)号：US20120179915A1

公开(公告)日：2012-07-12

申请号：US12986895

申请日：2011-01-07

申请人： Deric S. Horn ,  Soren Carlson Spies ,  Bradley David Strand ,  Russell Dean Reece ,  Jonathan David Callas

发明人： Deric S. Horn ,  Soren Carlson Spies ,  Bradley David Strand ,  Russell Dean Reece ,  Jonathan David Callas

IPC分类号： H04L9/32 ,  G06F21/00

CPC分类号： G06F21/80

摘要： Disclosed herein are systems, methods, and non-transitory computer-readable storage media for authenticating a user logging in to an operating system stored on an encrypted drive. A system configured to practice the method presents a login prompt and receives credentials from a user. The system accesses the operating system on the encrypted drive based on the credentials and starts the operating system. Then the system authenticates the user on the operating system based on the credentials, such as via login forwarding. The system can set up a unified login by receiving a request to encrypt a storage device, and based on received user credentials, generating user data associated with logging in to an operating system on the computing device and user data for encrypting the storage device. The system stores the user data in a manner to enable a unified login boot prompt.

摘要翻译： 本文公开了用于认证登录到加密驱动器上存储的操作系统的用户的系统，方法和非暂时性的计算机可读存储介质。 配置为练习该方法的系统呈现登录提示并从用户接收凭证。 系统根据凭据访问加密驱动器上的操作系统并启动操作系统。 然后，系统将基于凭证（例如通过登录转发）对操作系统上的用户进行认证。 该系统可以通过接收对存储设备进行加密的请求，并且基于接收的用户凭证，生成与登录到计算设备上的操作系统相关联的用户数据以及用于加密存储设备的用户数据来设置统一登录。 该系统以允许统一登录启动提示的方式存储用户数据。

公开(公告)号：US08924739B2

公开(公告)日：2014-12-30

申请号：US12985190

申请日：2011-01-05

申请人： Deric S. Horn ,  Joseph Sokol, Jr. ,  Owen Joseph Strain ,  Wenguang Wang

发明人： Deric S. Horn ,  Joseph Sokol, Jr. ,  Owen Joseph Strain ,  Wenguang Wang

IPC分类号： G06F21/00 ,  G06F21/78

CPC分类号： G06F21/78

摘要： Disclosed herein are systems, methods, and non-transitory computer-readable storage media for performing in-place encryption. A system configured to practice the method receives a request from a user to encrypt an unencrypted volume of a computing device and identifies, generates, and/or randomly selects a volume key. Then the system converts the unencrypted volume to an encryptable format divided into portions. The system then encrypts, based on the volume key, the encryptable volume, portion by portion, to enable the user to use the computing device while encrypting. The system can maintain an encryption progress status and display the encryption progress status. The system can monitor disk accesses to the encryptable volume, and, when the disk accesses exceed a first threshold, apply a back-off algorithm to stop encrypting until the disk accesses fall below a second threshold. Thus, the computing device can be used while the encryption occurs in the background.

摘要翻译： 这里公开了用于执行就地加密的系统，方法和非暂时的计算机可读存储介质。 被配置为实施该方法的系统接收来自用户的加密计算设备的未加密卷的请求，并且识别，生成和/或随机选择卷密钥。 然后，系统将未加密的卷转换成可分割的部分的可加密格式。 然后，该系统基于音量密钥逐个地加密可加密卷，以使得用户能够在加密时使用计算设备。 系统可以保持加密进度状态并显示加密进度状态。 系统可以监视对可加密卷的磁盘访问，并且当磁盘访问超过第一阈值时，应用退避算法来停止加密，直到磁盘访问低于第二阈值。 因此，可以在后台进行加密时使用计算装置。

公开(公告)号：US06249782B1

公开(公告)日：2001-06-19

申请号：US09213201

申请日：1998-12-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30067 ,  Y10S707/99932 ,  Y10S707/99943

摘要： A system and method are disclosed for reducing file names and for retrieving files having reduced file names. In response to a request to access file names that are not supportable by an applications programming interface (API), a file manager program retrieves an original file name having an original file name length and an original file identifier. Next, the file manager divides the original file name into a set of primary characters and a set of extension characters. A shortened identifier having a set of shortened identifier characters is created by encoding the original file identifier. The primary characters are then truncated. A reduced file name is then created by combining the truncated characters, a reduced file name marker, the shortened identifier, and the extension characters. Files having reduced names are retrieved by a file manager that identifies a set of shortened identifier characters in a reduced file name, decodes the shortened identifier characters, and retrieves a file based on the decoded identifier characters from a data volume.

摘要翻译： 公开了一种用于减少文件名和用于检索具有减小的文件名的文件的系统和方法。 响应于访问不能由应用程序编程接口（API）支持的文件名的请求，文件管理程序检索具有原始文件名长度和原始文件标识符的原始文件名。 接下来，文件管理器将原始文件名分为一组主要字符和一组扩展名字符。 通过对原始文件标识符进行编码来创建具有缩短的标识符字符集的缩短标识符。 然后，主要字符被截断。 然后通过组合截断的字符，缩小的文件名标记，缩短的标识符和扩展字符来创建缩小的文件名。 具有减少名称的文件由文件管理器检索，该文件管理器识别缩减文件名中的一组缩短的标识符字符，对缩短的标识符字符进行解码，并且根据来自数据卷的解码的标识符字符来检索文件。

公开(公告)号：US07991781B2

公开(公告)日：2011-08-02

申请号：US11648055

申请日：2006-12-28

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

摘要翻译： 本发明接收到存储具有以第一文本编码编写的文件的文件的请求，将文件名转换为Unicode文件名，并将Unicode文件名和文件存储到存储器中。 然后，本发明设置与存储器相关联的标志，指示已经使用第一文本编码。 要检索Unicode文件名，本发明接收到从内存中查找Unicode文件名的请求。 接下来，本发明使用预定的文本编码将文件名转换为Unicode。 然后，本发明在存储器中搜索Unicode文件名。 如果未找到Unicode文件名，本发明使用已经使用的一组文本编码中的下一个文本编码，重复转换并搜索内存，直到识别出Unicode文件名。 最后，检索Unicode文件。

公开(公告)号：US07013314B2

公开(公告)日：2006-03-14

申请号：US10177715

申请日：2002-06-20

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99933 ,  Y10S707/99954

摘要： The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

公开(公告)号：US06282536B1

公开(公告)日：2001-08-28

申请号：US09216602

申请日：1998-12-17

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F900

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

公开(公告)号：US07769785B2

公开(公告)日：2010-08-03

申请号：US11172077

申请日：2005-06-29

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F17/30

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system deternines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

摘要翻译： 一种用于基于索引和基于迭代器的文件管理例程的系统和方法。 通常，所公开的系统维护具有多个迭代器的迭代器高速缓存。 每个活动迭代器与最近使用的目录条目相关联。 在接收到基于索引的请求时，识别最接近基于索引的请求的迭代器。 如果基于索引的请求比最接近的活动迭代器更接近目录的顶部，则从目录的顶部开始，首先从第一个条目开始检查目录条目。 否则，系统确定基于索引的请求是否位于最接近的迭代器之上或之下。 如果基于索引的请求高于最接近的迭代器，则系统将从与最近的迭代器相关联的目录条目向后开始，直到找到与基于索引的请求相关联的目录条目。 如果最接近的迭代器位于最接近的迭代器之下，则系统将从与最近迭代器相关联的目录条目开始的目录条目向前移动，直到找到所请求的目录条目。

公开(公告)号：US06591268B2

公开(公告)日：2003-07-08

申请号：US10082426

申请日：2002-02-22

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

公开(公告)号：US06405196B2

公开(公告)日：2002-06-11

申请号：US09866116

申请日：2001-05-25

申请人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

发明人： Mark S. Day ,  Donald J. Brady ,  Deric S. Horn

IPC分类号： G06F1730

CPC分类号： G06F17/30091 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99943

摘要： A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located. If the closest iterator is located below the closest iterator, the system steps forward through the directory entries beginning with the directory entry associated with the closest iterator until the requested directory entry is located.

摘要翻译： 一种用于基于索引和基于迭代器的文件管理例程的系统和方法。 通常，所公开的系统维护具有多个迭代器的迭代器高速缓存。 每个活动迭代器与最近使用的目录条目相关联。 在接收到基于索引的请求时，识别最接近基于索引的请求的迭代器。 如果基于索引的请求比最接近的活动迭代器更接近目录的顶部，则从目录的顶部开始，首先从第一个条目开始检查目录条目。 否则，系统确定基于索引的请求是否位于最接近的迭代器之上或之下。 如果基于索引的请求高于最接近的迭代器，则系统将从与最近的迭代器相关联的目录条目向后开始，直到找到与基于索引的请求相关联的目录条目。 如果最接近的迭代器位于最接近的迭代器之下，则系统将从与最近迭代器相关联的目录条目开始的目录条目向前移动，直到找到所请求的目录条目。

公开(公告)号：US09195666B2

公开(公告)日：2015-11-24

申请号：US13351987

申请日：2012-01-17

申请人： Deric S. Horn ,  Jeffrey D. Chung ,  Wenguang Wang

发明人： Deric S. Horn ,  Jeffrey D. Chung ,  Wenguang Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30073 ,  G06F17/30174 ,  G06F17/30194

摘要： Managing data units by converting the data units into data segments and access files describing how to retrieve the data segments using hash values for the data segments. In a data store operation, the data unit is divided into data segments and an access file is generated. The access file includes segmenting scheme information for the data segments, hashing scheme information for the hash values, hash identification information describing the hash values, and location information identifying the locations at which the data segments are available. In a data retrieval operation, data from the data unit is retrieved by accessing the data segments and extracting the data therefrom, where the data segments are retrieved based on the access file for the data unit.

摘要翻译： 通过将数据单元转换为数据段并访问描述如何使用数据段的哈希值检索数据段的文件来管理数据单元。 在数据存储操作中，将数据单元划分成数据段，生成访问文件。 访问文件包括用于数据段的分段方案信息，散列值的散列方案信息，描述哈希值的散列识别信息，以及标识数据段可用位置的位置信息。 在数据检索操作中，通过访问数据段并从其中提取数据来检索来自数据单元的数据，其中基于数据单元的访问文件检索数据段。