First Page | Document Content | |
---|---|---|
Date: 2012-07-05 18:15:11Computational hardness assumption Ciphertext indistinguishability Computer security Cyberwarfare Science Cryptography Cryptographic primitive Information-theoretic security | Proving Computational Security with a General-Purpose C Verifier A 5-Minute Talk Fran¸cois Dupressoir The Open UniversityAdd to Reading ListSource URL: csf2012.seas.harvard.eduDownload Document from Source WebsiteFile Size: 61,49 KBShare Document on Facebook |