Secure public-key encryption scheme without random oracles

An efficient incomparable public key encryption scheme

“…The data privacy of an encryption scheme requires the privacy of the encrypted data and it has been well documented in many literatures [2,7]. Security formalizations such as indistinguishability (semantic security) and non-malleability, under either Chosen-Plaintext Attack (CPA) or various kinds of Chosen-Ciphertext Attacks (CCA), have been studied and used to support various data-privacy requirements.…”

A chaos-based symmetric image encryption scheme using a bit-level permutation

“…This topic is not new and can be traced back to Shannon's classic paper [18]. In recent years, this has attracted increasing research attention [2][3][4][5][6][7][8][9][10][11]19,23]. Due to some interesting intrinsic features such as ergodicity, sensitivity to initial conditions and system parameters, the use of chaotic systems for data encryption has been studied extensively [3,[6][7][8][9][10][15][16][17][20][21][22]24,26].…”