Cryptology ePrint Archive: Report 2009/088

Available versions in chronological order

20090224:102752 (posted 24-Feb-2009 10:27:52 UTC): Re-randomizable Encryption implies Selective Opening Security; Brett Hemenway and Rafail Ostrovsky
20090305:192717 (posted 05-Mar-2009 19:27:17 UTC): Re-randomizable Encryption implies Selective Opening Security; Brett Hemenway and Rafail Ostrovsky
20090727:003501 (posted 27-Jul-2009 00:35:01 UTC): Lossy Encryption from General Assumptions; Brett Hemenway and Rafail Ostrovsky
20091102:023211 (posted 02-Nov-2009 02:32:11 UTC): Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security; Brett Hemenway and Benoit Libert and Rafail Ostrovsky and Damien Vergnaud
20120322:141453 (posted 22-Mar-2012 14:14:53 UTC): Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security; Brett Hemenway and Benoit Libert and Rafail Ostrovsky and Damien Vergnaud; Publication Info: A Preliminary Version of this work appeared in ASIACRYPT 2011