CN104717057B - A kind of privacy sharing method and secret sharing systems - Google Patents

A kind of privacy sharing method and secret sharing systems Download PDF

Info

Publication number
CN104717057B
CN104717057B CN201310687123.2A CN201310687123A CN104717057B CN 104717057 B CN104717057 B CN 104717057B CN 201310687123 A CN201310687123 A CN 201310687123A CN 104717057 B CN104717057 B CN 104717057B
Authority
CN
China
Prior art keywords
secret
sub
sequence
secret sequence
shared
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201310687123.2A
Other languages
Chinese (zh)
Other versions
CN104717057A (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.)
China Mobile Communications Group Co Ltd
Original Assignee
China Mobile Communications Group 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 China Mobile Communications Group Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN201310687123.2A priority Critical patent/CN104717057B/en
Publication of CN104717057A publication Critical patent/CN104717057A/en
Application granted granted Critical
Publication of CN104717057B publication Critical patent/CN104717057B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a kind of privacy sharing methods and secret sharing systems, this method to include：Determine the corresponding binary system secret sequence of secret to be shared；According to the secret sequence and shared number of users t, the binary system sub-secret sequence of s inequality of generation；Wherein, the sub-secret sequence is identical with the secret sequence digit, and at least there are 1 difference, s >=t with the secret sequence for the sub-secret sequence；The sub-secret sequence is distributed according to the quantity s of the sub-secret sequence and shared number of users t.In the present invention, flexibility, controllability and the non-repudiation of privacy sharing are improved.

Description

A kind of privacy sharing method and secret sharing systems
Technical field
The present invention relates to field of communication technology more particularly to a kind of privacy sharing method and secret sharing systems.
Background technology
With the rapid development of computer network and the communication technology, information security issue becomes increasingly conspicuous.Contemporary cryptology skill Art all plays an important roll in terms of the confidentiality of information, integrality, availability, reliability and non-repudiation is ensured.Wherein, Privacy sharing mechanism is a core of Password Management mechanism and decentralization power mechanism.
For current computer system and communication system, substantial amounts of confidential information is stored in the form of document to be counted In calculation machine, and them are deprotected using different keys according to different type and level of confidentiality, generally for substantial amounts of convenient for managing Key, the whole keys used may there are one master keys again to protect.Cause the safety for storing all information in systems It may finally depend on a master key.Master key becomes the safety-critical point of whole system, if giving individual one by it A administrator keeping, the drawbacks of some may being caused to be difficult to overcome.First, this administrator will have close with his master of keeping The same security-sensitive of key is, it is necessary to lay special stress on protecting, if lost beyond the master key of his keeping or himself meets with accident, Then whole system can not may be used just.Secondly, the personal quality of this administrator will become the loyalty of tissue with him The key of system safety, if he is actively leaked to other people for certain interests and by his master key of keeping, it will harm is whole The safety of a system.
Can solution to the problems described above be known as privacy sharing, secret herein includes but not limited to password, message, text Part information, communication information etc., it is by a secret information（Including master key etc.）Progress fraction point duty handles to obtain multiple Sub-secret, and multiple tissues or user is transferred to take care of jointly respectively multiple sub-secrets, and also only multiple tissues or user will When the share of oneself is all put together, shared secret can be recovered, otherwise can not recover secret.Privacy sharing one Aspect is conducive to prevent the excessive centralization of power, on the other hand can ensure secret security and integrality.
By the literature search to the prior art and the study found that Chinese Patent Application No. 200980104729.0, patent Title " disperses the system and method protected to data " using multifactor or key formula, it is proposed that a kind of secure data parsing Device, the secure data parser are desirably integrated into for secure storage and transmit in any appropriate system of data.The safe number Data parse according to resolver then by data splitting into different ways store or transmit multiple portions.In order to additional The encryption of initial data, the encryption of data portion or the two may be employed in security.The secure data parser can be used for leading to Crossing to split into initial data multiple data portions of multiple communication path transmission can be used to protect moving medial evidence.It can be with It uses key formula information dispersal algorithm (key Formulas I DA).In addition, it can protect key Formulas I DA's by external workgroup key Key, so as to generate multifactor secret sharing scheme.But the password splitting technique employed in this method be by data according to Data unit size pattern, sequence or combination predetermined or randomly generate are divided and are distributed, and are only based on data Length on grouping division so as to achieve the purpose that password divide, with certain limitation.
The content of the invention
The embodiment of the present invention provides a kind of privacy sharing method and secret sharing systems, to improve the flexible of privacy sharing Property, controllability and non-repudiation.
In order to achieve the above object, the embodiment of the present invention provides a kind of privacy sharing method, including：
Determine the corresponding binary system secret sequence of secret to be shared；
According to the secret sequence and shared number of users t, the binary system sub-secret sequence of s inequality of generation；Wherein, institute It is identical with the secret sequence digit to state sub-secret sequence, and at least there are 1 with the secret sequence for the sub-secret sequence Difference, s >=t；
The sub-secret sequence is distributed according to the quantity s of the sub-secret sequence and shared number of users t.
The embodiment of the present invention additionally provides a kind of secret sharing systems, including：
Determination unit, for determining the corresponding binary system secret sequence of secret to be shared；
Generation unit, for according to the secret sequence and shared number of users t, binary system for generating s inequality to be secret Close sequence；Wherein, the sub-secret sequence is identical with the secret sequence digit, and the sub-secret sequence and the secret sequence At least there are 1 difference, s >=t for row；
Dispatching Unit, for the quantity s according to the sub-secret sequence and shared number of users t to the sub-secret sequence It is distributed.
In the above embodiment of the present invention, by determining the corresponding binary system secret sequence of secret to be shared；According to described secret Close sequence and shared number of users t generate the binary system sub-secret sequence of s inequality；According to the quantity s of the sub-secret sequence And shared number of users t is distributed the sub-secret sequence, improves flexibility, controllability and the resisting denying of privacy sharing Property.
Description of the drawings
Fig. 1 is a kind of flow diagram of privacy sharing method provided in an embodiment of the present invention；
Fig. 2 is a kind of flow diagram of privacy sharing method provided in an embodiment of the present invention；
Fig. 3 is a kind of idiographic flow schematic diagram of shared key generation provided in an embodiment of the present invention；
Fig. 4 is a kind of structure diagram of secret sharing systems provided in an embodiment of the present invention.
Specific embodiment
The embodiment of the present invention provides a kind of technical solution of the privacy sharing under bit arithmetic based on binary system secret sequence. In the technical scheme, sub-secret sequence during privacy sharing is carried out as secret sequence M using non-M sequence, to extend secret The application range of secret sharing improves flexibility, controllability and the non-repudiation of privacy sharing.
Wherein, in embodiments of the present invention, secret sequence is to need the corresponding binary sequence of secret to be sharing（It will need Secret to be sharing is converted to binary system）, non-M sequence（That is sub-secret sequence）It is identical with secret sequence M for digit, but at least deposit In a different binary sequence.
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear Chu, complete description, it is clear that the embodiments described below are only the reality of part of the embodiment of the present invention rather than whole Apply example.Based on the embodiments of the present invention, those of ordinary skill in the art are obtained under the premise of not making the creative labor Every other embodiment, belong to the embodiment of the present invention protection scope.
As shown in Figure 1, for a kind of flow diagram of privacy sharing method provided in an embodiment of the present invention, can include：
Step 101 determines the corresponding binary system secret sequence of secret to be shared.
Specifically, in embodiments of the present invention, in order to realize privacy sharing, it is necessary to by secret to be shared be converted to two into The secret sequence of system, and then the sub-secret sequence that uses when generating privacy sharing according to the secret sequence.
Step 102, according to the secret sequence and shared number of users t, generate the binary system sub-secret sequence of s inequality Row.
Specifically, in embodiments of the present invention, it is determined that, it is necessary to root after the corresponding binary system secret sequence of secret to be shared According to preset shared number of users t（It can be set according to concrete application scene）, generation s（s≥t）The binary system of inequality Sub-secret sequence.
Wherein, the sub-secret sequence is identical with the digit of secret sequence, and at least there are 1 with secret sequence for sub-secret sequence Position is different, and unique secret sequence can be determined according to the binary system sub-secret sequence of the s inequality.
In the embodiment of the present invention, the detailed process that sub-secret sequence is generated according to secret sequence can be as follows：
A, according to shared number of users t, when determining generation sub-secret sequence, which needs the total of changed position Several minimum value k.
Specifically, in order to ensure that the shared user of privacy sharing at least distributes there are one sub-secret sequence, of the invention real It applies in example, the quantity of the sub-secret sequence of generation cannot be less than shared number of users.And since sub-secret sequence is by secret sequence What at least 1 of row changed, therefore, in order to generate at least t sub- secret sequences, secret sequence needs become The total N of the position of change needs to meet the following formula：
2N-1≥t
That is, N >=log2（t+1）
Therefore, in order to generate at least t sub- secret sequences, secret sequence needs the minimum value of the sum of changed position K needs to meet：
Wherein,To round up to x.
The quantity of at least one sub-secret sequence obtained after changing is more than t in arbitrary k i.e. in secret sequence； It is arbitrary in secret sequence（k-1）The quantity of at least one sub-secret sequence obtained after changing is less than t in position.
For example, it is assumed that t=8, that is, need at least to generate 8 sub- secret sequences, then secret sequence needs changed position Sum minimum value beAt least there are 1 sub-secrets in sub-secret sequence i.e. in this case At least there are 4 differences with secret sequence for sequence.
B, the minimum value k of sum of the changed position as needed and total bit n of secret sequence, determines to wait to become The quantity r of the position of change；Wherein, n >=r >=k.
Specifically, in embodiments of the present invention, after determining to need the minimum value k of sum of changed position, in order to The flexibility of privacy sharing is further improved, occurs when actually generating sub-secret sequence, the more multidigit of secret sequence Variation, i.e., the quantity r of actual position to be changed can be more than the minimum value for the sum for needing changed position in secret sequence k。
C, the position of r positions to be changed in secret sequence in secret sequence is determined.
Specifically, it is necessary to further determine that the r positions to be changed after the quantity r of secret sequence position to be changed is determined Position in secret sequence（Can be arbitrary r in secret sequence n）.
D, the position according to r positions to be changed in secret sequence in secret sequence generates the sub-secret sequence of s inequality Row.
For example, it is assumed that the position of r positions to be changed in secret sequence in secret sequence is respectively the 1st, the 2nd ..., R, then in secret sequence in the r at least 1 change, the sub-secret sequence of s inequality can be generated altogether；Wherein：
S=2r-1
Step 103 carries out the sub-secret sequence according to the quantity s and shared number of users t of the sub-secret sequence Distribution.
Specifically, in embodiments of the present invention, when the sub-secret sequence of generation is distributed to shared user, it is necessary to ensure Each shared user's at least 1 sub- secret sequence（The sub-secret sequence inequality of each shared user）.
In order to reach the purpose, after s sub- secret sequences are generated, the s sub- secret sequences can all be distributed, And ensure that each shared user at least distributes there are one sub-secret sequence, and the sub-secret sequence inequality of each shared user（I.e. may There are the sub-secret sequences that shared user distribution has multiple inequalities）；Can also only 1 sub-secret sequence be distributed to each shared user Row, and ensure the sub-secret sequence inequality of each shared user.
In the previous case, the priority of shared user can be determined according to the actual information of shared user, and according to The priority of shared user distributes the sub-secret sequence, and the sub-secret sequence of the high shared user distribution of priority need to be no less than The sub-secret sequence of the low shared user distribution of priority.
In the later case, as s ＞ t, t can be selected from the s sub- secret sequences, and is distributed to respectively each Shared user, and preserve remaining sub-secret sequence.
It further, in embodiments of the present invention, can be according to above-mentioned s inequality when needing to carry out secret reconstruction Sub-secret sequence determines corresponding secret sequence.Wherein, the sub-secret sequence of the s inequality can be distributed to shared use Family or part be distributed to shared user, be partly saved in secret sharing systems.
The technical solution that embodiment provides for a better understanding of the present invention, with reference to concrete application scene to the present invention Embodiment is described below in greater detail.
As shown in Fig. 2, for a kind of flow diagram of privacy sharing method provided in an embodiment of the present invention, can include：
Step 201, arrange parameter-shared number of users t.
According to the needs of actual secret sharing scheme, the shared number of users t of privacy sharing is set, as input parameter into Row parameter setting.
Step 202, secret initialization：Secret to be shared is converted into binary system secret sequence.
Step 203, shared key generation：Generate sub-secret sequence.
Specifically, in embodiments of the present invention, the idiographic flow of shared key generation may refer to Fig. 3, can include with Lower step：
Step 2031, the minimum value k for calculating the sum for needing changed position.Since what is exported from step 201 is total to Amount is enjoyed as t, if ki is real number, then according to 2ki- 1=t, solvable equation obtain ki=log2(t+1)。
So need the minimum value k of the sum of changed position（K is integer）, value situation can divide according to the value of ki For two kinds of situations：（1）As ki=log2(t+1) be decimal when, then need to round up to it, therefore（2）As ki=log2(t+1) when being integer, then k=log2(t+1), and because for integer, Value in itself between the value that rounds up there are relation of equality, i.e.,Therefore can further obtain It arrivesTo sum up two kinds of situations, thenI.e.：Need changed position Sum minimum value k beNamely log2(t+1) result to round up.
Step 2032, the quantity r for determining position to be changed.
Specifically, step 2032 receives the output from step 2031, i.e. output needs the sum of changed position most Small value.Simultaneously as secret sequence is the binary sequence of n, therefore, total bit r's to be changed Value range is [k, n], i.e. k≤r≤n can make the quantity r that free burial ground for the destitute controls position to be changed by oneself within the scope of this.
Step 2033 determines the corresponding position in r positions to be changed.
Specifically, the quantity that position to be changed is exported by step 2032 is r, then secret for the binary system that digit is n Close sequence M=mn mn-1……m2m1（Wherein miEqual to 0 or 1）For, the selection scheme of position shares Cn rKind, i.e., from the 1st, 2, Appoint in 3 ... n-1, n and take the r selected correspondence positions as variation.Therefore, the corresponding position in r to be changed position be also can With self-defined control.Assuming that this r position, corresponds to α respectively1Position, α2Position ... αr-1Position, αrPosition, wherein α1< α2<……<αr-1<αr。
T step 2034, generation sub- secret sequences.
Specifically, the output from step 1023 being received due to step 2034 --- the corresponding position in r positions to be changed is α1Position, α2Position ... αr-1Position, αrPosition, wherein α1<α2<…… <αr-1<αr.For secret sequence M=mn mn-1…… m2m1, the constitution element of the sub-secret sequence M ' using non-M sequence as its privacy sharing, i.e. M '=mn’mn-1’……m2’m1', and Wherein mi' it is equal to 0 or 1, and at least there are a mi’≠miNamely in the n positions binary system of sub-secret sequence at least 1 with Originally the value of the corresponding position of secret sequence is different.
Therefore, it is α for r positions correspondence position to be changed1Position, α2Position ... αr-1Position, αrWhat position was formed Binary sequenceShare 2r- 1 different binary sequenceMake By the digit of n-r invariant positions and the r positions opsition dependent group of variation The binary sequence m of n is obtained after closingn’mn-1’……m2’m1', so as to obtain M=mn mn-1…… m2m1Sequence is in secret 2 under sharedr- 1 sub-secret is denoted as binary sequence SSM respectively1、 SSM2、SSM3、……、Together When this 2rThe set that -1 sub-secret is formed is denoted as sub-secret collection SSM_Set, therefore,
Free burial ground for the destitute control being made by oneself from SSM_Set set again and selecting t as sub-secret sequence carry out subsequent secret Distribution, this t sub-secret are denoted as SSM_Chosen respectively1、SSM_Chosen2、 SSM_Chosen3、……、SSM_ Chosent-1、SSM_Chosent, form set be denoted as SSM_Chosen therefore, SSM_Chosen={ SSM_Chosen1, SSM_Chosen2, And by remaining 2rThe element that -1-t sub-secrets are recovered as privacy sharing It is preserved with the backup element of follow-up secret distribution, this 2r- 1-t sub-secrets are denoted as SSM_UnChosen respectively1, SSM_ UnChosen2、 SSM_UnChosen3、……、 Its structure Into set be denoted as SSM_UnChosen_Set, therefore, SSM_UnChosen={ SSM_UnChosen1, Meanwhile there are following relations between above three set：SSM_ Chosen_Set+SSM_UnChosen_Set=SSM_Set.
To sum up, its privacy sharing method of step 2034 generation sub-secret is, it is necessary to be following three kinds of situations according to r, k and t points Analysis：（1）As r=k and log2(t+1) when being integer, then t sub- secret sequences is directly calculated, are exported to subsequent step 204 Distribute as secret；（2）As r=k and log2(t+1) be decimal when, then calculate 2k- 1 sub- secret sequence, and therefrom select t Input value progress secret distribution of a sub-secret as step 204, remaining 2kWhen -1-t sub-secrets sequence is used as secret reconstruction Element and secret distribution backup element, preserved；（3）Work as k<During r≤n, then 2r-1 sub- secret sequences are calculated, and It therefrom selects t sub- secret sequences and carries out secret distribution as the input value of step 204, remaining 2r-1-t sub-secrets are subject to It preserves, the backup element of element and secret distribution during for later stage secret reconstruction.
Step 204, secret distribution.
Secret distribution is carried out according to the result of step 203.The step receives the output SSM_Chosen_ from step 203 Set, and result is exported and is used as secret reconstruction to step 205.
Step 205, secret reconstruction.
The sub-secret sequence SSM_Chosen_Set and the remaining sub-secret SSM_ of storage distributed according to step 204 UnChosen_Set recovers secret sequence jointly.
It is to be shared secret by determining by above description as can be seen that in technical solution provided in an embodiment of the present invention Close corresponding binary system secret sequence；According to the secret sequence and shared number of users t, the binary system for generating s inequality is sub Secret sequence；The sub-secret sequence is distributed according to the quantity s of the sub-secret sequence and shared number of users t, is carried The high flexibility of privacy sharing, controllability and non-repudiation.
Based on the same inventive concept of the above method, additionally provide a kind of secret sharing systems in the embodiment of the present invention, It can be applied in above method embodiment.
As shown in figure 4, for a kind of structure diagram of secret sharing systems provided in an embodiment of the present invention, can include：
Determination unit 41, for determining the corresponding binary system secret sequence of secret to be shared；
Generation unit 42, for according to the secret sequence and shared number of users t, the binary system for generating s inequality to be sub Secret sequence；Wherein, the sub-secret sequence is identical with the secret sequence digit, and the sub-secret sequence and the secret At least there are 1 difference, s >=t for sequence；
Dispatching Unit 43, for the quantity s according to the sub-secret sequence and shared number of users t to the sub-secret sequence Row are distributed.
Wherein, the generation unit 42 is specifically used for,
According to the shared number of users t, when determining to generate the sub-secret sequence, the secret sequence needs change Position sum minimum value k；
The minimum value k of sum of the changed position and total bit n of the secret sequence is needed according to described, really The quantity r of position to be changed in the fixed secret sequence；Wherein, n >=r >=k；
Determine the position of r positions to be changed in the secret sequence in the secret sequence；
According to the position of r positions to be changed in the secret sequence in the secret sequence, s inequality of generation two into System secret sequence.
Wherein, the generation module 42 is specifically used for, and is realized according to the shared number of users t, determined by the following formula When generating the sub-secret sequence, the secret sequence needs the minimum value k of the quantity of changed position：
Wherein,To round up to x.
Wherein, the Dispatching Unit 43 is specifically used for, and the sub-secret sequence is distributed to shared user；Wherein, respectively The sub-secret sequence inequality that shared user is distributed, and each shared user at least distributes that there are one sub-secret sequences.
Wherein, the Dispatching Unit 43 is specifically used for, and as s ＞ t, is selected from the sub-secret sequence of the s inequality Go out the sub-secret sequence of t inequality；The sub-secret sequence selected is distributed to shared user, and preserves remaining sub-secret sequence Row；Wherein, sub-secret sequence there are one each distributions of each shared user, and the sub-secret sequence inequality.
Wherein, secret sharing systems provided in an embodiment of the present invention can also include：
Recovery unit 44, for when needing to carry out secret reconstruction, being determined pair according to the sub-secret sequence of the s inequality The secret sequence answered.
By the description of embodiment of above, those skilled in the art can be understood that the present invention can be by soft Part adds the mode of required general hardware platform to realize, naturally it is also possible to which by hardware, but the former is more preferably in many cases Embodiment.Based on such understanding, portion that technical scheme substantially in other words contributes to the prior art Dividing can be embodied in the form of software product, which is stored in a storage medium, including several Instruction is used so that a computer equipment（Can be personal computer, server or the network equipment etc.）Perform the present invention Method described in each embodiment.
It will be appreciated by those skilled in the art that attached drawing is the schematic diagram of a preferred embodiment, module or stream in attached drawing Journey is not necessarily implemented necessary to the present invention.
It will be appreciated by those skilled in the art that the module in device in embodiment can describe be distributed according to embodiment In the device of embodiment, respective change can also be carried out and be disposed other than in one or more devices of the present embodiment.Above-mentioned reality The module for applying example can be merged into a module, can also be further split into multiple submodule.
The embodiments of the present invention are for illustration only, do not represent the quality of embodiment.
Disclosed above is only several specific embodiments of the present invention, and still, the present invention is not limited to this, any ability What the technical staff in domain can think variation should all fall into protection scope of the present invention.

Claims (10)

  1. A kind of 1. privacy sharing method, which is characterized in that including：
    Determine the corresponding binary system secret sequence of secret to be shared；
    According to the secret sequence and shared number of users t, the binary system sub-secret sequence of s inequality of generation；Wherein, the son Secret sequence is identical with the secret sequence digit, and the sub-secret sequence and the secret sequence be at least there are 1 difference, s≥t；
    The sub-secret sequence is distributed according to the quantity s of the sub-secret sequence and shared number of users t；
    It is described according to the secret sequence and shared number of users t, generate the binary system sub-secret sequence of s inequality, specific bag It includes：
    According to the shared number of users t, when determining to generate the sub-secret sequence, the secret sequence needs changed position Sum minimum value k；
    The minimum value k of sum of the changed position and total bit n of the secret sequence is needed according to described, determines institute State the quantity r of position to be changed in secret sequence；Wherein, n >=r >=k；
    Determine the position of r positions to be changed in the secret sequence in the secret sequence；
    According to the position of r positions to be changed in the secret sequence in the secret sequence, the binary system for generating s inequality is sub Secret sequence.
  2. 2. the method as described in claim 1, which is characterized in that according to the shared number of users t, determine the generation sub-secret During sequence, the secret sequence needs the minimum value k of the quantity of changed position, is realized especially by the following formula：
    Wherein,To round up to x.
  3. 3. the method as described in claim 1, which is characterized in that the quantity s according to the sub-secret sequence and shared Number of users t is distributed the sub-secret sequence, is specially：
    The sub-secret sequence is distributed to shared user；Wherein, the sub-secret sequence inequality that each shared user is distributed, and it is each Shared user at least distributes there are one sub-secret sequence.
  4. 4. the method as described in claim 1, which is characterized in that the quantity according to the sub-secret sequence and shared use Amount is distributed the sub-secret sequence, is specially：
    As s ＞ t, the sub-secret sequence of t inequality is selected from the sub-secret sequence of the s inequality；
    The sub-secret sequence selected is distributed to shared user, and preserves remaining sub-secret sequence；Wherein, each shared user Sub-secret sequence that there are one each distributions, and the sub-secret sequence inequality.
  5. 5. the method as described in claim 1, which is characterized in that this method further includes：
    When needing to carry out secret reconstruction, corresponding secret sequence is determined according to the sub-secret sequence of the s inequality.
  6. 6. a kind of secret sharing systems, which is characterized in that including：
    Determination unit, for determining the corresponding binary system secret sequence of secret to be shared；
    Generation unit, for according to the secret sequence and shared number of users t, the binary system sub-secret sequence of s inequality of generation Row；Wherein, the sub-secret sequence is identical with the secret sequence digit, and the sub-secret sequence and the secret sequence are extremely There are 1 difference, s >=t less；
    Dispatching Unit carries out the sub-secret sequence for the quantity s according to the sub-secret sequence and shared number of users t Distribution；
    Wherein, the generation unit is specifically used for,
    According to the shared number of users t, when determining to generate the sub-secret sequence, the secret sequence needs changed position Sum minimum value k；
    The minimum value k of sum of the changed position and total bit n of the secret sequence is needed according to described, determines institute State the quantity r of position to be changed in secret sequence；Wherein, n >=r >=k；
    Determine the position of r positions to be changed in the secret sequence in the secret sequence；
    According to the position of r positions to be changed in the secret sequence in the secret sequence, the binary system for generating s inequality is sub Secret sequence.
  7. 7. secret sharing systems as claimed in claim 6, which is characterized in that the generation module is specifically used for, by following Formula is realized according to the shared number of users t, and when determining to generate the sub-secret sequence, the secret sequence needs change Position quantity minimum value k：
    Wherein,To round up to x.
  8. 8. secret sharing systems as claimed in claim 6, which is characterized in that
    The Dispatching Unit is specifically used for, and the sub-secret sequence is distributed to shared user；Wherein, each shared user is distributed Sub-secret sequence inequality, and each shared user at least distributes there are one sub-secret sequence.
  9. 9. secret sharing systems as claimed in claim 6, which is characterized in that
    The Dispatching Unit is specifically used for, and as s ＞ t, t inequality is selected from the sub-secret sequence of the s inequality Sub-secret sequence；The sub-secret sequence selected is distributed to shared user, and preserves remaining sub-secret sequence；Wherein, respectively Sub-secret sequence that there are one shared each distributions of user, and the sub-secret sequence inequality.
  10. 10. secret sharing systems as claimed in claim 6, which is characterized in that further include：
    Recovery unit, for when needing to carry out secret reconstruction, being determined according to the sub-secret sequence of the s inequality corresponding secret Close sequence.
CN201310687123.2A 2013-12-13 2013-12-13 A kind of privacy sharing method and secret sharing systems Active CN104717057B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310687123.2A CN104717057B (en) 2013-12-13 2013-12-13 A kind of privacy sharing method and secret sharing systems

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310687123.2A CN104717057B (en) 2013-12-13 2013-12-13 A kind of privacy sharing method and secret sharing systems

Publications (2)

Publication Number Publication Date
CN104717057A CN104717057A (en) 2015-06-17
CN104717057B true CN104717057B (en) 2018-06-05

Family

ID=53416055

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310687123.2A Active CN104717057B (en) 2013-12-13 2013-12-13 A kind of privacy sharing method and secret sharing systems

Country Status (1)

Country Link
CN (1) CN104717057B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105356999B (en) * 2015-12-08 2018-03-09 成都信息工程大学 A kind of portion size minishing method of (2,2) threshold secret sharing
CN107566121B (en) * 2016-11-18 2020-03-10 上海扈民区块链科技有限公司 Efficient secret consensus method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8243933B2 (en) * 2007-08-29 2012-08-14 Red Hat, Inc. Method for sharing secret information among cooperating parties

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8615084B2 (en) * 2008-05-29 2013-12-24 Red Hat, Inc. Extending a secret bit string to safeguard the secret
US9124423B2 (en) * 2010-05-14 2015-09-01 International Business Machines Corporation Iterative data secret-sharing transformation

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8243933B2 (en) * 2007-08-29 2012-08-14 Red Hat, Inc. Method for sharing secret information among cooperating parties

Also Published As

Publication number Publication date
CN104717057A (en) 2015-06-17

Similar Documents

Publication Publication Date Title
CN116670673A (en) Transferring cryptocurrency from a remote limited access wallet
CN107038383A (en) A kind of method and apparatus of data processing
CN105071927B (en) Method is locally stored in a kind of mobile device data
JP2011041326A (en) Data division method, data division device, and computer program
CN105516340B (en) A kind of cloud storage data restorability verification method and system
JP6040313B2 (en) Multi-party secure authentication system, authentication server, multi-party secure authentication method and program
CN103152322A (en) Method of data encryption protection and system thereof
KR102143525B1 (en) Method for function encryption supporting set intersection operation and apparatus using the same
KR20150139784A (en) Systems and methods for dynamic data storage
CN1905438B (en) Combined key managing method and system based on ID
CN108985102A (en) Data integrity verification method, device, system and storage medium
CN106656997A (en) Mobile social network based agent proxy re-encryption cross-domain friend-making privacy protection method
JP4676695B2 (en) Data division method, data division apparatus, and computer program
CN108600174A (en) A kind of access control mechanisms and its implementation of big merger network
JP6703706B2 (en) Ciphertext management method, ciphertext management device and program
JP5065802B2 (en) Distributed information generating apparatus, secret information restoring apparatus, shared information generating method with authority information, secret information access control method and program
CN104717057B (en) A kind of privacy sharing method and secret sharing systems
US8509447B2 (en) Method and system for distributing cryptographic keys in a hierarchized network
CN108768642A (en) A kind of data aggregation method, device, computer equipment and storage medium
JP2006018850A (en) Data storing system
CN104967516B (en) Multi-user&#39;s encryption data may compare encryption method and encryption data comparative approach
KR20140134796A (en) Method and apparatus for managing distribution of file to recover original file with at least pre-determined number file fragments with random sizes
KR102281265B1 (en) Functional encryption for set intersection with time-constrained function keys
TW200529624A (en) Content distribution server, key assignment method, content output apparatus, and key issuing center
JP4789536B2 (en) Data division apparatus, data division method, and computer program

Legal Events

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