Quantum information is a valuable resource which can be encrypted in order to
protect it. We consider the size of the one-time pad that is needed to protect
quantum information in a number of cases. The situation is dramatically
different from the classical case: we prove that one can recycle the one-time
pad without compromising security. The protocol for recycling relies on
detecting whether eavesdropping has occurred, and further relies on the fact
that information contained in the encrypted quantum state cannot be fully
accessed. We prove the security of recycling rates when authentication of
quantum states is accepted, and when it is rejected. We note that recycling
schemes respect a general law of cryptography which we prove relating the size
of private keys, sent qubits, and encrypted messages. We discuss applications
for encryption of quantum information in light of the resources needed for
teleportation. Potential uses include the protection of resources such as
entanglement and the memory of quantum computers. We also introduce another
application: encrypted secret sharing and find that one can even reuse the
private key that is used to encrypt a classical message. In a number of cases,
one finds that the amount of private key needed for authentication or
protection is smaller than in the general case.Comment: 13 pages, improved rate of recycling proved in the case of rejection
of authenticatio