A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security

Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes based on any weak pseudorandom function (PRF) which can be much more efficiently implemented than PRFs. Damg

• Type: Conference
• Year: 2007
• Where: EUROCRYPT
• Authors: Ueli M. Maurer, Johan Sjödin
• Keywords: Cryptology, Efficient Symmetric Encryption, Encryption Scheme, EUROCRYPT 2007, Weak Prf