CN104484126B - A kind of data safety delet method and system based on correcting and eleting codes - Google Patents
A kind of data safety delet method and system based on correcting and eleting codes Download PDFInfo
- Publication number
- CN104484126B CN104484126B CN201410640456.4A CN201410640456A CN104484126B CN 104484126 B CN104484126 B CN 104484126B CN 201410640456 A CN201410640456 A CN 201410640456A CN 104484126 B CN104484126 B CN 104484126B
- Authority
- CN
- China
- Prior art keywords
- block
- data
- random number
- correcting
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
The invention discloses a kind of data safety delet method based on correcting and eleting codes, including：Source data is divided into the k data block of formed objects, D is designated0、D1、…、Dk‑1, a random number or pseudo random number nonce are selected, it is encrypted using key Key, to obtain one with data block D0The block of formed objects, using the block for obtaining to D0、D1、…、Dk‑1Step-by-step XOR is carried out, to obtain new data block C0、C1、…、Ck‑1, random number or pseudo random number nonce are divided into k parts, and be attached to data block C0、C1、…、Ck‑1End, to obtain data block C0’、C1’、…、Ck‑1', using system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck‑1' coding calculating is carried out, to obtain r check block P0、P1、…、Pr‑1.The present invention can solve the problem that in existing method and writes the damage that the height for causing is write expense and caused to disk due to repeating covering, and use the data trnascription mode increase during availability of data the technical problem that expense is write in covering to strengthen.
Description
Technical field
The invention belongs to field of data storage, more particularly, to a kind of data safety delet method based on correcting and eleting codes
And system.
Background technology
Due to the limited storage space of disk, in order to store new data, it is necessary to useless data are deleted.But, user
It is in fact inreal when deleting data that data are deleted from disk, simply the index of file is deleted, it is such to delete
The data removed easily are resumed.If deleted data are confidential datas, then this delet method cannot just ensure data
Security, therefore it is necessary for carry out data safety deleting.Data safety deletes what is generally realized using principle is covered ---
Go to cover the data of original storage on disk using pre-defined form (such as meaningless, irregular information).Due to hard disk
On data be all to be stored with binary " 1 " and " 0 " form, the data that also cannot just know script after being covered are
" 1 " or " 0 ".In view of the magnetization reversal operation principle of magnetic recording media, it is once that cannot ensure that data are only successfully to cover
It is expendable, to reach security higher, it is necessary to which the data that will be all deleted successfully are covered repeatedly, the covering for repeating
Write can not only cause it is very big write expense, and certain damage will be caused to disk.Further, since data contain important warp
Ji value, in addition to data confidentiality, in addition it is also necessary to ensure its availability, generally strengthens availability using data trnascription mode,
However, in the case of three copies, three times before being changed into due to storage overhead, covering needed for above-mentioned data safety deletes scheme is write
Expense also can accordingly turn over three times.
The content of the invention
For the disadvantages described above or Improvement requirement of prior art, the invention provides a kind of data safety based on correcting and eleting codes
Delet method, it is intended that writing the height for causing due to repetition covering present in solution existing method writes expense and to disk
The certain damage for causing, and use data trnascription mode to cover the skill for writing expense to strengthen further to increase during availability of data
Art problem.
To achieve the above object, according to one aspect of the present invention, there is provided a kind of data safety based on correcting and eleting codes is deleted
Except method, comprise the following steps：
(1) source data is divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein k is more than 1
Positive integer；
(2) select a random number or pseudo random number nonce, it is encrypted using key Key, with obtain one with
Data block D0The block of formed objects；
(3) block that step (2) is obtained is utilized to D0、D1、…、Dk-1Step-by-step XOR is carried out, to obtain new data block C0、
C1、…、Ck-1；
(4) random number or pseudo random number nonce are divided into k parts, and are attached to data block C0、C1、…、Ck-1
End, to obtain data block C0’、C1’、…、Ck-1’；
(5) use system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out, to obtain r
Check block P0、P1、…、Pr-1, wherein r is the positive integer more than 0, and system correcting and eleting codes algorithm is encoded using Reed-Solomon；
(6) k for obtaining step (4) is according to block C0’、C1’、…、Ck-1' and r check block P0、P1、…、Pr-1Respectively
Storage is on k+r memory node of disk；
(7) when data are deleted, any r+1 node is selected from k+r memory node, deletes k+r block { C0’、
C1’、…、Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.
It is another aspect of this invention to provide that there is provided a kind of data safety deletion system based on correcting and eleting codes, including：
First module, for source data to be divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein
K is the positive integer more than 1；
Second module, for selecting a random number or pseudo random number nonce, is encrypted using key Key to it, with
One is obtained with data block D0The block of formed objects；
3rd module, for the block that is obtained using the second module to D0、D1、…、Dk-1Step-by-step XOR is carried out, it is new to obtain
Data block C0、C1、…、Ck-1；
4th module, for random number or pseudo random number nonce to be divided into k parts, and is attached to data block
C0、C1、…、Ck-1End, to obtain data block C0’、C1’、…、Ck-1’；
5th module, for using system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out,
To obtain r check block P0、P1、…、Pr-1, wherein r is the positive integer more than 0；
6th module, for the k that obtains the 4th module according to block C0’、C1’、…、Ck-1' and r check block P0、
P1、…、Pr-1It is respectively stored on k+r memory node of disk；
7th module, for when data are deleted, any r+1 node being selected from k+r memory node, deletes k+r
Individual block { C0’、C1’、…、Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.
In general, by the contemplated above technical scheme of the present invention compared with prior art, can obtain down and show
Beneficial effect：
1st, the present invention solves the problems, such as that expense is write in covering high present in existing method, as a result of system correcting and eleting codes
Data block is encoded to ensure the availability of data, such as step (5), compared with data trnascription mode, effectively reduced number
According to storage overhead, so as to reduce delete data when covering write expense, on the other hand, using the characteristic of correcting and eleting codes, data
Safety deleting no longer need to cover whole data, only need complete deletion partial data block, such as step (7), effectively
The data volume of covering is reduced, covering is further reduced and is write expense, while also reducing what frequent write magnetic disk was caused to disk
Damage；
2nd, it is to ensure the storage overhead high that availability of data causes during the present invention solves the problems, such as existing method, step
(5) data block is encoded using system correcting and eleting codes in, when memory node breaks down, according to the characteristic of correcting and eleting codes, only
The encoding block that also there is q.s in disk is wanted, just can recover initial data, compared with the mode of data trnascription, effectively reduced
Storage overhead, while ensure that the high availability of data；
3rd, the present invention has ensured the high security of data, and computing and spelling are carried out to initial data in step (3) and step (4)
Connect, and data block is encoded using system correcting and eleting codes in step (5), code segment block is deleted, it is ensured that data are
Cannot be resumed, moreover it is possible to prevent data from being stolen secret information.Again as a result of step (2), even if situation about being stolen in key key
Under, also can guarantee that the security of data；
4th, in the present invention, data are carried out with expense required during read/write relatively low, during read-write normal to original data block,
Only need to carry out basic XOR, even if the original data block for needing read-write is failure state, except basic XOR
Outside computing, it is only necessary to the encoding block not failed is decoded using system correcting and eleting codes.
Brief description of the drawings
Fig. 1 is the cataloged procedure of systematic code.
Fig. 2 is the flow chart of data safety delet method of the present invention based on correcting and eleting codes.
Fig. 3 is the schematic diagram of data safety delet method of the present invention based on correcting and eleting codes.
Fig. 4 is the distribution schematic diagram of block of information in memory node.
Specific embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.As long as additionally, technical characteristic involved in invention described below each implementation method
Not constituting conflict each other can just be mutually combined.
Hereinafter technical term of the invention is explained and illustrated first：
Encryption, decryption：Direct word or the information that can directly understand are processed by certain algorithm, is become not
The information that can directly understand, so as to protect our information, this process is just named encryption, and the inverse process of the process is decryption；
Key：A kind of parameter, is the data being input into encryption or decrypting process.
Step-by-step XOR：XOR is a mathematical operator, and mathematic sign is " ⊕ ", and computer symbols is " XOR ", its computing
Rule represents true under binary system equivalent to the binary addition without carry with 1, and 0 represents false, and the algorithm of XOR is：0⊕
0=0,1 ⊕ 0=1,0 ⊕ 1=1,1 ⊕ 1=0 (is all 0,1) different be.Step-by-step XOR is then that two binary numbers corresponding two enter
Position XOR, give an actual example explanation：If x is binary number 0101, y is binary number 1011, then x ⊕ y=1110.
System correcting and eleting codes algorithm：Initial data is divided into k according to block and is encoded, obtain n (n>K) individual data block
Data, if possessing any k according to block, initial data can be recovered with appropriate interpretation method, and this code is called (n, k)
Correcting and eleting codes.When preceding k is identical with original data block according to block in n data block, correcting and eleting codes can be described as system correcting and eleting codes, referred to as
It is systematic code.Fig. 1 is the cataloged procedure that systematic code is carried out with matrix, wherein distribution matrix Gn×kPreceding k rows can form unit square
Battle array, C0’、C1’、…、Ck-1' divide equally the k for obtaining according to block for source data, k there is the k column vector of element according to block composition
C, the preceding k element for obtaining n the column vector P, P of element using GC=P can constitute C, and the individual element of rear r (k+r=n) is corresponded to
R check block P0、P1、…、Pr-1。
Fig. 2 is the flow chart of the data safety delet method based on correcting and eleting codes, as shown in Fig. 2 comprising the following steps：
(1) source data is divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein k is more than 1
Positive integer.For example, as shown in figure 3, D0、D1、D2、D3For initial data is divided equally obtain 4 formed objects data blocks；
(2) select a random number or pseudo random number nonce, it is encrypted using key Key, with obtain one with
Data block D0The block of formed objects.For example, as shown in figure 3, be encrypted to nonce using key Key, obtaining one and data
Block D0The block of formed objects；
(3) block that step (2) is obtained is utilized to D0、D1、…、Dk-1Step-by-step XOR is carried out, to obtain new data block C0、
C1、…、Ck-1.For example, as shown in figure 3, the block that obtains of step (2) is to D0、D1、D2、D3Step-by-step XOR is carried out, C is obtained0、C1、C2、
C3；
(4) random number or pseudo random number nonce are divided into k parts, and are attached to data block C0、C1、…、Ck-1
End, to obtain data block C0’、C1’、…、Ck-1’.For example, as shown in figure 3, be 4 parts by nonce point, be designated herein a, b,
C, d, C is respectively added to by a, b, c, d0、C1、C2、C3End, obtain C0’、C1’、C2’、C3’；
(5) use system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out, to obtain r
Check block P0、P1、…、Pr-1, wherein r is the positive integer more than 0.For example, as shown in figure 3, to C0’、C1’、C2’、C3' be
System code is calculated, and obtains check block, in figure 3, only generates 2 check block P0、P1.In addition, specifically, system is entangled in the present invention
Deleting yard algorithm can be encoded using Reed-Solomon；
(6) k for obtaining step (4) is according to block C0’、C1’、…、Ck-1' and r check block P0、P1、…、Pr-1Respectively
Storage is on k+r memory node of disk.As shown in figure 4, wherein C0’、C1’、…、Ck-1' for k according to block, P0、P1、…、
Pr-1It is r inspection block, this k+r encoding block storage is on k+r memory node of disk；
(7) when data are deleted, any r+1 node is selected from k+r memory node, deletes k+r block { C0’、
C1’、…、Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.For example, as shown in figure 3, deleting 6
Encoding block { C0’、C1’、C2’、C3’、P0、P1In 3 blocks, this 3 blocks be D3、P0、P1。
When data deletion action is completed, survival block number is k-1.According to the encoding characteristics of correcting and eleting codes, k-1 block is not enough
To recover the k before coding according to block C0’、C1’、…、Ck-1', it means that correct nonce cannot be obtained, then even if
Key Key is stolen, and cannot also decrypt and obtain original data block D0、D1、…、Dk-1, thus reached the mesh of data safety deletion
's.For example, as shown in figure 3, deleting block D3、P0、P1Afterwards, the number of survival block is 3, according to the characteristic of correcting and eleting codes, 3 encoding blocks
Data block C cannot be recovered0’、C1’、C2’、C3', then also cannot just decrypt and obtain initial data D0、D1、D2、D3, additionally, by
In correct nonce cannot be obtained, even if Key is stolen, D cannot be also decrypted0、D1、D2、D3。
The invention also discloses a kind of data safety deletion system based on correcting and eleting codes, including：
First module, for source data to be divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein
K is the positive integer more than 1；
Second module, for selecting a random number or pseudo random number nonce, is encrypted using key Key to it, with
One is obtained with data block D0The block of formed objects；
3rd module, for the block that is obtained using the second module to D0、D1、…、Dk-1Step-by-step XOR is carried out, it is new to obtain
Data block C0、C1、…、Ck-1；
4th module, for random number or pseudo random number nonce to be divided into k parts, and is attached to data block
C0、C1、…、Ck-1End, to obtain data block C0’、C1’、…、Ck-1’；
5th module, for using system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out,
To obtain r check block P0、P1、…、Pr-1, wherein r is the positive integer more than 0；
6th module, for the k that obtains the 4th module according to block C0’、C1’、…、Ck-1' and r check block P0、
P1、…、Pr-1It is respectively stored on k+r memory node of disk；
7th module, for when data are deleted, any r+1 node being selected from k+r memory node, deletes k+r
Individual block { C0’、C1’、…、Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.
Sum it up, the present invention has advantages below：
1st, the present invention solves the problems, such as that expense is write in covering high present in existing method, as a result of system correcting and eleting codes
Data block is encoded to ensure the availability of data, such as step (5), compared with data trnascription mode, effectively reduced number
According to storage overhead, so as to reduce delete data when covering write expense, on the other hand, using the characteristic of correcting and eleting codes, data
Safety deleting no longer need to cover whole data, only need complete deletion partial data block, such as step (7), effectively
The data volume of covering is reduced, covering is further reduced and is write expense, while also reducing what frequent write magnetic disk was caused to disk
Damage；
2nd, it is to ensure the storage overhead high that availability of data causes during the present invention solves the problems, such as existing method, step
(5) data block is encoded using system correcting and eleting codes in, when memory node breaks down, according to the characteristic of correcting and eleting codes, only
The encoding block that also there is q.s in disk is wanted, just can recover initial data, compared with the mode of data trnascription, effectively reduced
Storage overhead, while ensure that the high availability of data；
3rd, the present invention has ensured the high security of data, and computing and spelling are carried out to initial data in step (3) and step (4)
Connect, and data block is encoded using system correcting and eleting codes in step (5), code segment block is deleted, it is ensured that data are
Cannot be resumed, moreover it is possible to prevent data from being stolen secret information.Again as a result of step (2), even if situation about being stolen in key key
Under, also can guarantee that the security of data；
4th, in the present invention, data are carried out with expense required during read/write relatively low, during read-write normal to original data block,
Only need to carry out basic XOR, even if the original data block for needing read-write is failure state, except basic XOR
Outside computing, it is only necessary to the encoding block not failed is decoded using system correcting and eleting codes.
As it will be easily appreciated by one skilled in the art that the foregoing is only presently preferred embodiments of the present invention, it is not used to
The limitation present invention, all any modification, equivalent and improvement made within the spirit and principles in the present invention etc., all should include
Within protection scope of the present invention.
Claims (2)
1. a kind of data safety delet method based on correcting and eleting codes, it is characterised in that comprise the following steps：
(1) source data is divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein k is just whole more than 1
Number；
(2) random number or pseudo random number nonce are selected, it is encrypted using key Key, to obtain one and data
Block D0The block of formed objects；
(3) block that step (2) is obtained is utilized to D0、D1、…、Dk-1Step-by-step XOR is carried out, to obtain new data block C0、C1、…、
Ck-1；
(4) random number or pseudo random number nonce are divided into k parts, and are attached to data block C0、C1、…、Ck-1End
Tail, to obtain data block C0’、C1’、…、Ck-1’；
(5) use system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out, to obtain r verification
Block P0、P1、…、Pr-1, wherein, r is the positive integer more than 0, and wherein system correcting and eleting codes algorithm is encoded using Reed-Solomon；
(6) k for obtaining step (4) is according to block C0’、C1’、…、Ck-1' and r check block P0、P1、…、Pr-1It is respectively stored in
On k+r memory node of disk；
(7) when data are deleted, any r+1 node is selected from k+r memory node, deletes k+r block { C0’、C1’、…、
Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.
2. a kind of data safety deletion system based on correcting and eleting codes, it is characterised in that including：
First module, for source data to be divided into the k data block of formed objects, is designated D0、D1、…、Dk-1, wherein k is
Positive integer more than 1；
Second module, for selecting a random number or pseudo random number nonce, is encrypted, to obtain using key Key to it
One and data block D0The block of formed objects；
3rd module, for the block that is obtained using the second module to D0、D1、…、Dk-1Step-by-step XOR is carried out, to obtain new data
Block C0、C1、…、Ck-1；
4th module, for random number or pseudo random number nonce to be divided into k parts, and is attached to data block C0、
C1、…、Ck-1End, to obtain data block C0’、C1’、…、Ck-1’；
5th module, for using system correcting and eleting codes algorithm to k according to block C0’、C1’、…、Ck-1' coding calculating is carried out, with
To r check block P0、P1、…、Pr-1, wherein r is the positive integer more than 0；
6th module, for the k that obtains the 4th module according to block C0’、C1’、…、Ck-1' and r check block P0、P1、…、
Pr-1It is respectively stored on k+r memory node of disk；
7th module, for when data are deleted, any r+1 node being selected from k+r memory node, deletes k+r block
{C0’、C1’、…、Ck-1’、P0、P1、…、Pr-1In any r+1 block corresponding with r+1 node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410640456.4A CN104484126B (en) | 2014-11-13 | 2014-11-13 | A kind of data safety delet method and system based on correcting and eleting codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410640456.4A CN104484126B (en) | 2014-11-13 | 2014-11-13 | A kind of data safety delet method and system based on correcting and eleting codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104484126A CN104484126A (en) | 2015-04-01 |
| CN104484126B true CN104484126B (en) | 2017-06-13 |
Family
ID=52758674
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410640456.4A Active CN104484126B (en) | 2014-11-13 | 2014-11-13 | A kind of data safety delet method and system based on correcting and eleting codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104484126B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105335252A (en) * | 2015-10-22 | 2016-02-17 | 浪潮电子信息产业股份有限公司 | Data protection method, device and system |
| CN105893169A (en) * | 2016-03-31 | 2016-08-24 | 乐视控股（北京）有限公司 | File storage method and system based on erasure codes |
| CN106406760B (en) * | 2016-09-14 | 2019-05-28 | 郑州云海信息技术有限公司 | Direct correcting and eleting codes optimization method and system based on cloud storage |
| WO2018112980A1 (en) * | 2016-12-24 | 2018-06-28 | 华为技术有限公司 | Storage controller, data processing chip, and data processing method |
| CN110704232B (en) * | 2019-10-10 | 2023-03-14 | 广东工业大学 | Method, device and equipment for repairing failed node in distributed system |
| CN113360315A (en) * | 2020-03-06 | 2021-09-07 | 科大国盾量子技术股份有限公司 | Data center |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192924A (en) * | 2006-11-24 | 2008-06-04 | 北京大学 | P2P storage system coding method based on Reed-Solomon code |
| CN103177111A (en) * | 2013-03-29 | 2013-06-26 | 西安理工大学 | System and method for deleting repeating data |
| CN103595793A (en) * | 2013-11-13 | 2014-02-19 | 华中科技大学 | Cloud data safe deleting system and method without support of trusted third party |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102833298A (en) * | 2011-06-17 | 2012-12-19 | 英业达集团(天津)电子技术有限公司 | Distributed repeated data deleting system and processing method thereof |
-
2014
- 2014-11-13 CN CN201410640456.4A patent/CN104484126B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192924A (en) * | 2006-11-24 | 2008-06-04 | 北京大学 | P2P storage system coding method based on Reed-Solomon code |
| CN103177111A (en) * | 2013-03-29 | 2013-06-26 | 西安理工大学 | System and method for deleting repeating data |
| CN103595793A (en) * | 2013-11-13 | 2014-02-19 | 华中科技大学 | Cloud data safe deleting system and method without support of trusted third party |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104484126A (en) | 2015-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104484126B (en) | A kind of data safety delet method and system based on correcting and eleting codes | |
| US10540514B1 (en) | Distributed network for storing a redundant array of independent blockchain blocks | |
| JP4334582B2 (en) | Secret sharing apparatus, method and program | |
| US8077863B2 (en) | Secret sharing apparatus, method, and program | |
| US20170250801A1 (en) | Utilizing error correction (ecc) for secure secret sharing | |
| US9646178B2 (en) | Secure data storage based on physically unclonable functions | |
| US20120255030A1 (en) | Secret sharing apparatus, sharing apparatus and secret sharing method | |
| JP6219391B2 (en) | Safe deletion of data stored in memory | |
| JP2013005293A (en) | Authentication component, authentication target component, and authentication method for the same | |
| US9323943B2 (en) | Decrypt and encrypt data of storage device | |
| CN109657497B (en) | Secure file system and method thereof | |
| CN109145639B (en) | File encryption method, file decryption method and file encryption device | |
| US9235532B2 (en) | Secure storage of full disk encryption keys | |
| CN106100829B (en) | Method and device for encrypted storage | |
| KR101687492B1 (en) | Storing method of data dispersively and credential processing unit | |
| US20180269903A1 (en) | Distributed erasure coding pool deployed in hyperscale infrastructure | |
| CN110058820B (en) | Data safe writing, deleting and reading method and device based on solid-state disk array | |
| KR102096359B1 (en) | Data transmission apparatus capable of secret key encryption based on involutory matrix and operating method thereof | |
| US20220286282A1 (en) | Updateable encryption in self encrypting drives | |
| CN110287716B (en) | Data storage method and device | |
| JP5826202B2 (en) | Encoding device, decoding device, encoding method, decoding method, and program | |
| KR101236835B1 (en) | Encoding and decoding method using encoding codes | |
| CN109902492B (en) | Method for writing encryption information set in integrated circuit external memory and integrated circuit | |
| JP6282197B2 (en) | Storage device, method and program | |
| CN110071927A (en) | A kind of information ciphering method, system and associated component |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |