<--- Back to Details
First PageDocument Content
Cryptographic protocols / Complexity classes / Probabilistic complexity theory / Zero-knowledge proof / Interactive proof system / IP / Quantum complexity theory / NP / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2007-01-18 15:34:42
Cryptographic protocols
Complexity classes
Probabilistic complexity theory
Zero-knowledge proof
Interactive proof system
IP
Quantum complexity theory
NP
Probabilistic Turing machine
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: crypto.cs.mcgill.ca

Download Document from Source Website

File Size: 6,55 MB

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