01. Short - number theory / finite field - background : class notes COMP-547

02. Classical error correcting codes : Madhu Sudan

03. Quantum error correcting codes : Gottesman

04. Classical information theory : BBCM
	Shannon, Renyi and Min-entropies
	Generalized Privacy Amplification - leftover hash Lemma

05. BB84 QKD

Shor-Preskill proof

Amount of tolerable errors (a survey)

Quantum teleportation, Quantum Vernam Cipher, density matrix / operators
	2 bits lower bound - MTW00
	~1 bit upper bound - HLSW03
Quantum public-key crypto

Quantum authentication - BCGST

Uncloneable encryption - Gottesman

Key recycling - DPS04

-------------------------------------------------------------

Quantum Oblivious Transfer
	without errors
	with errors
	from bit commitment

Quantum Bit Commitment
	proposals
	impossibility proof

two-prover Bit Commitment

Classical and Quantum Zero-knowledge

--------------------------------------------------------------

Classical and Quantum Secret Sharing

VQSS

Approximate QECC

---------------------------------------------------------------