First Page | Document Content | |
---|---|---|
Date: 2007-12-18 01:20:50Computing Cryptographic protocols Models of computation Universal composability Turing machine Security parameter Computational complexity theory Actor model Ciphertext indistinguishability Theoretical computer science Applied mathematics Cryptography | DattaKuestersMitchellRamanathan-TCC-2005.dviAdd to Reading ListSource URL: theory.stanford.eduDownload Document from Source WebsiteFile Size: 216,71 KBShare Document on Facebook |