Common randomness in information theory and cryptography. I. Secret sharing
Citations
2,926 citations
Cites methods from "Common randomness in information th..."
...Besides QKD, the additional resource in this case being the quantum channel, a number of alternative schemes to this end have been put forward (Ahlswede and Csiszár, 1993; Csiszár and Körner, 1978; Maurer, 1993; Wyner, 1975), to which one can also count the traditional trusted courier approach…...
[...]
2,442 citations
1,759 citations
Cites background from "Common randomness in information th..."
...Powerful tools, such as common randomness, advantage distillation, and privacy amplification, were developed in the context of secret key agreement over wiretap channels [23], [25] and will be discussed, as they form the basis...
[...]
...The key generation/distribution problem in wiretap channels falls under the general problem of key generation from correlated source outputs, which has been extensively studied in an information-theoretic context [5], [23], [24]....
[...]
1,493 citations
1,294 citations
Additional excerpts
...were presented in [21]: S(X;Y||Z)≤ min[I (X;Y),I (X;Y|Z)], (13) S (X;Y||Z)≥ max[I (X;Y)− I (X;Z),I (Y;X)−I (Y ;Z)]. Closely related results were offered in the concurrent work by Ahlswede and Csiza´r [176]. Csisza´r and Narayan studied the augmentation of key-based secrecy capacity with the aid of a helper which supplies additional correlated information in [177], and obtained a single-letter character...
[...]
References
14,980 citations
Additional excerpts
...The popular computational complexity approach (Diffie and Hellman [ 7 ], Rivest, Shamir, and Adleman [9]) certainly appears fruitful....
[...]
14,659 citations
3,570 citations
387 citations
364 citations
"Common randomness in information th..." refers background in this paper
...In certain communication situations random codes can far outperform deterministic codes, e.g., in the case of arbitrarily varying channels; for the latter, concerning the relation of capacity for deterministic codes to capacity for random codes, cf. Ahlswede [l] and Csisziir and Narayan [ 6 ]....
[...]