<--- Back to Details
First PageDocument Content
Computing / Cryptographic protocols / Models of computation / Universal composability / Turing machine / Security parameter / Computational complexity theory / Actor model / Ciphertext indistinguishability / Theoretical computer science / Applied mathematics / Cryptography
Date: 2007-12-18 01:20:50
Computing
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.dvi

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 216,71 KB

Share Document on Facebook

Similar Documents

On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany

DocID: 1uZJK - View Document

Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth

DocID: 1uXvn - View Document

Secure Cryptographic Protocols for E-commerce Transaction on the Internet

DocID: 1uDkO - View Document

Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp

DocID: 1u5Us - View Document

Cryptographic schemes Protocols Specifications of primitives

DocID: 1u4P2 - View Document