# US 2025/0384151 A1 · Method to prevent data theft from a storage device

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0384151 A1
- Document ID: US20250384151A1
- Status: Published application
- Kind: A1
- Application number: 18/743,113
- Filed: 2024-06-14
- Published: 2025-12-18
- Earliest claimed: 2024-06-14
- Assignees: SanDisk Technologies LLC
- Applicants: SanDisk Technologies LLC
- Inventors: Shiva K; Saurabh Singh
- Web page: https://patentgrep.com/patent/US20250384151A1

## CPC

- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for assessing a data access request to a data storage device (DSD) by a computer program, the method comprising: assigning a plurality of queues to a plurality of computer programs, wherein each computer program is configured to authentically access one partition of a plurality of partitions of a non-volatile storage medium of the DSD using one queue of the plurality of queues assigned to that computer program and corresponding to that one partition; receiving, from the computer program, a data access request to access a first partition of the plurality of partitions using a first queue of the plurality of queues; and assessing the data access request by: determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue; and in response to determining the one queue of the plurality of queues corresponding to the first partition is the first queue, determining the first queue is authentic to assess the first partition.

## Claims

### Claim 1

A method for assessing a data access request to a data storage device (DSD) by a computer program, the method comprising:
assigning a plurality of queues to a plurality of computer programs, wherein each computer program is configured to authentically access one partition of a plurality of partitions of a non-volatile storage medium of the DSD using one queue of the plurality of queues assigned to that computer program and corresponding to that one partition;
receiving, from the computer program, a data access request to access a first partition of the plurality of partitions using a first queue of the plurality of queues; and
assessing the data access request by:
determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue; and
in response to determining the one queue of the plurality of queues corresponding to the first partition is the first queue, determining the first queue is authentic to assess the first partition.

### Claim 2 (depends on 1)

The method of claim 1, wherein assessing the data access request further comprises:
determining whether the one of the plurality of partitions the computer program is configured to access is the first partition; and
in response to determining the one of the plurality of partitions the computer program is configured to access is the first partition, determining the computer program is authentic to access the first partition.

### Claim 3 (depends on 2)

The method of claim 2, further comprising allowing the data access request for accessing the first partition in response to determining both the first queue and the computer program are authentic to assess the first partition.

### Claim 4 (depends on 1)

The method of claim 1, wherein assigning the plurality of queues to the plurality of computer programs comprises generating a data indexing structure having information for each computer program, including (i) the one of the plurality of partitions that each computer program is configured to access, and (ii) the one queue of the plurality of queues assigned to that computer program.

### Claim 5 (depends on 4)

The method of claim 4, wherein the data indexing structure having information for each computer program further includes (iii) the one queue of the plurality of queues corresponding to the one of the plurality of partitions.

### Claim 6 (depends on 4)

The method of claim 4, wherein determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue and/or determining whether the one of the plurality of partitions the computer program is configured to access is the first partition comprises retrieving information from the data indexing structure.

### Claim 7 (depends on 1)

The method of claim 1, wherein each queue of the plurality of queues comprises a queue identifier used by a driver of a host computer system to assign one of the plurality of queues to one of the plurality of computer programs.

### Claim 8 (depends on 7)

The method of claim 7, wherein determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue includes:
determining whether a first queue identifier of the first queue matches a second queue identifier of the one queue of the plurality of queues corresponding to the first partition; and
in response to determining the first queue identifier matches the second queue identifier, determining the one queue of the plurality of queues corresponding to the first partition is the first queue.

### Claim 9 (depends on 2)

The method of claim 2, further comprising:
in response to determining the one queue of the plurality of queues corresponding to the first partition is not the first queue and/or the one of the plurality of partitions the computer program is configured to access is not the first partition, determining the data access request is not authentic; and
in response to determining the data access request is not authentic, rejecting the data access request.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
in response to determining the data access request is not authentic, attempting to authenticate the data access request in a different way.

### Claim 11 (depends on 10)

The method of claim 10, wherein the attempting to authenticate the data access request a different way includes providing a one-time authentication for the data access request.

### Claim 12 (depends on 10)

The method of claim 10, wherein the attempting to authenticate the data access request a different way includes providing a long-term authentication to authenticate the computer program to access the first partition using the first queue.

### Claim 13 (depends on 11)

The method of claim 11, attempting to authenticate the data access request in a different way includes receiving from a user of the host computer system a first credential for the one-time authentication and/or a second credential for the long-term authentication.

### Claim 14 (depends on 13)

The method of claim 13, wherein in response to receiving the first credential, allowing the data access request by allowing access to the first partition by the computer program on a one-off basis.

### Claim 15 (depends on 13)

The method of claim 13, wherein in response to receiving the second credential,
updating the data indexing structure to include:
the first partition as an additional partition configured for access by the computer program;
the first queue as an additional queue of the plurality of queues assigned to the computer program; and/or
the first queue as an additional queue of the plurality of queues corresponding to the first partition; and/or
allowing the data access request by allowing access to the first partition.

### Claim 16 (depends on 1)

The method of claim 1, wherein assigning the plurality of queues to the plurality of computer programs is based on data characteristics of the computer programs.

### Claim 17 (depends on 16)

The method of claim 16, wherein the data characteristics include a confidentiality of the data used by the computer program, wherein the confidentiality of the data is grouped into a plurality of levels, and wherein one or more computer programs of the plurality of computer programs having a same level are configured to access a same partition of the non-volatile storage medium.

### Claim 18 (depends on 1)

The method of claim 1, wherein the DSD is a non-volatile memory express (NVMe) device including a plurality of I/O queues, and wherein the plurality of queues are a subset of the plurality of I/O queues.

### Claim 19

A data storage device (DSD) comprising:
a non-volatile storage medium configured to store data;
a data path configured to transmit at least data between the non-volatile storage medium of the DSD and a host computer system; and
one or more processors, individually or in combination, configured to:
assign a plurality of queues to a plurality of computer programs, wherein each computer program is configured to authentically access one partition of a plurality of partitions of the non-volatile storage medium using one queue of the plurality of queues assigned to that computer program and corresponding to that one partition;
receive, from a computer program, a data access request to access a first partition of the plurality of partitions using a first queue of the plurality of queues; and
assess the data access request by:
determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue; and
in response to determining the one queue of the plurality of queues corresponding to the first partition is the first queue, determining the first queue is authentic to assess the first partition.

### Claim 20

A data storage device (DSD) comprising:
means for storing data;
means for transmitting at least data between a host computer system and the data storage device;
means for assigning a plurality of queues to a plurality of computer programs, wherein each computer program is configured to authentically access one partition of a plurality of partitions of a non-volatile storage medium of the DSD using one queue of the plurality of queues assigned to that computer program and corresponding to that one partition;
means for receiving, from a computer program, a data access request to access a first partition of the plurality of partitions using a first queue of the plurality of queues; and
means for assessing the data access request by:
means for determining whether the one queue of the plurality of queues corresponding to the first partition is the first queue; and
means for determining, in response to determining the one queue of the plurality of queues corresponding to the first partition is the first queue, the first queue is authentic to assess the first partition.
