Key fragmentation processing method and device, electronic equipment and storage medium
By determining the key shards to be updated and not updated, and using the key shards that are not updated to generate the key update function, and only frequently used key shards are updated, resource waste and security issues in the prior art are solved. , realizes security update and resource optimization of keys.
Patent Information
- Application Number
- CN202310628013.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-30
- Publication Date
- 2024-12-03
AI Technical Summary
Existing key shard update policies lead to waste of resources, and unupdated key shards may cause security issues when propagating on the network.
By determining the key shards to be updated and not updated, the key update function is generated using the non-updated key shards, only frequently used key shards are updated, reducing unnecessary resource consumption and reducing security risks.
Partial update of keys is realized, reducing resource waste, and improving the security of keys, avoiding the security problems caused by the propagation of non-updated key shards on the network.
Smart Images

Figure CN119070973A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of information technology, and in particular to a key sharding processing method, device, electronic device and storage medium. Background Art
[0002] For secure storage or sharing of data, keys are usually used to encrypt data to ensure data security and store keys securely. In order to reduce the risk of key leakage or loss, existing solutions often use key sharding to divide the original key into multiple key shards and store them separately.
[0003] In order to enhance the security of the key, existing solutions often adopt a periodic update method to update all key shards at regular intervals to reduce the risk of key shard leakage. However, not all key shards are often used, so the periodic update scheme may also cause the less used key shards to be updated, resulting in a waste of resources. Summary of the invention
[0004] The present invention provides a key sharding processing method, device, electronic device and storage medium.
[0005] According to a first aspect of an embodiment of the present disclosure, a key sharding processing method is provided, the method comprising:
[0006] Determining a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key;
[0007] Determining a key update function according to the second key shard;
[0008] According to the key update function, updating the first key shard to obtain a third key shard, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key;
[0009] The third key fragment is sent to the corresponding client holding the account.
[0010] In some embodiments, the second key shard set includes N key shards, T key shards among the N key shards generate the key, and the T key shards include the second key shard, wherein both N and T are positive integers and N is greater than T.
[0011] In some embodiments, the usage frequency of the first key shard is greater than the usage frequency of the second key shard;
[0012] and / or,
[0013] The number of times the first key fragment is used within a preset time period is greater than the number of times the second key fragment is used.
[0014] In some embodiments, the number of the second key shards is less than the T.
[0015] In some embodiments, determining a key update function according to the second key shard includes:
[0016] Select multiple random numbers within a preset range;
[0017] Constructing a polynomial according to the random number;
[0018] The polynomial is processed according to the second key shard to obtain the key update function.
[0019] In some embodiments, updating the first key shard to obtain a third key shard according to the key update function includes:
[0020] Determining an update value of the first key shard according to the key update function;
[0021] The third key fragment is obtained according to the updated value and the original value of the first key fragment.
[0022] In some embodiments, the method further comprises:
[0023] Receiving operation status information from the client; wherein the operation status information at least includes: the number of accesses and / or the access frequency of the client;
[0024] The key update period is adjusted according to the operating status information.
[0025] According to a second aspect of an embodiment of the present disclosure, a key sharding processing device is provided, the device comprising:
[0026] A first determining module, configured to determine a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key;
[0027] A second determining module, configured to determine a key update function according to the second key shard;
[0028] an updating module, configured to update the first key shard to obtain a third key shard according to the key update function, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key;
[0029] The sending module is used to send the third key fragment to the corresponding client holding the account.
[0030] According to a third aspect of the present disclosure, an electronic device is provided, including:
[0031] a memory storing computer-readable instructions;
[0032] A processor, connected to the memory, is used to implement the steps of the method described in the first aspect of the above embodiment by running the computer-readable instructions.
[0033] According to a fourth aspect of an embodiment of the present disclosure, a computer-readable storage medium is provided, wherein the computer storage medium stores computer-executable instructions; after the computer-executable instructions are executed by a processor, the steps of the method described in the first aspect of the above embodiment can be implemented.
[0034] The technical solution provided by the embodiments of the present disclosure may have the following beneficial effects:
[0035] The key sharding processing method provided in the embodiment of the present disclosure, on the one hand, realizes the update of the key by updating the first key shard, thereby reducing the use time of a single key, and on the other hand, can achieve the update of the key by not updating the second key shard, which is equivalent to the second key shard always being stored in the client and not being transmitted in the network, thereby reducing the security issues caused by the update process of the second key shard and improving security.
[0036] The key update function is determined according to the second key shard, so as to realize the key update by updating the first key shard without updating the second key shard.
[0037] A key update function is determined, and the first key shard to be updated is updated using the key update function. In this way, after the key is updated using the key update function determined by the second key shard that is not updated, the second key shard that is not updated is still valid, and the update of the first key shard is achieved, thereby ensuring key security while reducing resource consumption.
[0038] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.
[0040] Figure 1 This is a schematic diagram of a key sharding processing method provided by an embodiment of the present disclosure. Figure 1 ;
[0041] Figure 2 This is a schematic diagram of a key sharding processing method provided by an embodiment of the present disclosure. Figure 2 ;
[0042] Figure 3 This is a schematic diagram of a key sharding processing method provided by an embodiment of the present disclosure. Figure 3 ;
[0043] Figure 4 The present invention provides a threshold key refresh method without cold backup key participation. Figure 1 ;
[0044] Figure 5 The present invention provides a threshold key refresh method without cold backup key participation. Figure 2 ;
[0045] Figure 6 It is a structural schematic diagram of a key sharding processing device provided by an embodiment of the present disclosure;
[0046] Figure 7 It is a structural schematic diagram of an electronic device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION
[0047] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices consistent with some aspects of the present disclosure as detailed in the appended claims.
[0048] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are to be considered exemplary only, and the true scope and spirit of the present disclosure are indicated by the following claims.
[0049] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
[0050] The present disclosure provides a key sharding processing method, such as Figure 1 As shown, the key sharding processing method includes:
[0051] Step 110: determining first key shards to be updated and second key shards not to be updated in the current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shards and the second key shards can generate a key;
[0052] Step 120: Determine a key update function according to the second key shard;
[0053] Step 130: According to the key update function, the first key shard is updated to obtain a third key shard, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key;
[0054] Step 140: Segment the third key and send it to the corresponding client holding the account.
[0055] The key shard is a part of the key, which is usually distributed and stored in different clients. A key is divided into multiple key shards and encrypted and stored separately. When the key is used, a certain number of key shards exceeding a set threshold are required to restore the original key, and the certain number here is less than the total number of key shards. Compared with directly encrypting and storing the original key, the form of key sharding makes it impossible to restore the original key even if a few key shards are leaked, which can reduce the possibility of leakage of the original key and improve security. Therefore, in the embodiment of the present disclosure, by setting a method of generating keys by at least part of the key shards, the security of the key can be guaranteed and the risk of key leakage caused by leakage of a single key shard can be reduced.
[0056] In the disclosed embodiment, the key may be a private key, and multiple key fragments may generate a private key, and the generated private key may be combined with a corresponding public key for encryption and decryption. Exemplarily, one public key corresponds to one private key, and one private key and one public key form a key pair. If a piece of data is encrypted with a public key, it may be decrypted with a private key. If a piece of data is encrypted with a private key, it may be decrypted with a public key.
[0057] If the data is signed with a public key, the private key can be used to decrypt the signature. If the data is signed with a private key, the public key can be used to decrypt the signature.
[0058] The key update function may be a function with the information of the second key shard as a parameter, the input of the function may be the information of the key shard, such as the number of the key shard (used to identify different key shards) or the key value corresponding to the key shard, etc., and the output of the function may be the updated value of the key shard. In the embodiment of the present disclosure, the key update function is determined by the second key shard that is not updated, so that after the second key shard is processed by the key update function, the key value corresponding to the second key shard does not change, that is, the key value after processing is equal to the key value before processing. In this way, after the key is updated by the key update function determined according to the second key shard, the key value corresponding to the second key shard that is not updated is still valid, and the first key shard to be updated is updated to obtain the third key shard, the key value corresponding to the first key shard is invalid, and the key value corresponding to the third key shard is valid, thereby realizing a partial update of the key shard.
[0059] Exemplarily, the key update function may be determined according to the number of the second key shard. For example, if the number of the second key shard is K, a factor (XK) may be added to the key update function F(X), so that the update value F(K) determined according to the key update function F(X) is zero. In this way, after the first key shard to be updated is updated according to the key update function, the key value corresponding to the second key shard that has not been updated is still valid.
[0060] In the disclosed embodiment, the client may have multiple key shard holding accounts, and each holding account may hold one or more key shards. For example, the key shards may be divided according to the authority of the account. When the authority of the current account is low, one key shard may be divided; when the authority of the current account is high, multiple key shards may be divided. In this way, the number of key shards stored in the client where the corresponding account is located may be determined according to the importance of the account.
[0061] In the disclosed embodiment, by determining the first key shard to be updated and the second key shard not to be updated in the current key update cycle, and then determining the key update function according to the second key shard not to be updated, the second key shard is still valid after the first key shard is updated using the key update function to obtain the third key shard. Then the third key shard is sent to the client, thereby realizing the partial update of the key shard. In this way, by partially updating the key shard, the risk of exposure of the key shard not to be updated is reduced, and while ensuring the security of the key, unnecessary waste of resources is reduced.
[0062] In some embodiments, the second key shard set includes N key shards, T key shards among the N key shards generate the key, and the T key shards include the second key shard, wherein both N and T are positive integers and N is greater than T.
[0063] In the embodiment of the present disclosure, at least T key shards are required to recover the key. Therefore, in order to ensure the security of the key and reduce the risk of key leakage due to the leakage of a single key shard, T can be set to a positive integer greater than or equal to 2.
[0064] In the disclosed embodiment, in order to further improve the security of the key, the relationship between the number of key shards N and the number of key shards T required to recover the key can be set. Exemplarily, the T and N satisfy a certain ratio relationship, for example, the ratio of T to N can be between 0.6 and 0.9, preferably 0.75. Too high a ratio makes the encryption and decryption of the key too complicated, while too low a ratio reduces the security of the key. Therefore, by reasonably setting the ratio between T and N, the security of the key can be improved while taking into account the complexity of encryption and decryption.
[0065] In the embodiment of the present disclosure, a key is generated by setting T key shards out of N key shards in a second key shard set, and the T key shards include the second key shard. On the one hand, even if N key shards in the second key shard set are lost, as long as the number of remaining key shards is greater than or equal to T, the key can be generated, thereby performing encryption and decryption processing in combination with the public key. On the other hand, the T key shards include the second key shard that is not updated, and the second key shard does not participate in the update, thereby reducing the risk of exposure of the second key shard, thereby improving the security of the key.
[0066] In some embodiments, the usage frequency of the first key shard is greater than the usage frequency of the second key shard;
[0067] and / or,
[0068] The number of times the first key fragment is used within a preset time period is greater than the number of times the second key fragment is used.
[0069] In the embodiments of the present disclosure, the first key shard to be updated and the second key shard not to be updated in the current key update cycle are determined by the usage frequency of the key shard and / or the number of times it is used within a preset time period, so that the key shard that is used more frequently can be updated to reduce the risk of key shard leakage due to frequent use. At the same time, the key shard that is used less frequently is not updated to reduce the waste of resources.
[0070] In some embodiments, the number of the second key shards is less than the T.
[0071] In the disclosed embodiment, at least T key shards are required to generate a key, that is, T is a threshold value. Therefore, in order to achieve effective update of key shards, that is, after the key shards are updated, multiple second key shards that are not updated cannot be combined to generate a key, it is necessary to set the number of second key shards that are not updated to be less than the threshold value T.
[0072] In some embodiments, Figure 2 As shown, step 120 may include:
[0073] Step 121: Select multiple random numbers within a preset range;
[0074] Step 122: constructing a polynomial according to the random number;
[0075] Step 123: Process the polynomial according to the second key shard to obtain the key update function.
[0076] The preset range may be a finite field, such as an integer set Z consisting of a plurality of integers 0, 1, 2, ..., q. q wait.
[0077] In the embodiment of the present disclosure, the polynomial can be constructed in the following manner:
[0078] In Z q Select t random numbers from the t (i=1,2…,t);
[0079] Construct polynomial f(x)=a1x+a2x 2 +…+a t x t +b;
[0080] Where x is the input variable and b is the constant term.
[0081] In the embodiment of the present disclosure, the input variable x may be set to information of the key shard, such as the number of the key shard.
[0082] In the disclosed embodiment, the constant term b in the polynomial f(x) can be set to 0, and the number K corresponding to the second key shard can be added as a factor (XK) to the polynomial f(x) to obtain the key update function F(x), so that the update value F(K) of the second key shard determined according to the key update function is zero. In this way, after the first key shard to be updated is updated according to the key update function, the key value corresponding to the second key shard that has not been updated is still valid.
[0083] In some embodiments, Figure 3 As shown, step 130 may include:
[0084] Step 131: determining an update value of the first key shard according to the key update function;
[0085] Step 132: Obtain the third key fragment according to the updated value and the original value of the first key fragment.
[0086] In the disclosed embodiment, the updated value of the first key shard determined by the key update function is combined with the original value of the first key shard to perform calculations, so as to quickly determine the third key shard. Exemplarily, the original value of the first key shard can be added to the updated value to obtain the third key shard.
[0087] In some embodiments, the method further comprises:
[0088] Receiving operation status information from the client; wherein the operation status information at least includes: the number of accesses and / or the access frequency of the client;
[0089] The key update period is adjusted according to the operating status information.
[0090] In the disclosed embodiment, the key update period can be adjusted according to the operation status information of the client. For example, when the client has more accesses, it indicates that the key shards are used more frequently, so the key update period can be appropriately shortened, thereby reducing the risk of possible leakage of the key shards and improving security. When the client has less accesses, it indicates that the key shards are used less frequently, so the key update period can be appropriately extended, thereby reducing the resources required for the update.
[0091] The application areas of key sharding may include: digital assets and / or confidential information storage, etc. For the update strategy of key sharding, there are two methods: active update and passive update.
[0092] However, the above strategy for updating key shards requires updating all key shards. In actual applications, in order to reduce the risk of exposure of certain key shards, these key shards may not be updated.
[0093] Based on this, the present disclosure also provides a threshold key refresh method that does not require the participation of cold standby keys. By pre-setting the threshold t and the number of participants n, the MPC (Multi-Party Computation) key generation protocol is executed. When the protocol ends, everyone can obtain their own key shards. The key shards are divided into two types: hot key shards and cold key shards. At regular intervals, all hot key shards are refreshed through the MPC key refresh protocol, and the holders of the hot key shards will get a new key shard. At the same time, the cold key shards do not need to participate in the update or passive update. The threshold t is one of the aforementioned T, the n is one of the aforementioned N, the number of participants is one of the aforementioned holding accounts, the cold key shard is one of the aforementioned second key shard, the hot key shard is one of the aforementioned first key shard, and the new key shard is one of the aforementioned third key shard. The specific process of a threshold key refresh method that does not require the participation of cold standby keys provided in an embodiment of the present disclosure is as follows: Figure 4 and Figure 5 shown.
[0094] Exemplarily, the cold standby key here is a kind of the second key shard mentioned above, and the cold standby key does not participate in the key refresh protocol for refresh. Therefore, during the key shard update process, the cold standby key will not be propagated, and the account storing the cold standby key does not need to interact with the outside world. In this way, the risk of exposure of the cold standby key during the key shard update process can be reduced, and the security of the cold standby key can be improved. The participant here is a kind of the aforementioned holding account, and the participant can hold a cold standby key and / or a key hot shard. The key hot shard here is a kind of the first key shard mentioned above, and the key hot shard participates in the key refresh protocol at regular intervals to refresh to obtain a new key hot shard, so that the original key hot shard is invalidated, and the security of the key hot shard is improved. The threshold t here is a kind of the aforementioned T, which is used to indicate the number of participants required to restore the original key at least. The n here is a kind of the aforementioned N, which is used to indicate the number of participants. The MPC key refresh protocol here is a kind of the aforementioned key update function, which is used to update the key hot shard.
[0095] like Figure 4 FIG. 1 is a schematic diagram of a threshold key refresh method without cold backup key participation provided by an embodiment of the present disclosure. Figure 1 .Depend on Figure 4 It can be seen that the embodiment of the present disclosure generates three hot key shards and one cold key shard through the MPC key generation protocol, and sets the threshold to 3, that is, at least three key shards from the three hot key shards and one cold key shard are required to recover the true complete key.
[0096] like Figure 5FIG. 1 is a schematic diagram of a threshold key refresh method without cold backup key participation provided by an embodiment of the present disclosure. Figure 2 .Depend on Figure 5 It can be seen that the disclosed embodiment uses the MPC key refresh protocol to refresh three hot key shards, and obtains three new hot key shards, but does not refresh the cold key shards. At this time, the original three hot key shards are all invalid, and the generated new hot key shards are all valid. At this time, at least three of the three new hot key shards and one cold shard are required to restore the real complete key.
[0097] In a threshold key refresh method without cold backup key participation provided by an embodiment of the present disclosure, the symbol represents the participant P in the kth period i The threshold is t, the total number of participants is n, where {P n-m ,P n-m+1 ,…,P n} are m cold key shard holders who do not participate in key updates in period k, m≤t-2. After entering period k, participant P i Subkeys held from Updated to where f k-1 (0) = s, s is the complete key, Z q is the set of integers less than a prime number q.
[0098] The specific steps of this method are as follows:
[0099] 1. Participant P n In Z q Randomly select t-1 numbers from the ij (j=1,2,…,t-1), construct the polynomial:
[0100] satisfy
[0101] 2. Optional hot key shard holder P i To construct the update polynomial:
[0102]
[0103] satisfy
[0104] 3. Participant P i Calculate j = 1, 2, ..., n and get And the result Sent secretly to other participants.
[0105] 4. Participant P j calculate as its own new key shard.
[0106] 5. Since {(x-(nm)),(x-(n-m+1)),…,(xn)} is a polynomial factor, so The values of are all 0, so in step 4 {P n-m ,P n-m+1 ,…,P n}Keep the key unchanged, no need to update.
[0107] It can be seen that after the key shard is updated, the polynomial of the original hidden key becomes Obviously, The polynomial of the hidden key is updated without changing the original key.
[0108] The embodiment of the present disclosure provides a threshold key refresh method without the participation of cold standby keys, which can achieve the situation where cold key shard holders do not participate in the update, while achieving the situation where hot key shard holders participate in the update.
[0109] like Figure 6 As shown, a key sharding processing device provided by an embodiment of the present disclosure includes:
[0110] A first determining module 110 is configured to determine a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key;
[0111] A second determining module 120, configured to determine a key update function according to the second key shard;
[0112] An updating module 130, configured to update the first key shard to obtain a third key shard according to the key update function, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key;
[0113] The sending module 140 is used to send the third key fragment to the corresponding client holding the account.
[0114] In some embodiments, the first determination module 110, the second determination module 120, the update module 130 and the sending module 140 may all be program modules, which can implement the functions of the above modules after being executed by a processor.
[0115] In other embodiments, the first determination module 110, the second determination module 120, the update module 130 and the sending module 140 may all be software-hard combination modules; the software-hard combination modules include but are not limited to: various programmable arrays; the field programmable arrays include but are not limited to: field programmable arrays and / or complex programmable arrays.
[0116] In some other embodiments, the first determination module 110, the second determination module 120, the update module 130 and the sending module 140 may all be pure hardware modules; the pure hardware modules include but are not limited to: application specific integrated circuits.
[0117] In some embodiments, the second key shard set includes N key shards, T key shards among the N key shards generate the key, and the T key shards include the second key shard, wherein both N and T are positive integers and N is greater than T.
[0118] In some embodiments, the usage frequency of the first key shard is greater than the usage frequency of the second key shard;
[0119] and / or,
[0120] The number of times the first key fragment is used within a preset time period is greater than the number of times the second key fragment is used.
[0121] In some embodiments, the number of the second key shards is less than the T.
[0122] In some embodiments, the second determining module is used to:
[0123] Select multiple random numbers within a preset range;
[0124] Constructing a polynomial according to the random number;
[0125] The polynomial is processed according to the second key shard to obtain the key update function.
[0126] In some embodiments, the update module is used to:
[0127] Determining an update value of the first key shard according to the key update function;
[0128] The third key fragment is obtained according to the updated value and the original value of the first key fragment.
[0129] In some embodiments, the apparatus further comprises:
[0130] A receiving module, configured to receive the operation status information from the client; wherein the operation status information at least includes: the number of accesses and / or the access frequency of the client;
[0131] An adjustment module is used to adjust the key update period according to the operation status information.
[0132] In the present disclosure, in combination Figure 7 As shown, an electronic device 700 is provided, including:
[0133] Memory 704 for storing processor executable instructions;
[0134] A processor 720 connected to the memory 704;
[0135] The processor 720 is configured to execute the key sharding processing method provided by any of the aforementioned technical solutions.
[0136] is a block diagram of an electronic device 700 according to an exemplary embodiment. For example, the device 700 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, etc.
[0137] Reference Figure 7 , the device 700 may include one or more of the following components: a processing component 702 , a memory 704 , a power component 706 , a multimedia component 708 , an audio component 710 , an input / output (I / O) interface 712 , a sensor component 714 , and a communication component 716 .
[0138] The processing component 702 generally controls the overall operation of the device 700, such as operations associated with display, phone calls, data communications, camera operations, and recording operations. The processing component 702 may include one or more processors 720 to execute instructions to complete all or part of the steps of the above-mentioned method. In addition, the processing component 702 may include one or more modules to facilitate the interaction between the processing component 702 and other components. For example, the processing component 702 may include a multimedia module to facilitate the interaction between the multimedia component 708 and the processing component 702.
[0139] The memory 704 is configured to store various types of data to support operations on the device 700. Examples of such data include instructions for any application or method operating on the device 700, contact data, phone book data, messages, pictures, videos, etc. The memory 704 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.
[0140] The power component 706 provides power to the various components of the device 700. The power component 706 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device 700.
[0141] The multimedia component 708 includes a screen that provides an output interface between the device 700 and the user. In some embodiments, the screen may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from the user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundaries of the touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 708 includes a front camera and / or a rear camera. When the device 700 is in an operating mode, such as a shooting mode or a video mode, the front camera and / or the rear camera may receive external multimedia data. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.
[0142] The audio component 710 is configured to output and / or input audio signals. For example, the audio component 710 includes a microphone (MIC), and when the device 700 is in an operating mode, such as a call mode, a recording mode, and a speech recognition mode, the microphone is configured to receive an external audio signal. The received audio signal can be further stored in the memory 704 or sent via the communication component 716. In some embodiments, the audio component 710 also includes a speaker for outputting audio signals.
[0143] I / O interface 712 provides an interface between processing component 702 and peripheral interface modules, such as keyboards, click wheels, buttons, etc. These buttons may include but are not limited to: a home button, a volume button, a start button, and a lock button.
[0144] The sensor assembly 714 includes one or more sensors for providing various aspects of status assessment for the device 700. For example, the sensor assembly 714 can detect the open / closed state of the device 700, the relative positioning of components, such as the display and keypad of the device 700, and the sensor assembly 714 can also detect the position change of the device 700 or a component of the device 700, the presence or absence of user contact with the device 700, the orientation or acceleration / deceleration of the device 700, and the temperature change of the device 700. The sensor assembly 714 may include a proximity sensor configured to detect the presence of nearby objects without any physical contact. The sensor assembly 714 may also include an optical sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 714 may also include an accelerometer, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
[0145] The communication component 716 is configured to facilitate wired or wireless communication between the device 700 and other devices. The device 700 can access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 716 receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 716 also includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technologies.
[0146] In an exemplary embodiment, the apparatus 700 may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic components to perform the above methods.
[0147] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory 704 including instructions, and the instructions can be executed by the processor 720 of the device 700 to perform the above method. For example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.
[0148] An embodiment of the present disclosure provides a non-temporary computer-readable storage medium. When the instructions in the storage medium are executed by a processor of a computer, the computer is enabled to execute the key sharding processing method described in one or more of the aforementioned technical solutions.
[0149] When the processor executes the instruction, it can at least perform the following steps:
[0150] Determining a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key;
[0151] Determining a key update function according to the second key shard;
[0152] According to the key update function, updating the first key shard to obtain a third key shard, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key;
[0153] The third key fragment is sent to the corresponding client holding the account.
[0154] In some embodiments, the second key shard set includes N key shards, T key shards among the N key shards generate the key, and the T key shards include the second key shard, wherein both N and T are positive integers and N is greater than T.
[0155] In some embodiments, the usage frequency of the first key shard is greater than the usage frequency of the second key shard;
[0156] and / or,
[0157] The number of times the first key fragment is used within a preset time period is greater than the number of times the second key fragment is used.
[0158] In some embodiments, the number of the second key shards is less than the T.
[0159] In some embodiments, determining a key update function according to the second key shard includes:
[0160] Select multiple random numbers within a preset range;
[0161] Constructing a polynomial according to the random number;
[0162] The polynomial is processed according to the second key shard to obtain the key update function.
[0163] In some embodiments, updating the first key shard to obtain a third key shard according to the key update function includes:
[0164] Determining an update value of the first key shard according to the key update function;
[0165] The third key fragment is obtained according to the updated value and the original value of the first key fragment.
[0166] In some embodiments, the method further comprises:
[0167] Receiving operation status information from the client; wherein the operation status information at least includes: the number of accesses and / or the access frequency of the client;
[0168] The key update period is adjusted according to the operating status information.
[0169] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the attached application documents.
[0170] It should be understood that the present disclosure is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the attached application documents.
Claims
1. A key sharding update method, characterized in that: The method comprises: Determining a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key; Determining a key update function according to the second key shard; According to the key update function, updating the first key shard to obtain a third key shard, wherein at least some key shards in a second key shard set consisting of the third key shard and the second key shard can generate the key; The third key fragment is sent to the corresponding client holding the account.
2. The method according to claim 1, characterized in that The second key shard set includes N key shards, T key shards among the N key shards generate the key, and the T key shards include the second key shard, wherein both N and T are positive integers and N is greater than T.
3. The method according to claim 1, characterized in that The usage frequency of the first key shard is greater than the usage frequency of the second key shard; and / or, The number of times the first key fragment is used within a preset time period is greater than the number of times the second key fragment is used.
4. The method according to claim 2, characterized in that: The number of the second key fragments is less than the T.
5. The method according to claim 1, characterized in that The determining a key update function according to the second key shard includes: Select multiple random numbers within a preset range; Constructing a polynomial according to the random number; The polynomial is processed according to the second key shard to obtain the key update function.
6. The method according to claim 1, characterized in that The updating the first key shard to obtain a third key shard according to the key update function includes: Determining an update value of the first key shard according to the key update function; The third key fragment is obtained according to the updated value and the original value of the first key fragment.
7. The method according to any one of claims 1 to 6, characterized in that: The method further comprises: Receiving operation status information from the client; wherein the operation status information at least includes: the number of accesses and / or the access frequency of the client; The key update period is adjusted according to the operating status information.
8. A key sharding updating device, characterized in that: The device comprises: A first determining module, configured to determine a first key shard to be updated and a second key shard not to be updated in a current key update cycle, wherein at least some of the key shards in a first key shard set consisting of the first key shard and the second key shard can generate a key; A second determining module, configured to determine a key update function according to the second key shard; an updating module, configured to update the first key shard to obtain a third key shard according to the key update function, wherein at least some of the key shards in the second key shard set consisting of the third key shard and the second key shard can generate the key; The sending module is used to send the third key fragment to the corresponding client holding the account.
9. An electronic device, characterized in that: include: a memory storing computer-readable instructions; A processor, connected to the memory, is configured to implement the method according to any one of claims 1 to 7 by executing the computer-readable instructions.
10. A computer storage medium, characterized in that: The computer storage medium stores computer executable instructions; after the computer executable instructions are executed by the processor, the method described in any one of claims 1 to 7 can be implemented.
