How do we define knowledge, and, crucially for cryptography, ignorance? In this chapter we lay the basis for future security proofs by formalizing the notion of knowledge of a quantum party, such as the memory of an eavesdropper, about a classical piece of information, such as a secret key. For this we introduce an appropriate measure of conditional entropy, the min-entropy, and introduce important tools to bound it using guessing games.
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.