First Page | Document Content | |
---|---|---|
![]() Date: 2011-10-13 20:59:42Padding RSA Randomness extractor Random oracle Ciphertext indistinguishability Chosen-ciphertext attack Feistel cipher Plaintext-aware encryption Probabilistic encryption Cryptography Optimal asymmetric encryption padding Malleability | Source URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 341,48 KBShare Document on Facebook |
![]() | Format-Preserving Encryption Mihir Bellare1 , Thomas Ristenpart1 , Phillip Rogaway2 , and Till Stegers2 1 Dept. of Computer Science & Engineering, UC San Diego, La Jolla, CA 92093, USA 2DocID: 1qY1X - View Document |
![]() | Proceedings - NN - RFIDSec08DocID: 1qGBX - View Document |
![]() | D:/Documents/Courses/Winter 2014/aez/rae.dviDocID: 1qyAn - View Document |
![]() | On Generalized Feistel Networks Viet Tung Hoang and Phillip Rogaway Dept. of Computer Science, University of California, Davis, USA Abstract. We prove beyond-birthday-bound security for most of the well-known types of geDocID: 1q88i - View Document |
![]() | A Formal Treatment of Remotely Keyed Encryption? Matt Blaze1 Joan Feigenbaum1 Moni Naor2 AT&T Labs { Research 180 Park Avenue Florham Park, NJUSADocID: 1pT7s - View Document |