Common use of Previous Work Clause in Contracts

Previous Work. Information-theoretically secure secret-key agreement from correlated information has first been proposed by Xxxxxx in [11]. He considered a setting where Alice, Bob, and Eve hold many indepen- dent realizations of correlated random variables X, Y , and Z, respectively, with joint probability distribution PXY Z. The (two-way) secret-key rate S(X; Y Z), i.e., the rate at which Xxxxx and Xxx can generate secret-key bits per realization of (X, Y, Z), has further been studied in [1] and later in [12], where the intrinsic information I(X; Y Z) is defined and shown to be an upper bound on S(X; Y Z), which, however, is not tight [13]. | − | | For one-way communication, it is already implied by a result in [3] and has later been shown in [1] that the secret-key rate S→(X; Y Z) is given by the supremum of H(U ZV ) H(U Y V ), taken over all possible random variables U and V obtained from X.1 However, as this is a purely information-theoretic result, it does not directly imply that there exists an efficient key-agreement protocol. | − |

Previous Work. Information-theoretically secure secret-key agreement from correlated cor- related information has first been proposed by Xxxxxx in [11]. He considered a setting where AliceXxxxx, BobXxx, and Eve Xxx hold many indepen- dent independent realizations of correlated corre- lated random variables X, Y , and Z, respectively, with joint probability distribution distrib- ution PXY Z. The (two-way) secret-key rate S(X; Y Z), i.e., the rate at which Xxxxx Al- ice and Xxx can generate secret-key bits per realization of (X, Y, Z), has further been studied in [1] and later in [12], where the intrinsic information I(X; Y Z) is defined and shown to be an upper bound on S(X; Y Z), which, however, is not tight [13]. | − | | For one-way communication, it is already implied by a result in [3] and has later been shown in [1] that the secret-key rate S→(X; Y Z) is given by the supremum of H(U ZV ) H(U Y V YV ), taken over all possible random variables U and V obtained from X.1 However, as this is a purely information-theoretic result, it does not directly imply that there exists an efficient key-agreement protocol. | − |

Previous Work. Information-theoretically secure secret-key agreement from correlated cor- related information has first first been proposed by Xxxxxx in [11]. He considered a setting where Alice, Bob, and Eve hold many indepen- dent independent realizations of correlated corre- lated random variables X, Y , and Z, respectively, with joint probability distribution distrib- ution PXY Z. The (two-way) secret-key rate S(X; Y Z), i.e., the rate at which Xxxxx Al- ice and Xxx can generate secret-key bits per realization of (X, Y, Z), has further been studied in [1] and later in [12], where the intrinsic information I(X; Y Z) is defined defined and shown to be an upper bound on S(X; Y Z), which, however, is not tight [13]. | − | | For one-way communication, it is already implied by a result in [3] and has later been shown in [1] that the secret-key rate S→(X; Y Z) is given by the supremum of H(U ZV ) H(U Y V YV ), taken over all possible random variables U and V obtained from X.1 However, as this is a purely information-theoretic result, it does not directly imply that there exists an efficient efficient key-agreement protocol. | − |

Previous Work. Information-theoretically secure secret-key agreement from correlated information has first been proposed by Xxxxxx in [11]. He considered a setting where AliceXxxxx, BobXxx, and Eve Xxx hold many indepen- dent realizations of correlated random variables X, Y , and Z, respectively, with joint probability distribution PXY Z. The (two-way) secret-key rate S(X; Y Z), i.e., the rate at which Xxxxx and Xxx can generate secret-key bits per realization of (X, Y, Z), has further been studied in [1] and later in [12], where the intrinsic information I(X; Y Z) is defined and shown to be an upper bound on S(X; Y Z), which, however, is not tight [13]. | − | | For one-way communication, it is already implied by a result in [3] and has later been shown in [1] that the secret-key rate S→(X; Y Z) is given by the supremum of H(U ZV ) H(U Y V ), taken over all possible random variables U and V obtained from X.1 However, as this is a purely information-theoretic result, it does not directly imply that there exists an efficient key-agreement protocol. | − |