We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Security being the major concern during data transfers, we have various challenges to face. The requirements of the security model vary depending on the type of data to be encrypte...
R. Satheesh Kumar, E. Pradeep, K. Naveen, R. Gunas...
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...