CN117811733A - Task confirmation completion method and related device based on secret sharing algorithm - Google Patents

Task confirmation completion method and related device based on secret sharing algorithm Download PDF

Info

Publication number
CN117811733A
CN117811733A CN202410223785.2A CN202410223785A CN117811733A CN 117811733 A CN117811733 A CN 117811733A CN 202410223785 A CN202410223785 A CN 202410223785A CN 117811733 A CN117811733 A CN 117811733A
Authority
CN
China
Prior art keywords
secret
task
key
target
share
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
CN202410223785.2A
Other languages
Chinese (zh)
Other versions
CN117811733B (en
Inventor
孔剑平
胡楠
王琪
李炳博
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.)
Zhejiang Yuanmao Digital Technology Co ltd
Zhejiang Nanometer Technology Co ltd
Original Assignee
Zhejiang Yuanmao Digital Technology Co ltd
Zhejiang Nanometer Technology Co ltd
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 Zhejiang Yuanmao Digital Technology Co ltd, Zhejiang Nanometer Technology Co ltd filed Critical Zhejiang Yuanmao Digital Technology Co ltd
Priority to CN202410223785.2A priority Critical patent/CN117811733B/en
Publication of CN117811733A publication Critical patent/CN117811733A/en
Application granted granted Critical
Publication of CN117811733B publication Critical patent/CN117811733B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/101—Collaborative creation, e.g. joint development of products or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3263—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

The invention provides a task confirmation completion method of a secret sharing algorithm and a related device, wherein the method comprises the following steps: acquiring a target task and a secret key corresponding to the target task; dividing the target task into at least two target subtasks; dividing the key into a first key and a second key by using a preset division calculation formula; dividing the first secret key by utilizing a first preset secret sharing algorithm to obtain at least two first secret shares; dividing the secret share of the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares; distributing the first secret share to each target subtask; the target subtask is sent to at least two executors and the second secret share is sent to at least two authenticators. The method and the device have the advantages that the certification party obtains the first secret share and the second secret share to sign the completion certificate of the target task. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.

Description

Task confirmation completion method and related device based on secret sharing algorithm
Technical Field
The invention relates to the technical field of computer information processing, in particular to a task confirmation completion method of a secret sharing algorithm and a related device.
Background
The task is to translate goals into specific work content and action plans to improve efficiency, enhance executability, promote team cooperation, and promote personal growth. And whether the target is completed is determined by determining whether the task is completed.
The determination of task completion is typically performed by the task initiator, or the task executor; there may be multiple parts of the target task and multiple sub-steps per part. When the initiator determines whether the target task is completed, it needs to determine whether each executor has completed the issued part, and then confirms that the target task is completed. However, if the initiator confirms whether the task is completed, the acceptance of the task completion by the executor is reduced, i.e., if the initiator does not confirm the completion of the task, the executor is always in a state of completing the task, so that the problem of lower accuracy of confirming the completion of the task exists.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a task confirmation completion method and related device based on a secret sharing algorithm.
A task confirmation completion method based on a secret sharing algorithm comprises the following steps:
Acquiring a target task and a secret key corresponding to the target task;
dividing the target task into at least two target subtasks;
dividing the key into a first key and a second key by using a preset division calculation formula;
dividing the first secret key by using a first preset secret sharing algorithm to obtain at least two first secret shares;
dividing the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares;
distributing the first secret share to each target subtask, wherein when the target subtask is completed, an executor obtains the corresponding first secret share;
and sending the target subtask to at least two executors and sending the second secret share to at least two authenticators.
In one embodiment, said assigning said first secret share to each of said target subtasks comprises:
determining the weight of each target subtask;
and distributing the first secret share to each target subtask according to the weight.
A task confirmation completion method based on a secret sharing algorithm comprises the following steps:
Acquiring at least one target subtask, and executing the target subtask to obtain a first secret share corresponding to the target subtask;
and generating a certificate request for completing the task based on the first secret share, and sending the first secret share and the certificate request to an authenticator.
A task confirmation completion method based on a secret sharing algorithm comprises the following steps:
receiving a first secret share and a certificate request sent by an executor, wherein the certificate request is a certificate request for completing a task;
acquiring a second secret share;
calculating a first secret key by using the first secret share, and calculating a second secret key by using the second secret share;
acquiring a completion task certificate corresponding to a target task of an initiator;
and calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request.
In one embodiment, said signing said completion task certificate with said key in response to said certificate request comprises:
carrying out hash processing on the certificate by using a hash algorithm to obtain a digest;
the digest is signed with the key in response to the certificate request.
A secret sharing algorithm-based task confirmation completion device, comprising:
the first acquisition module is used for acquiring a target task and a secret key corresponding to the target task;
the first dividing module is used for dividing the target task into at least two target subtasks;
the second dividing module is used for dividing the secret key into a first secret key and a second secret key by utilizing a preset dividing calculation formula;
the third dividing module is used for dividing the secret share of the first secret key by utilizing a first preset secret sharing algorithm to obtain at least two first secret shares;
the fourth dividing module is used for dividing the secret share of the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares;
the distribution module is used for distributing the first secret share to each target subtask, wherein when the target subtask is completed, an executor obtains the corresponding first secret share;
and the first sending module is used for sending the target subtask to at least two executors and sending the second secret share to at least two authenticators.
A secret sharing algorithm-based task confirmation completion device, comprising:
The second acquisition module is used for acquiring at least one target subtask and executing the target subtask to obtain a first secret share corresponding to the target subtask;
and the second sending module is used for generating a certificate request for completing the task based on the first secret share and sending the first secret share and the certificate request to an authenticator.
A secret sharing algorithm-based task confirmation completion device, comprising:
the second acquisition module is used for acquiring a second secret share;
the receiving module is used for receiving a first secret share and a certificate request sent by an executor, wherein the certificate request is a certificate request for completing a task;
the computing module is used for computing a first secret key by using the first secret share and computing a second secret key by using the second secret share;
the third acquisition module is used for acquiring a task completion certificate corresponding to the target task of the initiator;
and the signature module is used for calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request.
A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the task validation completion method of the secret sharing algorithm described in any of the embodiments above when the computer program is executed.
A computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the task validation completion method of a secret sharing algorithm as described in any of the embodiments above.
According to the task confirmation completion method and the related device of the secret sharing algorithm, the secret key is divided into the first secret share and the second secret share, the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes a task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
Drawings
FIG. 1 is a flow diagram of a task validation completion method based on a secret sharing algorithm in one embodiment;
FIG. 2 is a flow diagram of a task validation completion method based on a secret sharing algorithm in one embodiment;
FIG. 3 is a block diagram of a task validation completion device based on a secret sharing algorithm in one embodiment;
FIG. 4 is an internal block diagram of a computer device in one embodiment;
FIG. 5 is a flow diagram of a task validation completion method based on a secret sharing algorithm in one embodiment;
FIG. 6 is a block diagram of a task validation completion device based on a secret sharing algorithm in one embodiment;
fig. 7 is a block diagram of a task confirmation completion device based on a secret sharing algorithm in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
Example 1
In this embodiment, referring to fig. 1, an embodiment of a task confirmation completion method based on a secret sharing algorithm is provided, including:
step 110, obtaining a target task and a key corresponding to the target task.
Before an executor executes a target task, in order to ensure smooth execution, evaluation, feedback and the like of the target task, an initiator needs to acquire the target task first; in this embodiment, the target task may include multiple portions, and the executor may only need to complete one of the portions to determine that the task is completed. At this point the initiator cannot start to specify which parts the user has completed in the task certificate; and the initiator does not write in the executor of the target task before the task is executed, the initiator needs to acquire the secret key corresponding to the target task, so that the authenticator finally completes the signature of the task certificate according to the secret key corresponding to the target task to determine which specific task is executed by which executor, and the authenticator confirms whether the target task is completed or not, thereby improving the accuracy of task completion confirmation.
In the present embodiment, the key may be generated by generating a random number, or may be generated by a preset algorithm, which is not particularly limited herein.
Step 120, dividing the target task into at least two target subtasks.
After the initiator acquires the target task, the initiator divides the target task into at least two target subtasks according to a preset rule, for example: the target task isTarget task->Dividing into at least two target sub-tasks +.>、、...、The method comprises the steps of carrying out a first treatment on the surface of the Where n is the nth target sub-task, providing a data basis for step 170.
In this embodiment, dividing the target subtasks according to the preset rule may be dividing the target subtasks according to the function module; the target subtasks may also be divided according to a logic structure, which is not particularly limited herein.
And 130, dividing the key into a first key and a second key by using a preset division calculation formula.
After the initiator obtains the key corresponding to the target task, a preset division calculation formula is further determined according to the safety and the reliability of the use of the key, and the key is divided by the preset division calculation formula to obtain two keys, namely a first key and a second key. The first key and the second key can be combined to form a key through a combination calculation formula corresponding to a preset division calculation formula. For example: the key is sec, and the key sec is divided into sec1 and sec2 by using a preset division calculation formula; at this time, sec1 and sec2 may be synthesized into sec using a synthesis calculation formula corresponding to a preset division calculation formula. Specific: extracting all odd bits in sec, and randomly replacing even bits; all even bits in sec are extracted and odd bits are randomly replaced.
For example: when sec=1001001, the corresponding sec 1=1x0x0x1; sec2 = x0x1x0x.
In this embodiment, the preset division calculation formula may be a symmetrical division calculation formula or an asymmetrical division calculation formula, which is not limited herein.
And 140, carrying out secret share division on the first secret key by using a first preset secret sharing algorithm to obtain at least two first secret shares.
Specifically, the first key is set toConstructing a polynomial:
wherein,is->，、、...、Is a coefficient.
Will beAssign to->Optionally select n->、、、...、Respectively substituting the polynomials to obtain corresponding +.>、、、...、. I.e. < ->、、、...、Is the first secret share corresponding to the first key.
In this embodiment, the first preset secret sharing algorithm may be any one of Shamir algorithm, blakley algorithm, asmuth-Bloom algorithm, multiple secret sharing algorithm, or dynamic secret sharing algorithm, which is not specifically limited herein.
And step 150, carrying out secret share division on the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares.
Specifically, the second key is set toAnd construct a polynomial:
wherein,is->，、、...、Is a coefficient.
Will beAssign to->Optionally select n- >、、、...、Respectively substituting the polynomials to obtain corresponding +.>、、、...、. I.e. < ->、、、...、Is the second secret share corresponding to the second key.
In this embodiment, the second preset secret sharing algorithm may be identical to the first preset secret sharing algorithm, or may be inconsistent with the first preset secret sharing algorithm, which is not specifically limited herein.
In this embodiment, the second preset secret sharing algorithm may be any one of Shamir algorithm, blakley algorithm, asmuth-Bloom algorithm, multiple secret sharing algorithm, or dynamic secret sharing algorithm, which is not specifically limited herein.
Step 160, allocating the first secret share to each of the target subtasks, where when the target subtasks are completed, the executor obtains the corresponding first secret share.
Since the first secret share can reach a certain secret fractionAfter the first secret key is calculated, the initiator divides the secret share of the first secret key by using a first preset secret sharing algorithm to obtain a first secret share, and then distributes the first secret share to the target subtask according to a preset rule in order to balance the importance degree in the target subtask. For example: the target subtask is、、...、The method comprises the steps of carrying out a first treatment on the surface of the The first secret fraction is- >、、、...、The method comprises the steps of carrying out a first treatment on the surface of the The preset rules are distributed in sequence. Then target subtask->The allocated first secret fraction is +.>Targeted subtask->The allocated first secret fraction is +.>The method comprises the steps of carrying out a first treatment on the surface of the Target subtask->The allocated first secret fraction is +.>。
In this embodiment, the initiator allocates the first secret share to each target subtask, which provides a data base for step 170, and the target subtask allocated with the first secret share is used for obtaining the corresponding first secret share by the corresponding executor when the target subtask is completed.
In this embodiment, the allocation of the first secret shares according to the preset rule may be that the first secret shares are allocated in sequence, or that the first secret shares are allocated according to weights, or that the first secret shares are allocated according to random; the present invention is not particularly limited herein.
Step 170, sending the target subtask to at least two executors, and sending the second secret share to at least two authenticators.
In this embodiment, a target task and a key corresponding to the target task are obtained; dividing the target task into at least two target subtasks; dividing the key into a first key and a second key by using a preset division calculation formula; dividing the first secret key by using a first preset secret sharing algorithm to obtain at least two first secret shares; dividing the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares; distributing the first secret share to each target subtask; and sending the target subtask to at least two executors and sending the second secret share to at least two authenticators. In the embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
It should be understood that, although the steps in the flowchart of fig. 1 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 1 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of other steps or sub-steps of other steps.
In one embodiment, said assigning said first secret share to each of said target subtasks comprises:
1-1) determining the weight of each of the target subtasks.
In this embodiment, when the initiator confirms that the first secret share is allocated to each target subtask according to the weight rule, the initiator needs to determine the weight of each target subtask first; for example, the number of the cells to be processed, 、、...、The weight corresponding to each is +.> 、 、...、 The method comprises the steps of carrying out a first treatment on the surface of the And wherein->The method comprises the steps of carrying out a first treatment on the surface of the The first secret fraction is->、、、...、。
1-2) assigning the first secret share to each of the target subtasks according to the weights.
In particular, when、、...、The weight corresponding to each is +.>、、...、The method comprises the steps of carrying out a first treatment on the surface of the And wherein->The method comprises the steps of carrying out a first treatment on the surface of the The first secret fraction is->、、、...、The first secret fraction can be +.>And->Distribution to target subtasks->The method comprises the steps of carrying out a first treatment on the surface of the The first secret fraction->Distribution to target subtasks->The method comprises the steps of carrying out a first treatment on the surface of the The first secret fraction->Distribution to target subtasks->。
In this embodiment, the first secret shares are allocated according to the target subtask weights in the target tasks, so that more important target subtasks can obtain more first secret shares, more general target subtasks obtain fewer first secret shares, and when the more important target subtasks are completed, more first secret shares can be obtained, namely when a part of target subtasks are completed, the target tasks can be calculated; when the target task can be calculated, it indicates that the executor has completed the target task at this time. Thereby enabling a more reasonable and accurate determination of whether the performer has completed the target task.
Example two
In this embodiment, referring to fig. 2, an embodiment of a task confirmation completion method based on a secret sharing algorithm is provided, including:
Step 210, obtaining at least one target subtask, and executing the target subtask to obtain a first secret share corresponding to the target subtask.
In this embodiment, before executing the target subtask, the executor needs to acquire the target subtask sent by the initiator; the executor can acquire random target subtasks and also acquire executed target subtasks. After the executor acquires the target subtask, the executor executes the acquired target subtask, and after the execution of the target subtask is completed, the executor acquires a first secret share corresponding to the target subtask.
In this embodiment, an executor may acquire one target subtask at the same time, or may acquire a plurality of target subtasks at the same time; the present invention is not particularly limited herein.
Step 220, generating a certificate request for completing the task based on the first secret share, and sending the first secret share and the certificate request to an authenticator.
After the executor executes the target subtask and obtains the first secret share corresponding to the target subtask, the executor generates a certificate request for completing the task, wherein the certificate request for completing the task comprises a task initiator, a task executor, specific steps in the completed task, certificate aging and other relevant information. In order to generate a certificate of the completion of the target task corresponding to the target subtask, the executor sends a first secret share and a certificate request to an authenticator, so that the authenticator calculates a first secret key according to the first secret share, the authenticator obtains a second secret share from other authenticators to calculate a second secret key, and finally, the first secret key and the second secret key are used for synthesizing the secret key, and the secret key is used for signing the certificate of the completion of the task to confirm that the target task has been executed.
In this embodiment, at least one target subtask is obtained, and the target subtask is executed to obtain a first secret share corresponding to the target subtask; and generating a certificate request for completing the task based on the first secret share, and sending the first secret share and the certificate request to an authenticator. In the embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the task certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
It should be understood that, although the steps in the flowchart of fig. 2 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 2 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or other steps.
Example III
In this embodiment, referring to fig. 5, an embodiment of a task confirmation completion method based on a secret sharing algorithm is provided, including:
step 510, receiving a first secret share and a certificate request sent by an executor, where the certificate request is a task completed certificate request.
In this embodiment, the initiator obtains the target task and the key corresponding to the target task, divides the key into a first key and a second key, then uses a first preset secret sharing algorithm to divide the secret share of the first key to obtain at least two first secret shares, and finally sends the first secret shares to the executor. After the executor executes the target subtask corresponding to the target task, the executor obtains a first secret share corresponding to the target subtask, generates a certificate request for completing the corresponding task, and finally sends the first secret share and the certificate request for completing the task to the authenticator. At this time, the authentication party receives a first secret share and a certificate request sent by the executor, wherein the certificate request is a certificate request for completing a task; the credential request includes the task initiator, the task executor, specific steps in the completed task, credential aging, and other relevant information.
Step 520, obtain the second secret share sent.
In this embodiment, the authenticators may include a master authenticator and other authenticators, where the master authenticator may be one of the authenticators or may be a third party authorized by all authenticators. The master authenticator obtains a second secret share sent by other authenticators, and specifically:
the second secret share is obtained by dividing the secret share of the second secret key which is divided by the secret key corresponding to the target task through a second preset secret sharing algorithm by the initiator. After the authenticator receives the second secret share sent by the initiator, the authenticator can send the corresponding second secret share to the master authenticator according to confirming whether the task executed by the performer is completed. When the authenticator sends its second secret share to the master authenticator, the master authenticator can obtain the second secret shares sent by the other authenticators. At this time, if the master authenticator has a corresponding second secret share, the master authenticator will also acquire its own corresponding second secret share to form a second secret share set.
In one embodiment, the master authenticator obtains the second secret share by receiving the second secret share sent by the initiator.
In step 530, a first key is calculated using the first secret fraction, and a second key is calculated using the second secret fraction.
After the authenticator obtains the first secret share and the second secret share, the authenticator calculates a first key according to the first secret share, and further calculates a second key according to the second secret share, for example:
1. a first key is calculated from the first secret share.
Determining to acquire k first secret shares, and constructing a polynomial equation set according to the k first secret shares, for example: when k first secret shares are obtained as、、、...、The method comprises the steps of carrying out a first treatment on the surface of the Constructing a polynomial +.>：
Wherein the method comprises the steps ofFor the first key->、、...、Is a coefficient.
Will respectively、、、...、Substitution polynomial +.>In (3) forming a system of equations for the polynomial:
with matrix multiplication or Lagrangel interpolationI.e. to solve the first key.
2. A second key is calculated from the second secret fraction.
Similarly, determining to acquire k second secret shares, and constructing a polynomial equation set according to the k second secret shares, for example: when k second secret shares are obtained as follows、、、...、The method comprises the steps of carrying out a first treatment on the surface of the Constructing a polynomial +.>：
Wherein the method comprises the steps ofFor the second key->、、...、Is a coefficient.
Will respectively、、、...、Substitution polynomial +.>In (3) forming a system of equations for the polynomial:
With matrix multiplication or Lagrangel interpolationI.e. to solve the second key.
Step 540, obtain the completion task certificate corresponding to the target task of the initiator.
In this embodiment, since the authenticator needs to confirm whether the target task has been completed according to the completion task certificate corresponding to the target task, the authenticator needs to obtain the completion task certificate corresponding to the target task of the initiator. Specifically, a certificate request sent by an executor is acquired, and the certificate request is analyzed to obtain a task initiator, a task executor, specific steps in a completed task, certificate aging and other relevant information. And further, acquiring a task completion certificate corresponding to the target task of the initiator according to the task initiator, the task executor, the specific steps in the completed task, certificate aging and other relevant information, wherein the task completion certificate is used for verifying whether the executor completes the target subtasks corresponding to the task completion target.
In this embodiment, step 540 may be performed before step 550 or before step 510, which is not specifically limited herein.
Step 550, calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request.
After the first key and the second key are calculated, the authenticator obtains a preset synthesis calculation formula corresponding to a preset division calculation formula of the initiator for dividing the key into the first key and the second key before calculating the key, and then synthesizes the first key and the second key by using the preset synthesis calculation formula to obtain the key. Further, an encryption algorithm may be determined, and the completion task certificate may be signed in combination with the encryption algorithm and the key in response to a certificate request sent by the enforcer.
In this embodiment, a first secret share and a certificate request sent by an executor are received, where the certificate request is a certificate request for completing a task; acquiring a second secret share sent by other authenticators; calculating a first secret key by using the first secret share, and calculating a second secret key by using the second secret share; acquiring a completion task certificate corresponding to a target task of an initiator; and calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request. In the embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
It should be understood that, although the steps in the flowchart of fig. 5 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 5 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or other steps.
In one embodiment, said signing said completion task certificate with said key in response to said certificate request comprises:
2-1) carrying out hash processing on the certificate by using a hash algorithm to obtain a digest.
Since hash algorithms can map arbitrary lengths of data to fixed-length hash values, they are commonly used to quickly retrieve and verify the integrity of the data. In this embodiment, a hash algorithm is used to hash the certificate to obtain a corresponding unique hash value, where the unique hash value is the digest corresponding to the certificate.
In this embodiment, the hash algorithm may be any one of MD5, SHA-1, SHA-256 or SHA-3, and is not specifically limited herein.
2-2) signing the digest with the key in response to the certificate request.
In the embodiment, the hash algorithm is adopted to carry out hash processing on the certificate, so that the integrity of the data can be quickly searched and checked; and by using a hash algorithm, the integrity of the data and the source of the data can be ensured, so that the confidentiality and the reliability of the data are protected.
Example IV
In this embodiment, there is provided an embodiment of a task confirmation completion method based on a secret sharing algorithm, including:
in step 801, an initiator acquires a target task and a key corresponding to the target task.
In step 802, the initiator divides the target task into at least two target subtasks.
In step 803, the initiator divides the key into a first key and a second key using a preset division calculation formula.
In step 804, the initiator performs secret share division on the first key by using a first preset secret sharing algorithm to obtain at least two first secret shares.
In step 805, the initiator performs secret sharing on the second key by using a second preset secret sharing algorithm to obtain at least two second secret shares.
In step 806, the initiator allocates the first secret share to each of the target subtasks, where when the target subtasks are completed, the executor obtains the corresponding first secret share.
Step 807, the initiator sends the target subtask to at least two executors and the second secret share to at least two authenticators.
In this embodiment, steps 801 to 807 are similar to steps 110 to 170 in the above embodiment, and are not repeated here.
Step 808, the executor obtains at least one target subtask, and executes the target subtask to obtain a first secret share corresponding to the target subtask.
Step 809, the executor generates a certificate request for task completion based on the first secret share, and sends the first secret share and the certificate request to the authenticator.
In this embodiment, steps 808 to 809 are similar to steps 210 and 220 in the above embodiment, and are not repeated here.
In step 810, the authenticator receives a first secret share and a credential request sent by the performer, the credential request being a task completed credential request.
Step 811, authenticating Fang Huoqu the second secret share.
Step 812, the authenticator calculates a first key using the first secret share and calculates a second key using the second secret share.
Step 813, the authenticator obtains a completion task certificate corresponding to the target task of the initiator.
In step 814, the authenticator calculates a key according to the first key and the second key, and signs the task completion certificate with the key in response to the certificate request.
In this embodiment, steps 810 to 814 are similar to steps 510 to 550 in the above embodiment, and are not repeated here.
Example five
Task management is the process of managing the entire lifecycle of a task. It relates to planning, testing, and sum-most reporting. Tasks may be performed by individuals or groups. The secret sharing idea is to split the secret in a proper way, each split share is managed by different participants, a single participant cannot recover the secret information, and only a plurality of participants cooperate together to recover the secret information. More importantly, the secret can still be fully recovered when there is a problem with the participants in any of the respective ranges.
The secret sharing is a shamir algorithm which is based on Lagrange interpolation and a vector method, and the basic idea is that a distributor decomposes a secret S into n secrets through a secret polynomial and distributes the n secrets to a holder, wherein any one of the k secrets can recover ciphertext, and any information of the secret cannot be obtained from any one of the k secrets. The algorithm encryption and decryption principles are as follows.
1> encryption principle:
for the plaintext s E Zp to be encrypted (p is a large prime number), k-1 random numbers are chosen from the finite group GF (p)，，...，And let->Thereby constructing a polynomial as follows：
Wherein,is public key (L)>、、...、Is a coefficient.
For this polynomial, n is taken、、、...、Respectively substituting the n pieces of polynomials to obtain n pieces of +>The n key pairs are distributed to n holders.
2> decryption principle:
suppose that k key pairs are obtained，，...，We can get the following equation operationsGF(p)：
By matrix multiplication or Lagrange interpolation>I.e. plaintext s.
In this embodiment, a method for completing task confirmation based on a secret sharing algorithm is provided, including:
step 1, a task initiator issues a target task, the target task is composed of n steps (n > 1), and completion of t (t < = n) steps can judge that the task is completed; the target task types are as follows: the props are collected in the game, a plurality of access points in the location based service (Location Based Service-LBS) are punched, and a customer completes browsing, purchasing, collecting a plurality of target tasks and the like on an e-commerce platform.
The target task requires p distributed authenticators, where r person signatures can complete authentication (r < = p). Selecting a master authenticator which may be a member of the above authenticators or other trusted third party
And 2, generating an asymmetric public and private key pair by the task initiator, wherein the private key is the secret sec.
In the present embodiment, the sec is divided into two parts (sec 1 and sec 2), and the dividing method is not limited, but to ensure that the safety and feasibility are balanced in a specific use scenario, the possibility of error occurrence is reduced, and the method should be reversible, i.e. the original sec can be generated reversely through the two parts. For example, all the odd bits in sec may be extracted, with the even bits randomly replaced; all even bits in sec are extracted and odd bits are randomly replaced. sec1 is distributed as a secret to the steps in the task; sec2 is distributed as a secret to the third party authenticator.
Specifically, sec1 is divided into n secret shares, and is assigned to each step in the task using a secret sharing method, each step being assigned m secret shares (one secret share is described below). sec2 is divided into p shares of secret shares, and is distributed to each third party authenticator using a secret sharing method; each authenticator is assigned +. >Share of secret (one share of secret is the following +.>）。
Wherein the total number of shares of the secret of t steps is the minimumThe method comprises the steps of carrying out a first treatment on the surface of the The total minimum value of the secret shares of r authenticators is +.>. Taking sec1 as an example, the secret sharing method is as follows:
constructing a secret polynomial as described above, the polynomial being unitaryThe power equation is to take q +.>、...Bringing a polynomial, secret ++>(i.e., sec 1) into q (q)>=n) secret shares->，，...，. Task initiationThe person will be->（1<=i<=n) secret shares are assigned to each task step, so that +.>，Is determined by the task weight of each step (if the weights are the same +.>=1), the larger the weight the larger the m value, the sum of the m values of the t tasks being。/>
Step 3, obtaining each time the task executor completes a taskPersonal secret share->。
After the task executor obtains L secret shares for t steps (complete t steps,) Decomposing the above-mentioned unary->The square equation is obtained by matrix multiplication or Lagrange interpolation>I.e., sec1. The task executor returns the completed task certificate application and sec1 to the main authentication party, and the application content comprises: task initiator, task executor, specific steps in completed task, certificate age and other relevant information;
And step 4, the authentication party confirms the task completion condition, and if the requirement is met, the authentication party contributes own secret share to the master verifier.
In this embodiment, the master verifier can recover the secret Sec2 if it obtains a sufficient secret share; the master verifier merges Sec1 and Sec2 to recover Sec (private key) and signs the certificate with the private key.
In this embodiment, the intended effects that can be achieved include:
1. the secret key is divided into a first secret share and a second secret share, the first secret share and the second secret share are respectively sent to an executor and an authenticator, so that the executor executes a task and sends the corresponding first secret share to the authenticator, and the authenticator signs a completion certificate of a target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
2. The method solves the problem that some tasks may comprise a plurality of parts, and the completion of one part can be considered to be the completion of the task, so that the user cannot start to formulate which parts are specifically completed in the task certificate; further, a task executor has been determined before the task is executed, and a certificate cannot be written in advance for the randomly determined executor.
Example six
In this embodiment, as shown in fig. 3, a task confirmation completion device based on a secret sharing algorithm is provided, including: a first acquisition module 310, a first division module 320, a second division module 330, a third division module 340, a fourth division module 350, an allocation module 360, and a first transmission module 370.
The first obtaining module 310 is configured to obtain a target task and a key corresponding to the target task.
A first dividing module 320, configured to divide the target task into at least two target subtasks.
The second dividing module 330 is configured to divide the key into a first key and a second key by using a preset division calculation formula.
The third dividing module 340 is configured to divide the first secret key by using a first preset secret sharing algorithm to obtain at least two first secret shares.
The fourth dividing module 350 is configured to divide the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares.
An allocation module 360, configured to allocate the first secret share to each of the target subtasks, where when the target subtasks are completed, an executor obtains the corresponding first secret share.
A first sending module 370, configured to send the target subtask to at least two executors, and send the second secret share to at least two authenticators.
In this embodiment, the first obtaining module 310 obtains a target task and a key corresponding to the target task; sending the target task to the first partitioning module 320; the key is sent to the second partitioning module 330. The first dividing module 320 divides the target task into at least two target subtasks; the target subtask is sent to the first sending module 370. The second division module 330 divides the key into a first key and a second key using a preset division calculation formula; sending the first key to the third partitioning module 340; the second key is sent to the fourth partitioning module 350. The third dividing module 340 performs secret share division on the first key by using a first preset secret sharing algorithm to obtain at least two first secret shares; the first secret share is sent to the distribution module 360. The fourth dividing module 350 divides the second secret key into at least two second secret shares by using a second preset secret sharing algorithm; the second secret share is sent to the first sending module 370. The distribution module 360 distributes the first secret share to each of the target subtasks, where when the target subtasks are completed, an executor will obtain the corresponding first secret share; the target subtask to which the first secret share is allocated is sent to the first sending module 370. The first sending module 370 sends the target subtask to at least two executors and the second secret share to at least two authenticators. In this embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
In one embodiment, the assignment module 360 may include: a determining unit and an allocating unit.
And the determining unit is used for determining the weight of each target subtask.
And the distribution unit is used for distributing the first secret share to each target subtask according to the weight.
Example seven
In this embodiment, as shown in fig. 6, a task confirmation completion device based on a secret sharing algorithm is provided, including: a second acquisition module 610 and a second transmission module 620.
The second obtaining module 610 is configured to obtain at least one target subtask, and execute the target subtask to obtain a first secret share corresponding to the target subtask.
A second sending module 620, configured to generate a certificate request for task completion based on the first secret share, and send the first secret share and the certificate request to an authenticator.
In this embodiment, the second obtaining module 610 obtains at least one target subtask, and executes the target subtask to obtain a first secret share corresponding to the target subtask; the first secret share is sent to the second sending module 620. The second sending module 620 generates a credential request for completion of the task based on the first secret share and sends the first secret share and the credential request to the authenticator. In this embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
Example eight
In this embodiment, as shown in fig. 7, a task confirmation completion device based on a secret sharing algorithm is provided, including: a second acquisition module 710, a receiving module 720, a computing module 730, a third acquisition module 740, and a signing module 750.
A second obtaining module 710, configured to obtain a second secret share.
The receiving module 720 is configured to receive a first secret share and a certificate request sent by an executor, where the certificate request is a task completed certificate request.
A calculating module 730, configured to calculate a first key using the first secret share and calculate a second key using the second secret share.
And a third obtaining module 740, configured to obtain a task completion certificate corresponding to the target task of the initiator.
And a signature module 750, configured to calculate a key according to the first key and the second key, and sign the task completion certificate with the key in response to the certificate request.
In this embodiment, the second obtaining module 710 obtains a second secret share; the second secret share is sent to the calculation module 730. The receiving module 720 receives a first secret share and a certificate request sent by an executor, wherein the certificate request is a task completed certificate request; sending the first secret share to the computing module 730; the certificate request is sent to the signature module 750. The calculation module 730 calculates a first key using the first secret share and calculates a second key using the second secret share; the first key and the second key are sent to the signature module 750. The third obtaining module 740 obtains a task completion certificate corresponding to the target task of the initiator; the completion task certificate is sent to the signature module 750. The signing module 750 calculates a key from the first key and the second key, and signs the task completion certificate with the key in response to the certificate request. In this embodiment, the secret key is divided into the first secret share and the second secret share, and the first secret share and the second secret share are respectively sent to the executor and the authenticator, so that the executor executes the task and sends the corresponding first secret share to the authenticator, and the authenticator signs the completion certificate of the target task according to the first secret share and the second secret share. The task completion confirmation is simpler, and the accuracy of the task completion confirmation is improved.
In one embodiment, signature module 750 may include: a processing unit and a signing unit.
And the processing unit is used for carrying out hash processing on the task completion certificate by using a hash algorithm to obtain a digest.
And the signature unit is used for signing the digest by utilizing the secret key to respond to the certificate request.
For specific limitations on the task confirmation completion device based on the secret sharing algorithm, reference may be made to the above limitation on the task confirmation completion method based on the secret sharing algorithm, and the description thereof will not be repeated here. The respective units in the above-described task confirmation completion apparatus based on the secret sharing algorithm may be implemented in whole or in part by software, hardware, and combinations thereof. The units can be embedded in hardware or independent of a processor in the computer equipment, and can also be stored in a memory in the computer equipment in a software mode, so that the processor can call and execute the operations corresponding to the units.
Example nine
In this embodiment, a computer device is provided. The internal structure thereof can be shown in fig. 4. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program, and the non-volatile storage medium is deployed with a database for storing all relevant data involved in a secret sharing algorithm-based task validation completion method. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the computer device is used to communicate with other computer devices in which application software is deployed. The computer program, when executed by the processor, implements a task validation completion method based on a secret sharing algorithm. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the structures shown in FIG. 4 are block diagrams only and do not constitute a limitation of the computer device on which the present aspects apply, and that a particular computer device may include more or less components than those shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a computer device is provided, including a memory storing a computer program and a processor implementing the steps of the secret sharing algorithm-based task confirmation completion method described in any of the embodiments above when the processor executes the computer program.
Examples ten
In this embodiment, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the secret sharing algorithm-based task confirmation completion method described in any of the above embodiments.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples merely represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.

Claims (10)

1. A method for task validation completion based on a secret sharing algorithm, comprising:
acquiring a target task and a secret key corresponding to the target task;
dividing the target task into at least two target subtasks;
dividing the key into a first key and a second key by using a preset division calculation formula;
dividing the first secret key by using a first preset secret sharing algorithm to obtain at least two first secret shares;
Dividing the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares;
distributing the first secret share to each target subtask, wherein when the target subtask is completed, an executor obtains the corresponding first secret share;
and sending the target subtask to at least two executors and sending the second secret share to at least two authenticators.
2. The method of claim 1, wherein said assigning the first secret share to each of the target subtasks comprises:
determining the weight of each target subtask;
and distributing the first secret share to each target subtask according to the weight.
3. A method for task validation completion based on a secret sharing algorithm, comprising:
acquiring at least one target subtask, and executing the target subtask to obtain a first secret share corresponding to the target subtask;
and generating a certificate request for completing the task based on the first secret share, and sending the first secret share and the certificate request to an authenticator.
4. A method for task validation completion based on a secret sharing algorithm, comprising:
receiving a first secret share and a certificate request sent by an executor, wherein the certificate request is a certificate request for completing a task;
acquiring a second secret share;
calculating a first secret key by using the first secret share, and calculating a second secret key by using the second secret share;
acquiring a completion task certificate corresponding to a target task of an initiator;
and calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request.
5. The method of claim 4, wherein signing the completion task certificate with the key in response to the certificate request comprises:
carrying out hash processing on the completed task certificate by using a hash algorithm to obtain a summary;
the digest is signed with the key in response to the certificate request.
6. A task confirmation completion device based on a secret sharing algorithm, comprising:
the first acquisition module is used for acquiring a target task and a secret key corresponding to the target task;
The first dividing module is used for dividing the target task into at least two target subtasks;
the second dividing module is used for dividing the secret key into a first secret key and a second secret key by utilizing a preset dividing calculation formula;
the third dividing module is used for dividing the secret share of the first secret key by utilizing a first preset secret sharing algorithm to obtain at least two first secret shares;
the fourth dividing module is used for dividing the secret share of the second secret key by using a second preset secret sharing algorithm to obtain at least two second secret shares;
the distribution module is used for distributing the first secret share to each target subtask, wherein when the target subtask is completed, an executor obtains the corresponding first secret share;
and the first sending module is used for sending the target subtask to at least two executors and sending the second secret share to at least two authenticators.
7. A task confirmation completion device based on a secret sharing algorithm, comprising:
the second acquisition module is used for acquiring at least one target subtask and executing the target subtask to obtain a first secret share corresponding to the target subtask;
And the second sending module is used for generating a certificate request for completing the task based on the first secret share and sending the first secret share and the certificate request to an authenticator.
8. A task confirmation completion device based on a secret sharing algorithm, comprising:
the second acquisition module is used for acquiring a second secret share;
the receiving module is used for receiving a first secret share and a certificate request sent by an executor, wherein the certificate request is a certificate request for completing a task;
the computing module is used for computing a first secret key by using the first secret share and computing a second secret key by using the second secret share;
the third acquisition module is used for acquiring a task completion certificate corresponding to the target task of the initiator;
and the signature module is used for calculating a key according to the first key and the second key, and signing the task completion certificate by using the key to respond to the certificate request.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any one of claims 1 to 5 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 5.
CN202410223785.2A 2024-02-29 2024-02-29 Task confirmation completion method and related device based on secret sharing algorithm Active CN117811733B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410223785.2A CN117811733B (en) 2024-02-29 2024-02-29 Task confirmation completion method and related device based on secret sharing algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410223785.2A CN117811733B (en) 2024-02-29 2024-02-29 Task confirmation completion method and related device based on secret sharing algorithm

Publications (2)

Publication Number Publication Date
CN117811733A true CN117811733A (en) 2024-04-02
CN117811733B CN117811733B (en) 2024-07-09

Family

ID=90425918

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410223785.2A Active CN117811733B (en) 2024-02-29 2024-02-29 Task confirmation completion method and related device based on secret sharing algorithm

Country Status (1)

Country Link
CN (1) CN117811733B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118037017A (en) * 2024-04-15 2024-05-14 浙江毫微米科技有限公司 Method and device for confirming completion of task, computer equipment and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130275776A1 (en) * 2011-12-12 2013-10-17 Cleversafe, Inc. Encrypting distributed computing data
CN110391912A (en) * 2019-07-26 2019-10-29 南方电网科学研究院有限责任公司 Distributed evaluation decision method and system based on secret sharing mechanism
CN112700152A (en) * 2021-01-06 2021-04-23 南方电网科学研究院有限责任公司 Hierarchical safe multi-party computing method and device based on Chinese remainder theorem
CN114139194A (en) * 2021-11-10 2022-03-04 北京理工大学 Privacy protection task allocation method based on task content
CN115804059A (en) * 2020-06-15 2023-03-14 区块链许可股份公司 Generating secret shares
CN116208317A (en) * 2023-05-05 2023-06-02 上海芯联芯智能科技有限公司 Method for resisting side channel attack and encryption and decryption device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130275776A1 (en) * 2011-12-12 2013-10-17 Cleversafe, Inc. Encrypting distributed computing data
CN110391912A (en) * 2019-07-26 2019-10-29 南方电网科学研究院有限责任公司 Distributed evaluation decision method and system based on secret sharing mechanism
CN115804059A (en) * 2020-06-15 2023-03-14 区块链许可股份公司 Generating secret shares
CN112700152A (en) * 2021-01-06 2021-04-23 南方电网科学研究院有限责任公司 Hierarchical safe multi-party computing method and device based on Chinese remainder theorem
CN114139194A (en) * 2021-11-10 2022-03-04 北京理工大学 Privacy protection task allocation method based on task content
CN116208317A (en) * 2023-05-05 2023-06-02 上海芯联芯智能科技有限公司 Method for resisting side channel attack and encryption and decryption device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
王海艳;王汝传;: "基于密钥分割的多移动代理系统安全性研究", 电子与信息学报, no. 03, 20 March 2006 (2006-03-20) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118037017A (en) * 2024-04-15 2024-05-14 浙江毫微米科技有限公司 Method and device for confirming completion of task, computer equipment and storage medium
CN118037017B (en) * 2024-04-15 2024-07-16 浙江毫微米科技有限公司 Method and device for confirming completion of task, computer equipment and storage medium

Also Published As

Publication number Publication date
CN117811733B (en) 2024-07-09

Similar Documents

Publication Publication Date Title
Hao et al. A multiple-replica remote data possession checking protocol with public verifiability
Wang et al. Certificateless public auditing for data integrity in the cloud
Wang et al. Oruta: Privacy-preserving public auditing for shared data in the cloud
Kumar et al. An efficient and secure protocol for ensuring data storage security in cloud computing
CN117811733B (en) Task confirmation completion method and related device based on secret sharing algorithm
CN110637441A (en) Encryption key generation for data deduplication
JP5957095B2 (en) Tamper detection device, tamper detection method, and program
JP2023133560A (en) Computer-implemented voting process and system
CN103718500A (en) Credential validation
KR20150048827A (en) Input consistency verification for two-party secure function evaluation
Hahn et al. Enabling fast public auditing and data dynamics in cloud services
CN104012036B (en) Combined type digital certificate
Singh et al. Optimized public auditing and data dynamics for data storage security in cloud computing
WO2020240654A1 (en) Anonymized signature system, signature generation device, anonymized signature generation device, verification device, anonymized signature method and program
CN111291122B (en) Bidding method and device based on block chain
US20220292174A1 (en) Verifiability for execution in trusted execution environment
CN115001730A (en) Role attribute-based access control system and method in distributed scene
CN111404685B (en) Attribute-based signature method and system
JP2022549777A (en) Partition of requests to blockchain transactions
CN112165383A (en) Encryption method, device, equipment and medium based on shared root key
CN114257373B (en) Method, system, computer equipment and medium for managing mixed encryption system key storage
Yarava et al. Efficient and Secure Cloud Storage Auditing Based on the Diffie-Hellman Key Exchange.
CN113094735B (en) Privacy model training method
CN113792282B (en) Identity data verification method and device, computer equipment and storage medium
JP2024532747A (en) Generate a digital signature share

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant