1. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case;Nielsen,2002
2. Non observability in the random oracle model;Ananth,2013
3. On the impossibility of constructing efficient key encapsulation and programmable hash functions in prime order groups;Hanaoka,2012
4. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack;Cramer,1998
5. A new paradigm of hybrid encryption scheme;Kurosawa,2004