Iterative data secret-sharing transformation
First Claim
1. A method, comprising:
- receiving an input stream of bits of data;
secret-sharing transforming the received bits of the input stream of data, said secret-sharing transforming including splitting each received bit of the bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits; and
separating the secret-sharing bits of each pair of secret-sharing bits into separate streams of secret-sharing bits so that one secret-sharing bit of each pair of secret-sharing bits is in one stream of secret-sharing bits and the other secret-sharing bit of each pair is in another stream of secret-sharing bits different from the one stream of secret-sharing bits and wherein a secret sharing bit is shared by adjacent pairs of secret sharing bits;
wherein the splitting is a function of the exclusive-OR function such that a first received bit of the input stream of bits is equal to the exclusive-OR function of a first associated pair of secret-sharing bits, one secret-sharing bit being in the one stream of secret-sharing bits, and the other secret-sharing bit of the first associated pair being in the other stream of secret-sharing bits, and a second received bit of the input stream of bits is equal to the exclusive-OR function of a second associated pair of secret-sharing bits, one secret-sharing bit of the second associated pair being in the one stream of secret-sharing bits of data, and the other secret-sharing bit of the second associated pair being in the other stream of secret-sharing bits, and wherein one bit is shared between the first associated pair of secret-sharing bits and the second associated pair of secret-sharing bits so that the total number of secret-sharing bits of the first and second associated pairs of secret-sharing bits is three secret-sharing bits and wherein the separating of the three secret-sharing bits of the first and second associated pairs of secret-sharing bits, includes placing the shared secret-sharing bit in one stream of secret-sharing bits, and placing the other two secret-sharing bits of the three secret-sharing bits in one or more streams of secret-sharing bits different from the one stream of the shared secret-sharing bit; and
wherein the input stream of bits has N bits, and wherein the splitting of each received bit of the N bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits, is performed iteratively, to generate a total of N+1 secret-sharing bits from the input stream of bits N bits.
1 Assignment
0 Petitions
Accused Products
Abstract
Provided are a method, system, and article of manufacture for iterative data secret-sharing transformation and reconversion. In one aspect, data secret-sharing transformation and reconversion is provided in which each bit of an input stream of bits of data is split, on a bit by bit basis, into a pair of secret-sharing bits, and the secret-sharing bits of each pair of secret-sharing bits are separated into separate streams of secret-sharing bits. In this manner, one secret-sharing bit of each pair of secret-sharing bits may be placed in one stream of secret-sharing bits and the other secret-sharing bit of each pair may be placed in another stream of secret-sharing bits different from the one stream of secret-sharing bits. Confidentiality of the original input stream may be protected in the event one but not both streams of secret-sharing bits is obtained by unauthorized personnel. In another aspect, for an input stream of N bits, each received bit of the N bits of the input stream of data, may be interatively split, on a bit by bit basis, into a pair of secret-sharing bits, to generate as few as N+1 secret-sharing bits from the input stream of bits N bits. Other features and aspects may be realized, depending upon the particular application.
23 Citations
18 Claims
-
1. A method, comprising:
-
receiving an input stream of bits of data; secret-sharing transforming the received bits of the input stream of data, said secret-sharing transforming including splitting each received bit of the bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits; and separating the secret-sharing bits of each pair of secret-sharing bits into separate streams of secret-sharing bits so that one secret-sharing bit of each pair of secret-sharing bits is in one stream of secret-sharing bits and the other secret-sharing bit of each pair is in another stream of secret-sharing bits different from the one stream of secret-sharing bits and wherein a secret sharing bit is shared by adjacent pairs of secret sharing bits; wherein the splitting is a function of the exclusive-OR function such that a first received bit of the input stream of bits is equal to the exclusive-OR function of a first associated pair of secret-sharing bits, one secret-sharing bit being in the one stream of secret-sharing bits, and the other secret-sharing bit of the first associated pair being in the other stream of secret-sharing bits, and a second received bit of the input stream of bits is equal to the exclusive-OR function of a second associated pair of secret-sharing bits, one secret-sharing bit of the second associated pair being in the one stream of secret-sharing bits of data, and the other secret-sharing bit of the second associated pair being in the other stream of secret-sharing bits, and wherein one bit is shared between the first associated pair of secret-sharing bits and the second associated pair of secret-sharing bits so that the total number of secret-sharing bits of the first and second associated pairs of secret-sharing bits is three secret-sharing bits and wherein the separating of the three secret-sharing bits of the first and second associated pairs of secret-sharing bits, includes placing the shared secret-sharing bit in one stream of secret-sharing bits, and placing the other two secret-sharing bits of the three secret-sharing bits in one or more streams of secret-sharing bits different from the one stream of the shared secret-sharing bit; and wherein the input stream of bits has N bits, and wherein the splitting of each received bit of the N bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits, is performed iteratively, to generate a total of N+1 secret-sharing bits from the input stream of bits N bits. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer program product comprising a non-transitory computer readable storage medium storing computer readable program code that, when executed on a processor of a computer, causes the computer to perform operations, comprising:
-
receiving an input stream of bits of data; secret-sharing transforming the received bits of the input stream of data, said secret-sharing transforming including splitting each received bit of the bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits; and separating the secret-sharing bits of each pair of secret-sharing bits into a plurality of separate streams of secret-sharing bits so that one secret-sharing bit of each pair of secret-sharing bits is in one stream of secret-sharing bits and the other secret-sharing bit of each pair is in another stream of secret-sharing bits different from the one stream of secret-sharing bits and wherein a secret sharing bit is shared by adjacent pairs of secret sharing bits; wherein the splitting is a function of the exclusive-OR function such that a first received bit of the input stream of bits is equal to the exclusive-OR function of a first associated pair of secret-sharing bits, one secret-sharing bit being in the one stream of secret-sharing bits, and the other secret-sharing bit of the first associated pair being in the other stream of secret-sharing bits, and a second received bit of the input stream of bits is equal to the exclusive-OR function of a second associated pair of secret-sharing bits, one secret-sharing bit of the second associated pair being in the one stream of secret-sharing bits of data, and the other secret-sharing bit of the second associated pair being in the other stream of secret-sharing bits, and wherein one bit is shared between the first associated pair of secret-sharing bits and the second associated pair of secret-sharing bits so that the total number of secret-sharing bits of the first and second associated pairs of secret-sharing bits is three secret-sharing bits and wherein the separating of the three secret-sharing bits of the first and second associated pairs of secret-sharing bits, includes placing the shared secret-sharing bit in one stream of secret-sharing bits, and placing the other two secret-sharing bits of the three secret-sharing bits in one or more streams of secret-sharing bits different from the one stream of the shared secret-sharing bit; and wherein the input stream of bits has N bits, and wherein the splitting of each received bit of the N bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits, is performed iteratively, to generate a total of N+1 secret-sharing bits from the input stream of N bits. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A system, comprising:
-
a processing unit having a data input configured to receive an input stream of bits of data, and adapted to transform for secret-sharing the received bits of the input stream of data, said processing unit including a data splitter adapted to split each received bit of the bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits, and a data separator adapted to separate the secret-sharing bits of each pair of secret-sharing bits into separate streams of secret-sharing bits so that one secret-sharing bit of each pair of secret-sharing bits is in one stream of secret-sharing bits and the other secret-sharing bit of each pair is in another stream of secret-sharing bits different from the one stream of secret-sharing bits and wherein a secret sharing bit is shared by adjacent pairs of secret sharing bits; wherein the processing unit is adapted to perform an exclusive-OR function and wherein the splitting is a function of the exclusive-OR function such that a first received bit of the input stream of bits is equal to the exclusive-OR function of a first associated pair of secret-sharing bits, one secret-sharing bit being in the one stream of secret-sharing bits, and the other secret-sharing bit of the first associated pair being in the other stream of secret-sharing bits, and a second received bit of the input stream of bits is equal to the exclusive-OR function of a second associated pair of secret-sharing bits, one secret-sharing bit of the second associated pair being in the one stream of secret-sharing bits of data, and the other secret-sharing bit of the second associated pair being in the other stream of secret-sharing bits, and wherein one bit is shared between the first associated pair of secret-sharing bits and the second associated pair of secret-sharing bits so that the total number of secret-sharing bits of the first and second associated pairs of secret-sharing bits is three secret-sharing bits and wherein the separating of the three secret-sharing bits of the first and second associated pairs of secret-sharing bits, includes placing the shared secret-sharing bit in one stream of secret-sharing bits, and placing the other two secret-sharing bits of the three secret-sharing bits in one or more streams of secret-sharing bits different from the one stream of the shared secret-sharing bit; and wherein the input stream of bits has N bits, and wherein the splitting of each received bit of the N bits of the input stream of data, on a bit by bit basis, into a pair of secret-sharing bits, is performed iteratively, to generate a total of N+1 secret-sharing bits from the input stream of N bits. - View Dependent Claims (16, 17, 18)
-
Specification