The session will be divided into two parts. In the first part, I will introduce a framework for the composable security - Abstract Cryptography - proposed by Maurer and Renner . The main idea behind the composable security is to extend the stand-alone security definitions as they fail to capture the scenario when a (cryptographic) protocol is used as a subroutine of a larger protocol. Abstract cryptography can be used to define the security of cryptographic schemes such as symmetric encryption, message authentication codes, public-key encryption, digital signature schemes, etc and for proving the security of protocols making use of such schemes.
In the second part, I will provide a proof sketch of the composable security of quantum cryptographic protocols such as delegated quantum computation  and secure remote state preparation  using the framework of abstract cryptography.
We will mostly cover the results from these three papers:
 Ueli Maurer and Renato Renner. “Abstract cryptography” (https://www.crypto.ethz.ch/
 Vedran Dunjko et al. "Composable Security of Delegated Quantum Computation” (https://arxiv.org/pdf/1301.
 Alexandru Gheorghiu and Thomas Vidick. “Computationally-secure and composable remote state preparation” (https://arxiv.