Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free

By Ueli M. Maurer, S. Wolf. International Conference on the Theory and Application of Cryptographic Techniques, 2000

507 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/209ec57396225554522738b10ad05cbf2d274fe7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

In Electrical and Electronic Engineering

Citations in the corpus

Secrecy Capacity of Wireless Channels (2006, methodology): “1A stricter security condition can be introduced using the tools in [10] 2Note that CSI on the main channel is of no use to Eve, because the equivocation rate depends only on the output of the wiretap channel.”
Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions (2007, background): “A stronger measurement of the secrecy level has been defined by Maurer and Wolf in terms of the absolute equivocation [22], where the authors have shown th at the former definition could be replaced by the latter without any rate penalty for the wiretap channel.”
Wireless Information-Theoretic Security (2008, background): “Notice that the secrecy condition used here (and in [2], [3]) is weaker than the one proposed by Maurer and Wolf in [27] or Narayan and Csiszár in [28], where the information obtained by the eavesdropper is negligibly small not just in terms of rate but in absolute terms.”
Secrecy capacities for multiple terminals (2004, background): “Moreover, if is not required to be a function of , we could strengthen the uniformity condition (2) to strict uniformity, , without changing the strongly achievable rates, as in [11].”
The secrecy of compressed sensing measurements (2008, background): “Among other work, Diffie and Hellman [14] and Maurer and Wolf [15] address the secure exchange of secret keys.”
Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel (2007, background): “Maurer and Wolf [15] (see also [16]) have observed that for discrete memoryless channels, the secrecy capacity is not reduced even when one imposes the stronger requirement that I ( w ; y n e ) → 0 as n → ∞ . remains question However, we remark in advance that it an open whether a similar result hol”
The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming (2007, background): “Maurer and Wolf [14] suggested that the secrecy constraint developed by Wyner needed to be strengthened, since it constrains the rate of information leaked to the wire tapper, rather than the total information, and the information of interest might be in this small amount.”
Guaranteeing Secrecy using Artificial Noise (2008, methodology): “A stricter secrecy condition can be used which restricts the total amount of secret information obtained by the eavesdropper, using the techniques introduced in [19].”
Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel (2010, background): “Maurer and Wolf [20] (see also [21]) have observed that for discrete memoryless channels, the secrecy capacity is not reduced even when one imposes the stronger requirement that as .”
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes (2010, background): “It was shown by Maurer-Wolf [28] that any coding scheme that satisfies the “weak” security condition (2) can be convertedinto a coding scheme that satisfies the stronger condition (3).”
On the Secrecy Capacity of Fading Channels (2006, result): “We note that, as pointed out in [ 21 ], the perfect secrecy notion, defined in [2] and adopted in this correspondence, is weaker than the strong sense perfect secrecy requirement as defined in [1] which requires . In the definition above, we only require . Thus, although as increases, it is not clea”
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel (2010, background): “Maurer and Wolf [15] (see also [16]) have observed that for discrete memoryless channels, the secrecy capacity is not reduced even when one imposes the stronger requirement that I(w ; y e ) → 0 as n → ∞.”