CN101785239A - Key based hidden partition system - Google Patents

Key based hidden partition system Download PDF

Info

Publication number
CN101785239A
CN101785239A CN200780053762A CN200780053762A CN101785239A CN 101785239 A CN101785239 A CN 101785239A CN 200780053762 A CN200780053762 A CN 200780053762A CN 200780053762 A CN200780053762 A CN 200780053762A CN 101785239 A CN101785239 A CN 101785239A
Authority
CN
China
Prior art keywords
content
hidden partition
key
response
hidden
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.)
Granted
Application number
CN200780053762A
Other languages
Chinese (zh)
Other versions
CN101785239B (en
Inventor
L·张
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intel Corp
Original Assignee
Intel Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Intel Corp filed Critical Intel Corp
Publication of CN101785239A publication Critical patent/CN101785239A/en
Application granted granted Critical
Publication of CN101785239B publication Critical patent/CN101785239B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/78Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
    • G06F21/80Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data in storage media based on magnetic or optical technology, e.g. disks with sectors
    • G06F21/805Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data in storage media based on magnetic or optical technology, e.g. disks with sectors using a security table for the storage sub-system

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Storage Device Security (AREA)

Abstract

A key based hidden partition solution may provide a second hidden partition in a first storage device to store a second content that is synchronized with a first content of a first hidden partition of the first storage device. The solution may further provide a key that matches the first content and update the second content of the second hidden partition and the key based on the modified first content in response to an authorized modification to the first content of the first hidden partition.

Description

Hidden partition system based on key
Background technology
In order to adapt to protection vital document or data and to prevent the needs that confidential information is leaked, can use some schemes based on hidden partition.These schemes can be stored crucial data for the user distributes single hidden partition on the hard disk of computing equipment.Hidden partition can be sightless to one or more softwares (for example, operating system), though therefore the operating system of computing equipment damage or hard disk formatted, the data in the hidden partition also can remain.Yet, if some mistakes occur in the hidden partition, for example, because corrupted data or lose, or by malware attacks, the user may not find basic reason or deal with problems so.
Description of drawings
Non-limiting mode illustrates invention described herein by example in the accompanying drawings.Simple and clear for what illustrate, Shuo Ming element needn't proportionally be drawn in the drawings.For example, for the sake of clarity, can usually amplify the size of some elements with respect to other yuan.In addition, in appropriate circumstances, the Reference numeral that repeats in the drawings is used to indicate corresponding or similar element.
Fig. 1 is the schematic diagram of the embodiment of computing equipment.
Fig. 2 is the schematic diagram of the embodiment of hard disk.
Fig. 3 is the schematic diagram of method of hidden partition that can be used for the hard disk of control chart 2.
Embodiment
Following declarative description be used to be provided for the technology that uses a model of assets control.The realization of these technology is not restricted in the computer system; Can use it by any execution environment (for example, other numeral/electronic equipment) for similar purpose.In the following description, a plurality of details have been set forth, for example logic realization, command code, the unit that is used to specify operand, resource partitioning/share/duplicate type and the correlation and the logical partition/integrated selection of realization, system unit, so that the more thorough understanding to the present invention to be provided.But, can not have to realize the present invention under the situation of these concrete details.In other example,, control structure and whole software instruction sequences are not shown at length for fuzzy the present invention.
" embodiment " who mentions in the specification, " embodiment ", " example embodiment " etc. have indicated the embodiment that describes can comprise special characteristic, structure or characteristics, but each embodiment must comprise these special characteristics, structure or characteristics.In addition, these phrases are not to refer to identical embodiment.In addition, when having described specific feature, structure or characteristics in conjunction with the embodiments, can think and in those skilled in the art's ken, can realize these features, structure or characteristics, no matter whether describe clearly in conjunction with other embodiment.
Can realize embodiments of the invention with hardware, firmware, software or its any combination.Embodiments of the invention can also be embodied as the instruction of storing on machine readable media, it can be read or be carried out by one or more processors.Machine readable media can comprise and be used for storage or send any mechanism with the information of machine (for example, computing equipment) readable form.For example, machine readable media can comprise read-only memory (ROM); Random-access memory (ram); Magnetic disk storage medium; Optical storage media; Flash memory device; The signal of the propagation of electricity, light, sound or other form (for example, carrier wave, infrared signal, digital signal etc.) etc.
Below describe the word that can comprise such as first, second grade, it only is used for descriptive purpose and is not interpreted as determinate.
Fig. 1 shows the exemplary embodiment of computing equipment 100.Computing equipment 100 can comprise one or more processors 110.Processor 110 can be carried out action in response to the instruction of carrying out.For example, processor 110 can be in computing equipment 100 grades executive program, carry out data manipulation and control task.Processor 110 can be the processor that is suitable for carrying out any kind of the operation in memory 130.For example, processor 110 can be microprocessor, digital signal processor, microcontroller or any other processor.In one embodiment, processor 110 can not be to use memory 130 specially, and processor 110 can be carried out the operation in memory 130, also can carry out other systemic-function.
Memory 130 can comprise the memory devices that addressable memory cell is provided, and wherein, Memory Controller 122 can write data from described memory cell reading of data and/or to it.Memory 130 can comprise the memory devices that one or more are dissimilar, for example, dynamic random access memory (DRAM) equipment, Synchronous Dynamic Random Access Memory (SDRAM) equipment, read-only memory (ROM) equipment or any other volatibility or nonvolatile memory (NVM) equipment.In another embodiment, can arrange memory 130 by passage (channel), arrangement (rank), group (bank), page or leaf (page) and row (column).
Computing equipment 100 can also comprise chipset 120.Chipset 120 can comprise one or more integrated circuit encapsulation or chip, it can be coupled to processor 110 memory 130, basic input/output (BIOS) 140, one or more memory device 150 and other parts (for example, other I/O equipment of mouse, keyboard, Video Controller or computing equipment 100 etc.).Chipset 130 can receive affairs and affairs are distributed to processor 110 from processor 110 via processor bus.Memory Controller 122 can be distributed to memory 140 with affairs via memory bus.Chipset 130 can comprise can be via the BIOS interface 124 of bus 142 visit BIOS 140.
In another embodiment, memory device 150 can store archive information, for example code, program, file, data, application program or operating system etc.The example of memory device 150 can comprise tape, hard disk (HD) driver, floppy disk, compact disk (CD) ROM, flash memory device, any other mass storage facility, any other magnetic-based storage media, any other optical storage media, any other non-volatile memory devices etc.Chipset 120 can comprise can be via one or more storage device interfaces 126 of bus 142 each memory device 150 of visit.
Fig. 2 has illustrated the exemplary embodiment of hard disk 210.In one embodiment, hard disk 210 can be by subregion, to comprise first hidden partition 212 and second hidden partition 214 and one or more normal subregion 216.For example, first hidden partition 212 can be main hidden partition, and it is used to store file most important or secret concerning authorized user, user data or any out of Memory.Second hidden partition 214 can be the inferior hidden partition at running background.In one embodiment, first hidden partition 212 can have identical size with second hidden partition 214; Yet, in certain embodiments, can not need identical size.In one embodiment, first hidden partition 212 and second hidden partition 214 can be sightless or inaccessibles for undelegated software (for example, operating system).The content of first hidden partition 212 can with the content synchronization of second hidden partition 214.For example, in response to revise first hidden partition 212 with authorization, can upgrade the content of second hidden partition 214.
In one embodiment, Fig. 2 has illustrated the logic 240 that can manage first hidden partition 212 and second hidden partition 214.For example, the content of first hidden partition 212 can be stored or revise to logic 240.Change or revise the content of first hidden partition 212 in response to logic 240, logic 240 can be with the content of first hidden partition 212 and the content synchronization of second hidden partition 214, to upgrade the content of second hidden partition 214.For example, logic 240 can be with the content replication of the modification of first hidden partition 212 to second hidden partition 214.In one embodiment, in response to logic 240 (for example, based on instruction from authorized user) revise the content of first hidden partition 212, second hidden partition 214 can be upgraded or revise to logic 240, with storage and the identical content of content of having stored in first hidden partition 212.
In one embodiment, the content of first hidden partition 212 is invalid in response to the content of determining second hidden partition 214 is effectively, and logic 240 can also use the content of second hidden partition 214 to recover or repair the content of first hidden partition 212.In another embodiment, logic 240 can similarly format first hidden partition 212 and second hidden partition 214; Yet, can not need so yet.In another embodiment, in response to the undelegated change of first hidden partition 212, logic 240 can not change the content of second hidden partition 214.For example, if first hidden partition 212 revised undesirably or unexpectedly, for example by virus or by any unauthorized or loss of data or damage that Malware causes, logic 240 can correspondingly not change the content of second hidden partition 214.
Logic 240 can use key 230 to manage this two hidden partitions.In one embodiment, logic 240 can be come computation key 230 based on one content in two hidden partitions 212 and 214.In another embodiment, (for example revise first hidden partition 212 in response to logic 240, increase, deletion or modification information), logic 240 can be revised second hidden partition 214 and comes the value of new key more or generate new key based on the content of the modification of first hidden partition 212 and/or second hidden partition 214 based on the content of the modification of first hidden partition 212.For example, can use one or more key schedules (for example, logical operation) that key 230 is provided.In another embodiment, if because by virus or the loss of data or the damage that are caused by malice or non-authorised software, the content of first hidden partition 212 is unnecessarily changed, logic 240 can not change second hidden partition 214 or key 230 so.In another embodiment, in corrupted data or lose, or under situation by the attack of virus or Malware took place hidden partition, the value of key 230 can not match with first or second hidden partition.
In another embodiment, logic 240 can detect or verify the validity of the content of arbitrary hidden partition based on key 230.For example, whether logic 240 can detect in arbitrary hidden partition wrong.In another embodiment, can use key 230 to check that whether the content of first hidden partition 212 and/or second hidden partition 214 is damaged in undelegated mode or changes.In one embodiment, key 230 can be stored in the nonvolatile memory (NVM) 222, and it can be invisible or inaccessible to undelegated software (for example, operating system).With reference to figure 2, NVM 222 can be in-line memory equipment or can provide in system 220.In one embodiment, safety or embedded chip, embedded system or the trusted module platform (TMP) that can provide on mainboard can be provided the example of system 220.Though Fig. 2 has illustrated the embodiment of NVM 222, can also use other memory device, for example flash memory device, DRAM equipment, SDRAM equipment etc.In addition, though Fig. 2 shows the NVM222 that separates with hard disk 210 that is used for storage key 230, in certain embodiments, key 230 can be stored in the hard disk 210, for example, and in normal subregion 216.
Fig. 3 illustrated can by logic 240 make be used for management (for example, carry out hidden partition the damage inspection, with information stores in hidden partition or carry out the automatic reparation of hidden partition) example of the hidden partition 212 of Fig. 2 and 214 method.With reference to figure 3, in frame 302, in response to for example from authorized user be used for information is moved to the instruction of first hidden partition 212 from normal subregion 216, logic 240 can obtain to put into the information of first hidden partition 212 from normal subregion 216.In frame 304, logic 240 can be fetched key 230 from safety NVM 222.
In frame 306, can scan first hidden partition 212, and can check the content of whether mating first hidden partition 212 with the value of determining key 230 at rhombus 308 places.For example, can use the algorithm identical to determine whether the value of key 230 mates the content of first hidden partition 212 with the algorithm that generates key 230.If determine the current content that the value of key 230 is mated first hidden partition 212, for example, if the modification to the mandate of the content of first hidden partition 212 is arranged, the content that can determine first hidden partition 212 so be effectively and flow process can proceed to frame 310.In frame 310, can be to first hidden partition 212 with the information stores that in frame 302, obtains from normal subregion 216.Then, in frame 312, can first hidden partition 212 and second hidden partition 214 is synchronous, can upgrade second hidden partition 214 thus to be added on the information that obtains in the frame 302.
On the contrary, if change undelegated or that do not expect occurs in first hidden partition 212, for example, because corrupted data or premeditated malice or undelegated software, the value of key 230 can remain unchanged so, therefore can not match with the content of first hidden partition 212.In another embodiment, if key 230 has been damaged, the content of first hidden partition 212 can not match with the value of key 230 so.In response to determining that at rhombus 308 places the value of key 230 and the content of first hidden partition 212 do not match, the flow process of Fig. 3 can proceed to rhombus 314, in this similar inspection that can carry out the value and second hidden partition 214 of key 230.With reference to figure 3, the content of mating second hidden partition 214 in response to the value of in rhombus 314, determining key 230, its can show the content of second hidden partition 214 be effectively and the content of first hidden partition 212 may be invalid, flow process can proceed to frame 316, and wherein the information that obtains at frame 302 can be stored in second hidden partition 214.In addition, in frame 318, logic 240 can synchronous first hidden partition 212 with second hidden partition 214 with content stores that will be identical with the modification content of second hidden partition 214 in first hidden partition 212.Thus, can repair the invalid content of first hidden partition 212 based on the content of effective second hidden partition 214.
In another embodiment, can not show that matching of the rhombus 314 place's keys 230 and second hidden partition 214 key 230 or second hidden partition 214 also are invalid, or be damaged, or changed undesirably.In one embodiment, in frame 320, can give the user with key 230 and all unmatched event report of these two hidden partitions.In another embodiment, in frame 320, the content that the user can notified first hidden partition 212 is different with the content of second hidden partition 214.In another embodiment, can determine difference between two hidden partitions 212 and 214 by logic 240; Yet, in certain embodiments, can determine this difference by any other logic.In another embodiment, can give the user with difference report.In another embodiment, unmatched any out of Memory that can will be referred between key and two hidden partitions reports to the user.For example, the user can be for example to decide in two hidden partitions 212 and 214 which based on the difference between two hidden partitions be better.In another embodiment, the user can recover or repair the content in this better hidden partition.In another embodiment, logic 240 can be determined better hidden partition and recover the content of this better hidden partition.
In addition, in frame 322, can be in this better hidden partition of having been repaired by the user with the information stores that in frame 302, obtains.In frame 324, the better hidden partition of another hidden partition and this can be stored synchronously and the better identical content of hidden partition.With reference to figure 3, in response to these two hidden partitions 212 and 214 synchronously, can be updated in the value (frame 326) of the key 230 of storage among the NVM 222 by logic 240 based on the content of the modification of hidden partition 212 or 214.
Though the flow process of Fig. 3 is depicted as the sequence of operation, in certain embodiments, can carries out operation in the shown flow process with different orders.For example, can before being checked, carry out first hidden partition 212 inspection to second hidden partition.In addition, start inspection though information is moved to hidden partition 212 and 214 from normal subregion 216 to the content of first hidden partition 212 of Fig. 3 or second hidden partition in response to user expectation, but in certain embodiments, can revise this flow process to be applied in any other situation, for example in response to the request or the instruction that are used for the content of hidden partition is increased, deletes or carry out any other modification.In another embodiment, can instruct the content of checking arbitrary hidden partition, this instruction for example to be used for maybe can visiting the instruction of the content of hidden partition in response to any other of the content that relates to arbitrary hidden partition from the granted access instruction of hidden partition accessed content.
For example, can revise frame 302,, come from other memory cell or from user's acquired information with in response to about information being increased to the user instruction of hidden partition 212.In another embodiment, can revise frame 302, with the information of deletion in hidden partition.In another embodiment, the part of the flow process of Fig. 3 (for example, rhombus 308 and 314) can be used to check whether the content of hidden partition is effective.In one embodiment, can make up any method described herein of carrying out by hardware, firmware, software (comprising microcode) or its.For example, storage medium is store instruction thereon, when carrying out described instruction by machine, produces the characteristic according to any embodiment described herein.Though the flow process of Fig. 3 can be come synchronous two hidden partitions in response to the modification of authorizing, but in certain embodiments, can change this flow process effectively to recover in response to the content of determining another hidden partition or to repair hidden partition damage or that changed by unauthorized.In another embodiment, can determine termly first hidden partition 212 or second hidden partition 214 whether with cipher key match.In another embodiment, if the content of first hidden partition 212 is revised in the authorized user expectation, can carry out definite so.
In addition, though the embodiment of Fig. 1 and 2 is shown as the equipment that comprises some, some embodiment can be applied to the equipment of varying number.For example, in one embodiment, can use one or more hidden partitions and can correspondingly revise the flow process of Fig. 3.In certain embodiments, can provide a hidden partition.For example, be damaged in response to the content of determining hidden partition, the user can recover or repair the hidden partition that damages.Though Fig. 3 shows logic 240, in certain embodiments, can make up actuating logic 240 by hardware, firmware, software (comprising microcode) or its.For example, can realize logic 240 by saved software on hard disk 210 or any other memory device.
Though described some feature of the present invention with reference to embodiment, this description is not intended to the meaning that is interpreted as limiting.The various modification of these embodiment and concerning those skilled in the art in the invention conspicuous other embodiments of the invention considered to be in the spirit and scope of the present invention.

Claims (20)

1. system comprises:
First memory device, it comprises first hidden partition and second hidden partition; And
Be coupled to the logic of described first memory device, wherein, described logic is used for: at described second hidden partition storage second content identical with the first content of described first hidden partition, generate key based on described first content, and the validity of verifying described first content based on described key.
2. system according to claim 1 comprises:
Be coupled to second memory device of described logic, it is used to store described key, wherein, provides described second memory device in embedded system.
3. system according to claim 2 comprises:
Be coupled to the memory devices of described logic, it is used to store described key, wherein, provides described memory devices on safety chip.
4. system according to claim 1, wherein, the value that described logic is used to revise described first content and upgrades described key based on the first content of being revised.
5. system according to claim 1, wherein, described logic is used to revise described first content and upgrades described second content based on the first content of being revised.
6. system according to claim 1, wherein, described logic is used in response to definite described key and described first content does not match and described key and described second content coupling, with described second content and described first content synchronously to repair described first content.
7. system according to claim 1, wherein, described logic is used to provide the unmatched information about between described key and described first hidden partition and described second hidden partition.
8. system according to claim 1, wherein, described logic is used for described key being stored in safe memory device and visiting described key to verify the validity of described first hidden partition.
9. method comprises:
In first memory device, provide second hidden partition, with the first content synchronous second content of storage with first hidden partition of described first memory device;
Key with described first content coupling is provided; And
In response to modification, upgrade the described second content and the described key of described second hidden partition based on the first content of being revised to the mandate of the described first content of described first hidden partition.
10. method according to claim 9 comprises:
In response to the instruction of the described first content of visit, detect described first content whether with described cipher key match;
In response to determining not matching between described first content and described key, detect described second content whether with described cipher key match; And
In response to definite described second content and described cipher key match, with described first content and described second content synchronously to repair described first content.
11. method according to claim 9 comprises:
Determine described first content whether with described cipher key match;
In response to definite described first content and described cipher key match, determine described second content whether with described cipher key match; And
Recover described second content based on described first content.
12. method according to claim 9 comprises:
In response to definite described key and described first content coupling, determine that described first content is effective;
In response to determining not matching between described key and described second content, effective described first content is copied to described second hidden partition.
13. method according to claim 9 comprises:
Described key is stored in second memory device on the embedded chip.
14. method according to claim 9 comprises:
In response to the access instruction of the mandate of visiting described first hidden partition, determine whether described key mates with described first content;
In response to definite described key and described first content coupling, visit described first hidden partition.
15. a machine readable media comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
The first content of first hidden partition of memory device is copied to second hidden partition of described memory device;
Provide key based on described second hidden partition; And
Do not match in response to definite described first content and described key, described first hidden partition and described second hidden partition is synchronous.
16. machine readable media according to claim 15 also comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
Mate in response to the content of determining described first hidden partition and the value of described key, with information stores in described first hidden partition;
Described second hidden partition is synchronous with first hidden partition of being revised; And
Upgrade described key based on described second hidden partition.
17. machine readable media according to claim 15 also comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
All do not match in response to the value of determining described key and the content of described two hidden partitions, determine the difference between the described second content of the described first content of described first hidden partition and described second hidden partition, to recover described first content and described second content.
18. machine readable media according to claim 15 also comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
In response to the modification of the mandate on described first hidden partition, upgrade the value of described key.
19. machine readable media according to claim 15 also comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
In response to the modification of the mandate on described first hidden partition, upgrade the content of described second hidden partition.
20. machine readable media according to claim 15 also comprises many instructions, wherein, makes computing equipment in response to carrying out described instruction:
Determine described key whether with the second content coupling of described second hidden partition; And
Do not match in response to the described second content of determining described key and described second hidden partition, repair the described second content of described second hidden partition based on the described first content of described second hidden partition.
CN200780053762.6A 2007-07-13 2007-07-13 Key based hidden partition system Expired - Fee Related CN101785239B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2007/002156 WO2009009921A1 (en) 2007-07-13 2007-07-13 Key based hidden partition system

Publications (2)

Publication Number Publication Date
CN101785239A true CN101785239A (en) 2010-07-21
CN101785239B CN101785239B (en) 2013-01-02

Family

ID=40259278

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200780053762.6A Expired - Fee Related CN101785239B (en) 2007-07-13 2007-07-13 Key based hidden partition system

Country Status (2)

Country Link
CN (1) CN101785239B (en)
WO (1) WO2009009921A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102681915A (en) * 2011-01-17 2012-09-19 三星电子株式会社 Computer system and program restoring method thereof
CN103870762A (en) * 2012-12-18 2014-06-18 联想(北京)有限公司 Partition accessing method and electronic equipment
CN110059028A (en) * 2018-01-17 2019-07-26 瑞昱半导体股份有限公司 Data storage chip and data access method

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104424047A (en) * 2013-08-20 2015-03-18 研祥智能科技股份有限公司 NVRAM data recovery method and NVRAM data recovery device
US10037286B2 (en) 2014-08-26 2018-07-31 Red Hat, Inc. Private partition with hardware unlocking
CN104794024A (en) * 2015-04-15 2015-07-22 四川神琥科技有限公司 Data recovery method
CN104751076A (en) * 2015-04-15 2015-07-01 四川神琥科技有限公司 Method for recovering disk data
CN105302671A (en) * 2015-11-11 2016-02-03 中国建设银行股份有限公司 Automatic backup and rollback method and device

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3477949B2 (en) * 1995-10-19 2003-12-10 富士ゼロックス株式会社 Keyword management device
CN100389408C (en) * 2001-11-08 2008-05-21 联想(北京)有限公司 Fixed disk data enciphering back-up and restoring method
US20040268079A1 (en) * 2003-06-24 2004-12-30 International Business Machines Corporation Method and system for providing a secure rapid restore backup of a raid system
CN1877539A (en) * 2005-06-07 2006-12-13 英业达股份有限公司 Data backup/recovery system under cold start mode and implementing method therefor

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102681915A (en) * 2011-01-17 2012-09-19 三星电子株式会社 Computer system and program restoring method thereof
US9317275B2 (en) 2011-01-17 2016-04-19 Samsung Electronics Co., Ltd. Computer system and program restoring method thereof
CN102681915B (en) * 2011-01-17 2017-08-11 爱思打印解决方案有限公司 Computer system and its program recovery method
CN103870762A (en) * 2012-12-18 2014-06-18 联想(北京)有限公司 Partition accessing method and electronic equipment
CN103870762B (en) * 2012-12-18 2017-08-29 联想(北京)有限公司 Regional addressing method and electronic equipment
CN110059028A (en) * 2018-01-17 2019-07-26 瑞昱半导体股份有限公司 Data storage chip and data access method

Also Published As

Publication number Publication date
CN101785239B (en) 2013-01-02
WO2009009921A1 (en) 2009-01-22

Similar Documents

Publication Publication Date Title
CN101785239B (en) Key based hidden partition system
US9836606B2 (en) Secure recovery apparatus and method
US8943491B2 (en) Systems and methods for maintaining CRTM code
TWI471726B (en) Managing cache data and metadata
US20050085222A1 (en) Software updating process for mobile devices
US8898797B2 (en) Secure option ROM firmware updates
CN102473223B (en) Information processing device and information processing method
CN105122261A (en) Recovering from compromised system boot code
CN102323930B (en) Mirroring data changes in a database system
US8751817B2 (en) Data processing apparatus and validity verification method
JP6925542B2 (en) Software verification device, software verification method and software verification program
KR20200068345A (en) Method for updating Boot ROM of Embedded system and booting of thereof
RU2353969C2 (en) Method and device for computer memory binding to motherboard
TW201447903A (en) Repairing compromised system data in a non-volatile memory
JP7113115B2 (en) Security system and method for preventing rollback attacks on silicon device firmware
US8347052B2 (en) Initializing of a memory area
US20100115004A1 (en) Backup system that stores boot data file of embedded system in different strorage sections and method thereof
CN112558884B (en) Data protection method and NVMe-based storage device
US8972745B2 (en) Secure data handling in a computer system
WO2015116204A1 (en) Encrypted in-place operating system migration
CN115827069A (en) Starting control method, system and device for server mainboard
JP2015108986A (en) Information processing apparatus, test instruction string for information processing apparatus, and testing method
US20100161925A1 (en) Information processing apparatus, information processing method, and computer-readable recording medium having an information processing program
CN117743200A (en) TCG byte table processing method and storage device
WO2019019800A1 (en) Hard disk data access method and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130102

Termination date: 20180713