Advertisement

Unbreakable Keys from Random Noise

  • Ueli Maurer
  • Renato Renner
  • Stefan Wolf

Virtually all presently used cryptosystems can theoretically be broken by an exhaustive key-search, and they might even be broken in practice due to novel algorithms or progress in computer engineering. In contrast, by exploiting the fact that certain communication channels are inherently noisy, one can achieve encryption provably secure against adversaries with unbounded computing power, in arguably practical settings. This chapter discusses secret key-agreement by public discussion from correlated information in a new definitional framework for information-theoretic reductions.

Keywords

Hash Function Correlate Randomness Perfect Secrecy Information Reconciliation Authentic Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2007

Authors and Affiliations

  • Ueli Maurer
    • 1
  • Renato Renner
    • 2
  • Stefan Wolf
    • 1
  1. 1.Department of Computer ScienceETH ZürichSwitzerland
  2. 2.Institute for Theoretical PhysicsETH ZürichSwitzerland

Personalised recommendations