ABSTRACT
This chapter discusses private-key encryption schemes. The first part defines a computationally secure private-key encryption as a tuple of probabilistic polynomial-time algorithms for key generation, encryption, and decryption and explains the differences with perfect secure counterparts. The next part of the chapter introduces the notion of pseudo randomness and defines a pseudo random generator. Subsequently, the construction of the private-key encryption scheme based on a pseudo random generator is presented with its security proof.
