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.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
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.