Introduction to provable security and its application in searchable encryption
Brij Bhooshan Gupta, Mamta · 2021
This chapter introduces the concept of provable security and its application in developing a secure searchable encryption. It provides the basic security definitions used in searchable encryption and also explains the different security models that can be employed to prove the security of a searchable encryption scheme. Provable Security, as the name suggests, it is a type of security that can be proved. Generally, it employs mathematical proofs, and most of the security proofs are done using a reduction approach. In the public-key setting, the first security definition for searchable encryption was given by Boneh et al. The security of searchable encryption schemes is generally proved by embedding the security assumptions into their construction. Security assumptions are well-known hard problems in cryptography. Most of the encryption schemes including the searchable encryption are proved secure in either the random oracle model or the standard model.