METHOD FOR EFFICIENT AND PRACTICAL KEY DISTRIBUTION IN NETWORK CODING SYSTEMS

Abstract

An encoder including a computer readable storage medium storing program instructions, and a processor executing the program instructions, the processor configured to generate a k-bit key, where k is a positive integer, estimate an upper bound of a number of eavesdropped links, encode each bit of the k-bit key using a random matrix of a selected rank, and transmit the encoded k-bit key through a network that performs linear operations on packets.

Claims

1. An encoder comprising: a computer readable storage medium storing program instructions; and a processor executing the program instructions, the processor configured to: generate a k-bit key, where k is a positive integer; estimate an upper bound of a number of eavesdropped links including determining a number of out-going edges of a source as an upper bound of capacity; encode each bit of the k-bit key using a random matrix of a selected rank; and transmit the encoded k-bit key through a network that performs linear operations on packets including network coding operations or store and forward routing operations.

2. The encoder according to claim 1, further comprising of using a universal secure network code to generate the encoded key.

3. The encoder according to claim 1, wherein the encode further comprises of generating the random matrix from a first matrix generated from the k-bit key and a second matrix generated without the k-bit key.

4. The encoder according to claim 1, wherein one bit of information of the k-bit key is represented by a rank of a matrix of the encoded k-bit key that is transmitted.

5. The encoder according to claim 1, wherein depending on a state of a bit of the k-bit key, the bit is sent to either a random matrix generator or a zero matrix generator.

6. The encoder according to claim 1, further comprising: generate a parity check matrix of a maximum rank distance code; and perform a product of an output of the random matrix generator and the zero matrix generator.

7. A system comprising the encoder according to claim 1, further comprising a decoder deployed in one or more terminals, the decoder comprising: the processor executing the program instructions, the processor configured to: decode the encoded key from a received matrix from the network using a rank metric.

8. The system according to claim 7, wherein the decoder further comprises of generating an estimate using a rank metric from the matrix received from the network.

9. The system according to claim 7, wherein the decoder tests a rank of a second matrix from a reduction of the matrix from the network in order to output the decoded key.

10. A method, comprising: generating a k-bit key, where k is a positive integer; estimating an upper bound of a number of eavesdropped links; encoding each bit of the k-bit key using a random matrix of a selected rank; and transmitting the encoded k-bit key through a network that performs linear operations on packets.

11. The method according to claim 10, further comprising of using a universal secure network code to generate the encoded key.

12. The method according to claim 10, wherein one bit of information of the k-bit key is represented by a rank of a matrix of the encoded k-bit key that is transmitted.

13. The method according to claim 10, wherein depending on a state of a bit of the k-bit key, the bit is sent to either a random matrix generator or a zero matrix generator.

14. The method according to claim 10, further comprising: generating a parity check matrix of a maximum rank distance code; and performing a product of an output of the random matrix generator and the zero matrix generator.

15. The method according to claim 10, decoding the encoded key from received matrix from the network using a rank metric.

16. The method according to claim 15, further comprising of generating an estimate using a rank metric from the matrix received from the network; and testing a rank of a second matrix from a reduction of the matrix from the network in order to output the decoded key.

17. A computer program product for encoding and decoding, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable and executable by a computer to cause the computer to: generate a k-bit key, where k is a positive integer; estimate an upper bound of a number of eavesdropped links; encode each bit of the k-bit key using a random matrix of a selected rank; and transmit the encoded k-bit key through a network that performs linear operations on packets.

18. The computer program product according to claim 17, further comprising of using a universal secure network code to generate the encoded key.

19. The computer program product according to claim 17, wherein one bit of information of the k-bit key is represented by a rank of a matrix of the encoded k-bit key that is transmitted, wherein depending on a state of a bit of the k-bit key, the bit is sent to either a random matrix generator or a zero matrix generator.

20. The computer program product according to claim 17, further comprising to decode the encoded key from received matrix from the network by using a rank metric.

Description

BRIEF DESCRIPTION OF DRAWINGS

[0018] The exemplary aspects of the invention will be better understood from the following detailed description of the exemplary embodiments of the invention with reference to the drawings.

[0019] FIG. 1 illustrates a system for key distribution in an example embodiment.

[0020] FIG. 2 illustrates further detail of an encoder with key distribution in an example embodiment.

[0021] FIG. 3 illustrates further detail of a decoder with key distribution in an example embodiment.

[0022] FIG. 4 a flow chart of a system for key distribution in an example embodiment.

[0023] FIG. 5 illustrates an exemplary hardware/information handling system for incorporating the exemplary embodiment of the invention therein.

[0024] FIG. 6 illustrates a signal-bearing storage medium for storing machine-readable instructions of a program that implements the method according to the exemplary embodiment of the invention.

[0025] FIG. 7 depicts a cloud computing node according to an embodiment of the present invention.

[0026] FIG. 8 depicts a cloud computing environment according to an embodiment of the present invention.

[0027] FIG. 9 depicts abstraction model layers according to an embodiment of the present invention.

DETAILED DESCRIPTION OF A PREFERRED EMBODIMENTS

[0028] The invention will now be described with reference to the drawing figures, in which like reference numerals refer to like parts throughout. It is emphasized that, according to common practice, the various features of the drawing are not necessary to scale. On the contrary, the dimensions of the various features can be arbitrarily expanded or reduced for clarity. Exemplary embodiments are provided below for illustration purposes and do not limit the claims.

[0029] Network coding systems is more flexible than classic store and forward networks in that nodes have the capability to mix information in packets using linear operations before forwarding them. The benefits are to maximize multicast/unicast throughput, improve robustness on packet losses and mobility, and can be implemented in a distributed manner. However, there are new security challenges. There can be adversarial errors where adversaries may be able to eavesdrop or inject errors in some links in the network. There can be pollution errors, where network coding systems are sensitive to errors which propagate due to the mixing of packets. Security challenges in network coding systems are addressed by error control schemes. However, most existing error control schemes for network coding systems assume secret keys are shared among network nodes. One of the problems addressed in this invention is how to share the secret keys in the first place. Existing key distribution schemes such as PKI or trusted third party typically require additional infrastructure and do not meet the requirements for network coding systems. On the other hand, existing information-theoretic key distribution schemes for network coding systems have the drawback of requiring prior knowledge on the exact network capacity, as well as prior knowledge on the exact number of network channels controlled by the adversary.

[0030] Thus, there is disclosed an end-to-end mechanism for a source to transmit information to a terminal confidentially and reliably, through a network in which the nodes employ linear network codes that are not known to the source and the terminal a priori. Unlike previous approaches, the disclosed scheme operates in a rateless manner, i.e., the scheme does not require knowledge of the network capacity and only require coarse estimation of the capability of the adversary. One of the many features of the disclosed invention is that one bit of information is represented by the rank of a matrix transmitted. To send a bit of 0, a low-rank matrix is generated and transmitted. In order to send a bit of 1, a full-rank matrix is generated and transmitted. The adversary sees only a limited number of edges and therefore cannot distinguish which bit is sent.

[0031] The adversary can modify only a limited number of edges and so has limited capability to change the rank of the transmitted matrix. Therefore the terminal, by testing the rank of the received matrix, can distinguish the bits. In addition, by choosing the rank of the low-rank matrix carefully, the scheme operates in a rateless manner, i.e. without needing to know the exact network capacity and the exact number of network channels controlled by the adversary. One of the many example advantages is that the disclosed scheme does not require any additional resources and infrastructure. Another advantage is that the disclosed scheme is end-to-end and does not require any collaboration from intermediate network nodes. Another advantage is that the disclosed scheme does not require prior knowledge of the network capacity and the number of network channels controlled by the adversary.

[0032] Therefore, referring to FIG. 1, there is disclosed a method for efficient and practical key distribution in network coding systems. The system 10 setup is as follows. A source 20 wishes to distribute a k-bit key 21 (k is a positive integer) to multiple terminals 40, where the network 30 has capacity C. The adversary can insert errors on z.sub.e network links and can eavesdrop on z.sub.w network links 54. z.sub.w 54 is upper bounded and z.sub.e+z.sub.w<C. The eavesdropper would be eavesdropping on the network 30. The network 30 can be a black box (viewed in terms of its input and output). It can be assumed that source 20 and terminals 40 do not know the network coding scheme, C (capacity) or Z.sub.e (network links). Reference 52 is the number of out-going edges of the source C, which is an upper bound of the network capacity C. References 52 and 54 are located under encoder 22 to show that references 52 and 54 are the inputs to encoder 22.

[0033] In addition to upper bound on eavesdropped links, the system 10 also takes as input an upper bound on the network capacity which is easily estimate as the number of outgoing network links from the source network node where the encoder resides Ĉ. The disclosed scheme is adaptive. In other words, the scheme adapts to the dynamics of the network 30 and the adversary and makes sure that the key is securely and reliably delivered regardless of the dynamics.

[0034] The scheme is rateless and adaptive. A rateless scheme provides, for example, that the scheme does not require knowledge of the network capacity (only an upper bound of capacity easily computed at the source with local info) and only require coarse estimation of the capability of the adversary (i.e., upper bound on number eavesdropped links).

[0035] The scheme is made adaptive, for example, since there is a separate method that can accurately determine the parameters C, z.sub.e and z.sub.w, even in a dynamic setting. The disclosed scheme can perform, for example, when z.sub.w<=z.sub.w′<=C−z.sub.e, where z.sub.w′ is the estimate, and z.sub.w, C, z.sub.e are the true parameters that one does not know. One may also assume that honest nodes dominate the network and so the gap between z.sub.w and C−z.sub.e is quite large (recall that z.sub.w=C−z.sub.e corresponds to the case that the adversary controls the min-cut), and so that the disclosed scheme has a big margin for estimation error. Another way to see it is that the disclosed scheme works over a large “dynamic range” without the need to revise parameters, whereas if other schemes were used, then one needs to revise parameters very often.

[0036] The disclosed invention is able to distribute the k-bit key 21 in-band using the network coding system 10. The source encoder 22 can represent each bit by a random matrix and send over network 30, where “0” can represent a low rank random matrix, and “1” can represent a full rank random matrix.

[0037] The adversary sees only a limited number of edges (network links) z.sub.w 54 and cannot distinguish which bit is sent, and has limited capability z.sub.e 52 to change the rank of the transmitted matrix. The terminal decoder 42 (42.sub.1 . . . 42.sub.n, where n is an integer) can distinguish the bits by testing the rank of the received matrix.

[0038] In the disclosed invention, there is no requirement for additional resources and infrastructure for key distribution. There is no requirement for collaboration from intermediate network nodes, and no prior knowledge of the network coding scheme, the network capacity and number of network channels controlled by the adversary.

[0039] If encoder 22 and decoder(s) 42 are available, then the system 10 uses a network emulator to create different test scenarios with controlled network topologies and capacities C, and adversary parameters z.sub.w, z.sub.e.

[0040] If there is access to the encoder output, the detection would not be difficult. Particularly, there can be a check of the rank of the submatrices of X corresponding to the W.sub.i's. The ranks of these submatrices are very structured, i.e., either full rank or rank Z.sub.w as explained in more detail below.

[0041] If there is a control of the min-cut of the network, then the system can listen to the cut edges. One of the problems with all existing codes is that they require the knowledge of the min-cut (minimum cut value) of the network, and the number of errors in advance, for the purpose of code construction, encoding and decoding. A small set of packets received from any small number of edges (<=z.sub.w) looks uniformly random, but a large set of packets from a large set of edges (>z.sub.w) looks less random (recall that we generate a lot of zero matrices that have no entropy). Therefore, the system can test the entropy of the packets and check if they exhibit this property.

[0042] A system can be provided for efficient and rateless error correction for network coding provided that the source 20 and the terminal 40 share a short secret key 21. The key 21 may be pre-allocated, communicated by a secure side-channel, or communicated over the network 30 by using public key infrastructure while disabling network coding. The question is, if the above options are not available, is it possible to communicate the key via the same network coding system. The disclosed invention shows that this is possible in the following details.

[0043] An information-theoretic scheme of a system 10 to communicate a short key 21 secretly and reliably over the network 30, provided that the adversary has limited eavesdropping capability. Specifically, instead of allowing the adversary to observe all edges in the network, one assumes that the adversary can eavesdrop on at most a number of z.sub.w edges in the network 30, such that z.sub.e+z.sub.w<C. One can assume that the source 20 has an upper bound on the passive parameter z.sub.w, and assume that z.sub.e and C are not known to the source 20 and the terminal 40. The present scheme operates in a rateless manner.

[0044] One of the ideas is that one bit of information is represented by the rank of a matrix transmitted. To send a bit of 0, a low-rank matrix is generated and transmitted. To send a bit of 1, a full-rank matrix is generated and transmitted. The adversary sees only a limited number of edges and therefore cannot distinguish which bit is sent. The adversary has limited capability to change the rank of the transmitted matrix and therefore the terminal, by testing the rank of the received matrix, can distinguish the bits. In the following, the detailed encoder and decoder to transmit k bits secretly and reliably is described.

[0045] Referring again to FIG. 1, a system 10 is shown including a source 20, network 30 and destinations (terminals) 40. The network 30 can be represented as a directed graph, where the set of vertices represents network nodes and the set of edges represents noiseless network links. The network operates in a synchronized manner and each link can send a symbol from a finite field per transmission. A source 20 wishes to communicate reliably to a terminal 40. The linear network code C is a set of encoding functions defined over each edge. Each function takes as input the signals received from all incoming edges at one end, and evaluates to the signal transmitted over the edge.

[0046] To transmit information over the network 30, the source 20 generates a batch of encoded packets as input to the network 30, represented by a matrix X, where packets are rows. As the packets travel through the network 30, they undergo linear transforms defined by the network code . Without loss of generality, it is assumed is capacity-achieving, i.e., in the absence of adversarial errors 34, the terminal will observe a matrix AX 32 (linear operations on packets including network coding operations), where A is the network transform matrix. Note that when there are multiple terminals, a network transform matrix is defined for each terminal and these matrices need not to be the same. Therefore, when there are multiple terminals, each of them receives different messages because the network transform matrix for each of them is different. i.e., “A” can be different for different terminals.

[0047] The adversary controls a subset of edges in the network 30, modeled in the following way. For each compromised edge, the adversary injects an error packet so that the packet received from this edge is the addition of the error packet and the packet originally transmitted on the edge. As the injected error packets travel through the network 30, they undergo linear transformations defined by the network code . The terminal receives the sum of the linearly transformed error packets and the linearly transformed X. More precisely, the terminal observes a matrix Y=AX+BZ (36), where B is the network transforming matrix (determined by the network code) from the compromised edges to terminal, and Z are the injected error packets. From the network 30, a receive Rx Message 46 (i.e., Y.sub.i, where i is an integer) is sent to decoder 42.sub.1 to decoder 42.sub.n. In the key distribution scheme there is no need to note a period since everything finishes within just one period.

[0048] Therefore, a k-bit key s.sub.1 . . . , s.sub.k is received or used by the encoder 22, which then generates transmit encoded key X 24, which are sent to the network 30. Let C be an upper bound of the network capacity C, i.e., the min-cut from the source to the terminals. For example, one can choose C to be the number of out-going edges of the source. Let z.sub.w be an upper bound of the number of edges that is controlled by the adversary. The encoded key X 24 is such that

[00001]$X\in {}_q^{\stackrel{\_}{C}\times \left(k.Math.\stackrel{\_}{C}\left({\stackrel{\_}{C}}_{-\mathrm{zw}}\right)+\stackrel{\_}{C}\right)}$

(i.e., a matrix of a size over .sub.q). .sub.q is the finite field of size q of symbols transmitted as data over the network 30.

[0049] From the network 30, a receive Rx Message 46 (i.e., Y.sub.i) is sent to decoder 42.sub.1 is received by decoder 42.sub.n. The decoders (decoders 42.sub.1 to 42.sub.n, where n is a positive integer) then output decoded key s.sub.1 . . . , s.sub.k 50. Outgoing links z.sub.e 52 and upper bound on eavesdropped links z.sub.w 54 are received at encoder 22.

[0050] In further detail, the network 30 can be represented as a directed graph =(), where the set of vertices represents network nodes and the set of edges represents noiseless network links. Denote by C the min-cut (or max-flow) of the network with respect to s and t. The linear network code implemented in is represented by a set of encoding functions . For each compromised edge (u; v), the adversary injects an error packet so that the packet received by v from this edge is the addition of the error packet and the packet originally transmitted on the edge. The terminal 40 observes a matrix Y=AX+BZ, where B is the network transform matrix (determined by the network code) from the compromised edges to t, and Z are the z.sub.e injected error packets. The adversary may choose Z carefully in order to corrupt the communication between s and t. Note that z.sub.e, Z and B are not known to the source 20 and the terminal 40. The network 30 shows the matrix Y=AX+BZ with the network coding operations 32 (AX) and the adversarial error 34 (BZ).

[0051] The adversary controls z.sub.e<C edges in the network 30, modeled in the following way. For each compromised edge (u, v), the adversary injects an error packet so that the packet received by v from this edge is the addition (over .sub.q, (finite field)) of the error packet and the packet originally transmitted on the edge. As the injected error packets travel through the network 30, they undergo linear transforms defined by the network code . The terminal 40 receives the sum of the linearly transformed error packets and the linearly transformed X. More precisely, the terminal 40 observes a matrix Y=AX+BZ, where Bε.sub.q.sup.C×Zq is the network transform matrix (determined by the network code) from the compromised edges to t, and Zε.sub.q.sup.Ze×n are the z.sub.e injected error packets. The adversary may choose Z carefully in order to corrupt the communication between s (source 20) and t (terminal 40). Note that z.sub.e, Z and B are not known to the source 20 and the terminal 40.

[0052] Therefore, as indicated previously, one bit of information is represented by the rank of a matrix transmitted. To send a bit of 0, a low-rank matrix is generated and transmitted; and to send a bit of 1, a full-rank matrix is generated and transmitted. This is because the adversary sees only a limited number of edges and therefore cannot distinguish which bit is sent. The adversary has limited capability to change the rank of the transmitted matrix and therefore the terminal, by testing the rank of the received matrix, can distinguish the bits. The following describes the detailed encoder 22 and decoder 42 to transmit k bits secretly and reliably.

[0053] Referring to FIG. 2, the encoding 22 is further detailed. The encoder 22 produces streams of encoded packets using random linear codes.

[0054] A k-bits key 202 is generated by the system 10. Therefore, one can denote the k bits to be transmitted by s.sub.1, . . . , s.sub.k 202. Therefore, a key s.sub.i is received by the encoder, where i is a positive integer (k is ≧1). At module 204, if the key s.sub.i is 1, then it is sent to a random matrix generator 205. If the key is 0, then the key s.sub.i is sent to the Zero matrix generator 206.

[0055] For each of the bits of the key 202, a matrix

[00002]$S_i\in {}_q^{\left({\stackrel{\_}{C}}_{-\mathrm{zw}}\right)\times \stackrel{\_}{C}\left({\stackrel{\_}{C}}_{-z_w}\right)}$

is generated from the random matrix generator 205. S.sub.i is a zero matrix if s.sub.i=0 (from zero matrix generator 206) or a random matrix if s.sub.i=1 (from random matrix generator 205). Let

[00003]$N_i\in {}_q^{\left(z_w\right)\times \stackrel{\_}{C}\left({\stackrel{\_}{C}}_{-z_w}\right)}$

be a random matrix,

[00004]$W_i=\left[\begin{array}{c}{S}_i\\ N_i\end{array}\right],$

and W=[W.sub.1, . . . W.sub.k] at module 212 when Si is received from generators 205 and 206 and N.sub.i is received from random matrix generator 208 (where i is an integer). The separate random matrix generator 208 outputs N.sub.i where

[00005]$N_i\in {}_q^{z_w\times \stackrel{\_}{C}\left({\stackrel{\_}{C}}_{-z_w}\right)}.$

The module 208 outputs W to module 214 where the universal network code is applied. Let Q=q.sup.c and let .sub.Q be the degree C. extension field of .sub.Q. .sub.Q is a vector space over .sub.q and let φ:

[00006]${}_q^{1\times \stackrel{\_}{C}}->{}_Q$

be the vector space isomorphism. Then let φ (S.sub.i) and φ(N.sub.i) denote the matrices obtained by applying the vector space isomorphism φ to each row of S.sub.i or N.sub.i, so that each length-C row segment maps to a symbol .sub.Q. Further, φ (W) is denoted as:

[00007]$\varphi \left(W\right)=\left[\begin{array}{ccc}\varphi \left(S_1\right)& \mathrm{.Math.}& \varphi \left(S_k\right)\\ \varphi \left(N_1\right)& \mathrm{.Math.}& \varphi \left(N_k\right)\end{array}\right]$

[0056] φ(W) is outputted from module 214 and a product (matrix multiplication) 215 is generated from φ(W) and the output

[00008]$\hspace{1em}\left[\begin{array}{cc}I& -P\\ 0& I\end{array}\right]$

from module 216.

[0057] The output from module 216 is explained further as follows. Let Hε.sub.Q.sup.(c−Z.sup.w.sup.)×C be a parity check matrix of a (C, z.sub.w) maximum rank distance (MRD) code over F.sub.Q. Therefore, module 210 generates parity check matrix H of a (C, z.sub.w) maximum rank distance (MRD) code over .sub.Q Without loss of generality one may assume H=[I P], which is output from the module 210. At module 216, (I,P) is extracted from H to output the matrix

[00009]$\left[\begin{array}{cc}I& -P\\ 0& I\end{array}\right].$

Then X.sub.Q is output from the product (matrix multiplication) 215 of the matrix

[00010]$\hspace{1em}\left[\begin{array}{cc}I& -P\\ 0& I\end{array}\right]$

derived from the check parity matrix 210 and the matrix φ(W) derived from k-bit key 202.

[0058] The source 20 then computes:

[00011]$X_Q=\left[\begin{array}{cc}I& -P\\ 0& I\end{array}\right].Math.\varphi \left(W\right),$

[0059] where X.sub.Q is a C×k(C−z.sub.w) matrix over .sub.Q from the product 215. Finally, the encoder obtains at module 218 from the received input X.sub.Q:

X=[Iφ.sup.−1(X.sub.Q)],

[0060] where X is a C×(kC(C−z.sub.w)+C) matrix over .sub.q since φ.sup.−1 expends each entry of X.sub.Q into a length−C row vector over .sub.q. Finally, the source inputs X into the network 30 and thereafter it undergoes the network transforms.

[0061] Referring to FIG. 3, the decoder(s) 42 is further described. The terminal 40 observes a batch of packets from the network 30 Y=AX+BZ. One of the objectives of the decoder 42 is to obtain from Y (302) a good estimation of X.sub.Q, such that it is close to X.sub.Q in rank distance. The decoder 42 can accomplish this by performing a reduction transformation on Y 302 at module 304, which essentially involves a row reduction on Y 302 and an insertion of zero rows. Therefore, at module 304 there is reduction of Y to (L, R.sub.i, E.sub.i). From this the decoder 42 will obtain a matrix Lε.sub.Q.sup.C×μ; a set of matrices R.sub.iε.sub.Q.sup.C×(C−z.sup.w.sup.), i=1, k; and a set of matrices E.sub.iε.sub.Q.sup.δ×(C−z.sup.w.sup.), i=1, k. These matrices are useful because they are related to X.sub.Q in the following way. Divide X.sub.Q into [X.sub.1 . . . X.sub.k] where X.sub.i is a C×(C−z.sub.w) matrix over .sub.Q, then by a theorem, there exist matrices U.sub.L,i, U.sub.E,i and U.sub.i such that rank (U.sub.i)≦z.sub.e−max {μ+C−C, δ}, and such that

R.sub.i=X.sub.i+LU.sub.L,i+U.sub.E,iE.sub.i+U.sub.i.

[0062] To decode, the terminal 40 solves for full rank matrices Jε.sub.Q.sup.(C−Z.sup.w.sup.−μ)×(C−Z.sup.w.sup.) at module 308 and K.sub.iε.sub.Q.sup.(C−Z.sup.w.sup.)×(C−Z.sup.w.sup.−δ) at module 306 such that JHL=0 and E.sub.iK.sub.i=0. Therefore, at module 308, the decoder 42 finds J such that JHL=0 at module 306, the decoder 42 finds K.sub.i such that E.sub.iK.sub.i=0. A product 310 is performed of the output of module 308, 304 and 306 to output matrix B.sub.i=JHR.sub.iK.sub.i where i=1, . . . ,k (where k is positive integer).

[0063] Finally, the decoder 42 tests at module 312 the rank of the matrix B.sub.i=JHR.sub.iK.sub.i and decodes s.sub.i=1 if the matrix B.sub.i is full rank at module 316 or s.sub.i=0 at module 314 otherwise. Thereby, the key s.sub.1, . . . , s.sub.k 318 is output from the decoder(s) 42.

[0064] FIG. 4 provides a flow chart of the method of system of distributing keys 10 according to an example embodiment. With reference to FIGS. 1 through 4, the system 10 generates k-bit key 24 (step 410). Then, after receiving the k-bit key 24 by the encoder 24, the system 10 provides an estimation of an upper bound 54 of Z.sub.w number of eavesdropped links (step 420). Then the encoder 22 encodes each bit of the k-bit key 24 using a random matrix of carefully chosen rank (step 430). Then, the encoder 22 uses a universal secure network code to generate encoded key X 220 (step 440). Then, the encoder 22 transmits X over a network 30 performing linear operations on packets (including network coding operations or even store and forward routing operations) (step 450). Then, the decoder(s) 42 decode X from received Y=AX+BZ using a rank metric decoder (step 460). Thereby, the key s.sub.1, . . . , s.sub.k 318 is output from the decoder(s) 42.

[0065] Exemplary Hardware and Cloud Implementation

[0066] FIG. 5 illustrates another hardware configuration of an information handling/computer system 1100 in accordance with the disclosed invention and which preferably has at least one processor or central processing unit (CPU) 1110 that can implement the techniques of the invention in a form of a software program.

[0067] The CPUs 1110 are interconnected via a system bus 1112 to a random access memory (RAM) 1114, read-only memory (ROM) 1116, input/output (I/O) adapter 1118 (for connecting peripheral devices such as disk units 1121 and tape drives 1140 to the bus 1112), user interface adapter 1122 (for connecting a keyboard 1124, mouse 1126, speaker 1128, microphone 1132, and/or other user interface device to the bus 1112), a communication adapter 1134 for connecting an information handling system to a data processing network, the Internet, an Intranet, a personal area network (PAN), etc., and a display adapter 1136 for connecting the bus 1112 to a display device 1138 and/or printer 1139 (e.g., a digital printer or the like).

[0068] In addition to the hardware/software environment described above, a different aspect of the invention includes a computer-implemented method for performing the above method. As an example, this method may be implemented in the particular environment discussed above.

[0069] Such a method may be implemented, for example, by operating a computer, as embodied by a digital data processing apparatus, to execute a sequence of machine-readable instructions. These instructions may reside in various types of signal-bearing media.

[0070] Thus, this aspect of the present invention is directed to a programmed product, comprising signal-bearing storage media tangibly embodying a program of machine-readable instructions executable by a digital data processor incorporating the CPU 1110 and hardware above, to perform the method of the invention.

[0071] This signal-bearing storage media may include, for example, a RAM contained within the CPU 1110, as represented by the fast-access storage for example.

[0072] Alternatively, the instructions may be contained in another signal-bearing storage media 1200, such as a magnetic data storage diskette 1210 or optical storage diskette 1220 (FIG. 6), directly or indirectly accessible by the CPU 1210.

[0073] Whether contained in the diskette 1210, the optical disk 1220, the computer/CPU 1210, or elsewhere, the instructions may be stored on a variety of machine-readable data storage media.

[0074] Therefore, the present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

[0075] The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

[0076] Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

[0077] Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

[0078] Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

[0079] These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

[0080] These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

[0081] The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

[0082] The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

[0083] Referring now to FIG. 7, a schematic 1400 of an example of a cloud computing node is shown. Cloud computing node 1400 is only one example of a suitable cloud computing node and is not intended to suggest any limitation as to the scope of use or functionality of embodiments of the invention described herein. Regardless, cloud computing node 1400 is capable of being implemented and/or performing any of the functionality set forth hereinabove.

[0084] In cloud computing node 1400 there is a computer system/server 1412, which is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 1412 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.

[0085] Computer system/server 1412 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 1412 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

[0086] As shown in FIG. 7, computer system/server 1412 in cloud computing node 1400 is shown in the form of a general-purpose computing device. The components of computer system/server 1412 may include, but are not limited to, one or more processors or processing units 1416, a system memory 1428, and a bus 1418 that couples various system components including system memory 1428 to processor 1416.

[0087] Bus 1418 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

[0088] Computer system/server 1412 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 1412, and it includes both volatile and non-volatile media, removable and non-removable media.

[0089] System memory 1428 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 1430 and/or cache memory 1432. Computer system/server 1412 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 1434 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 1418 by one or more data media interfaces. As will be further depicted and described below, memory 1428 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.

[0090] Program/utility 1440, having a set (at least one) of program modules 1442, may be stored in memory 1428 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 1442 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.

[0091] Computer system/server 1412 may also communicate with one or more external devices 1414 such as a keyboard, a pointing device, a display 1424, etc.; one or more devices that enable a user to interact with computer system/server 1412; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 1412 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 1422. Still yet, computer system/server 1412 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 1420. As depicted, network adapter 1420 communicates with the other components of computer system/server 1412 via bus 1418. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 1412. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

[0092] Referring now to FIG. 8, illustrative cloud computing environment 1550 is depicted. As shown, cloud computing environment 1550 comprises one or more cloud computing nodes 1400 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 1554A, desktop computer 1554B, laptop computer 1554C, and/or automobile computer system 1554N may communicate. Nodes 1400 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof. This allows cloud computing environment 1550 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 1554A-N shown in FIG. 8 are intended to be illustrative only and that computing nodes 1400 and cloud computing environment 1550 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).

[0093] Referring now to FIG. 9, a set of functional abstraction layers provided by cloud computing environment 1550 (FIG. 8) is shown. It should be understood in advance that the components, layers, and functions shown in FIG. 9 are intended to be illustrative only and embodiments of the invention are not limited thereto. As depicted, the following layers and corresponding functions are provided:

[0094] Hardware and software layer 1660 includes hardware and software components. Examples of hardware components include mainframes, in one example IBM® zSeries® systems; RISC (Reduced Instruction Set Computer) architecture based servers, in one example IBM pSeries® systems; IBM xSeries® systems; IBM BladeCenter® systems; storage devices; networks and networking components. Examples of software components include network application server software, in one example IBM WebSphere® application server software; and database software, in one example IBM DB2® database software. (IBM, zSeries, pSeries, xSeries, BladeCenter, WebSphere, and DB2 are trademarks of International Business Machines Corporation registered in many jurisdictions worldwide).

[0095] Virtualization layer 1662 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers; virtual storage; virtual networks, including virtual private networks; virtual applications and operating systems; and virtual clients.

[0096] In one example, management layer 1664 may provide the functions described below. Resource provisioning provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may comprise application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal provides access to the cloud computing environment for consumers and system administrators. Service level management provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA.

[0097] Workloads layer 1666 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include such functions as mapping and navigation; software development and lifecycle management; virtual classroom education delivery; data analytics processing; transaction processing; and, more particularly relative to the disclosed invention, the APIs and run-time system components of generating search autocomplete suggestions based on contextual input.

[0098] The many features and advantages of the invention are apparent from the detailed specification, and thus, it is intended by the appended claims to cover all such features and advantages of the invention which fall within the true spirit and scope of the invention. Further, since numerous modifications and variations will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation illustrated and described, and accordingly, all suitable modifications and equivalents may be resorted to, falling within the scope of the invention.