Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter 6: From Imperfect Information to (Near) Perfect Security

Chapter 6: From Imperfect Information to (Near) Perfect Security

pp. 153-175

Authors

, California Institute of Technology, USA, , Delft University of Technology, The Netherlands
Resources available Unlock the full potential of this textbook with additional resources. There are free resources and Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Extract

In this chapter we consider the problem of amplifying secrecy, or uncertainty. This is the problem of privacy amplification: given a partially secret string, how do we make it almost-perfectly secret? This task forms one of the key building blocks in the protocol for quantum key distribution that we develop in later chapters. It can be solved using a fundamental object from the theory of pseudorandomness called a randomness extractor. We introduce an extractor based on hashing and show that it can be used to perform privacy amplification.

Keywords

  • Privacy amplification
  • randomness extractor
  • leftover hashing
  • quantum side information

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$59.99
Hardback
US$59.99

Have an access code?

To redeem an access code, please log in with your personal login.

If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.

Also available to purchase from these educational ebook suppliers